99 search results - page 2 / 20 » On empty convex polygons in a planar point set |
127
click to vote
CCCG
2006
15 years 1 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
100
click to vote
SIGACT
2008
14 years 11 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
CCCG
2008
15 years 1 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...
CCCG
2009
15 years 21 days ago
2009
Given n points in the plane, we study three optimization problems of computing an empty pseudo-triangle: we consider minimizing the perimeter, maximizing the area, and minimizing ...
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
