279 search results - page 19 / 56 » Implicit Convex Polygons |
COMGEO
1998
ACM
13 years 7 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we present a novel approach for sampling and reconstructing any K-sided convex and bilevel polygon with the use of exponential splines [1]. It will be shown that wit...
MP
2011
12 years 10 months ago
2011
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
SIAMDM
2010
13 years 6 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
STACS
1990
Springer
13 years 11 months ago
1990
Springer
We consider the problem of approximating a convex gure in the plane by a pair (r; R) of homothetic (that is, similar and parallel) rectangles with r C R. We show the existenc...