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.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Price excludes VAT (USA)
Tax calculation will be finalised during checkout.
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.
Bárányi, I., and Füredi, Z., Empty simplices in Euclidean space,Canad. Math. Bull,30 (1987), 436–445.
Chazelle, B., Guibas, L., and Lee, D., The power of geometric duality,BIT,25 (1985), 76–90.
Edelsbrunner, H., and Guibas, L., Topologically sweeping an arrangement,J. Comput. System Sci.,38 (1989), 165–194.
Edelsbrunner, H., O'Rourke, J., and Seidel, R., Constructing arrangements of lines and hyperplanes with applications,SIAM J. Comput.,15 (1986), 341–363.
Erdös, P., Combinatorial problems in geometry and number theory,Proc. Sympos. Pure Math.,34 (1979), 149–162.
Harborth, H., Konvex Fünfecke in ebenen Punktmengen,Elem. Math.,33 (1978), 116–118.
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.
Horton, J. D., Sets with no empty convex 7-gons,Canad. Math. Bull,26 (1983), 482–484.
Rung, H. T., Luccio, F., and Preparata, F. P., On finding the maxima of a set of vectors,J. Assoc. Comput. Mach.,22 (1975), 469–476.
Overmars, M. H., Scholten, B., and Vincent, I., Sets without empty convex 6-gons,Bull EATCS,37 (1989), 160–168.
Communicated by C. K. Wong.
The first author is pleased to acknowledge support by the National Science Foundation under Grant CCR-8700917. The research of the second author was supported by Amoco Foundation Faculty Development Grant CS 1-6-44862 and by the National Science Foundation under Grant CCR-8714565.
Rights and permissions
About this article
Cite this article
Dobkin, D.P., Edelsbrunner, H. & Overmars, M.H. Searching for empty convex polygons. Algorithmica 5, 561–571 (1990). https://doi.org/10.1007/BF01840404
- Computational geometry
- Empty convex subsets
- Analysis of algorithms
- Combinatorial geometry