A Bound on a Convexity Measure for Point Sets

DOI10.1142/S0218195919500110zbMath1468.52004arXiv1409.4344OpenAlexW3023259629MaRDI QIDQ5149560

Danny Rorabaugh

Publication date: 11 February 2021

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.4344

zbMATH Keywords

convexityplanar geometryangle measurepolygonization

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of empty convex quadrilaterals of a finite set in the plane
• On a partition into convex polygons
• On simple polygonalizations with optimal area
• The Number of Triangulations on Planar Point Sets
• Polygonal entropy: A convexity measure
• On the number of disjoint convex quadrilaterals for a planar point set

This page was built for publication: A Bound on a Convexity Measure for Point Sets