137 search results - page 1 / 28 » On polygons excluding point sets |
CCCG
2010
13 years 6 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
ENDM
2007
13 years 4 months ago
2007
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
CCCG
2010
13 years 6 months ago
2010
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
CVPR
2000
IEEE
14 years 7 months ago
2000
IEEE
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
CCCG
2008
13 years 6 months ago
2008
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...