Abstract
For a planar point set P in general position, we study the ratio between the maximum area of an empty triangle with vertices in P and the area of the convex hull of P.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fleischer, R., Mehlhorn, V., Rote, G., Welzl, E., Yap, C.: Simultaneous inner and outer approximation of shapes. Algorithmica 8, 365–389 (1992)
Harborth, H.: Konvexe Funfecke in Ebenen Punktmengen. Elem. Math. 33, 116–118 (1978)
Komlós, J., Pintz, J., Szeméredi, E.: On Heilbronn’s triangle problem. J. London Mathematical Society 24(2), 385–396 (1981)
Komlós, J., Pintz, J., Szeméredi, E.: A lower bound for Heilbronn’s problem. J. London Mathematical Society 25(2), 13–24 (1982)
Sás, E.: On a certain extremum-property of the ellipse (in Hungarian, English summary). Mat. Fiz. Lapok 48, 533–542 (1941)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hosono, K., Hurtado, F., Urabe, M., Urrutia, J. (2005). On a Triangle with the Maximum Area in a Planar Point Set. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds) Combinatorial Geometry and Graph Theory. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-30540-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24401-1
Online ISBN: 978-3-540-30540-8
eBook Packages: Computer ScienceComputer Science (R0)