70 search results - page 5 / 14 » On Convex Quadrangulations of Point Sets on the Plane |
151
click to vote
SODA
1996
ACM
15 years 7 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
178
click to vote
CCCG
2009
15 years 7 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
135
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
178
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
259
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...