99 search results - page 5 / 20 » On empty convex polygons in a planar point set |
104
click to vote
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
SODA
1996
ACM
15 years 27 days 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...
CCCG
2010
15 years 1 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
101
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
CCCG
2010
15 years 1 months ago
2010
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...