A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study this problem for the properties of convexity and emptiness. We show that finding empty triangles is related to the problem of determining pairs of vertices that see each other in a star-shaped polygon. A linear-time algorithm for this problem which is of independent interest yields an optimal algorithm for finding all empty triangles. This result is then extended to an algorithm for finding empty convex r-gons (r> 3) and for determining a largest empty convex subset. Finally, extensions to higher dimensions are mentioned.
Key wordsComputational geometry Empty convex subsets Analysis of algorithms Combinatorial geometry
Unable to display preview. Download preview PDF.
- Avis, D., and Rappaport, D., Computing the largest empty convex subset of a set of points,Proc. 1st Ann. ACM Sympos. Comput. Geom., 1985, pp. 161–167.Google Scholar
- Erdös, P., Combinatorial problems in geometry and number theory,Proc. Sympos. Pure Math.,34 (1979), 149–162.Google Scholar
- Hershberger, J., Finding the visibility graph of a simple polygon in time proportional to its size,Proc. 3rd Ann. ACM Sympos. Comput. Geom., 1987, pp. 11–20.Google Scholar