COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON

DOI10.1142/S021819590300127XzbMath1093.68124OpenAlexW2141214294MaRDI QIDQ4818604

Laura Heinrich-Litan, Pat Morin, Peter Brass

Publication date: 29 September 2004

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

Full work available at URL: https://doi.org/10.1142/s021819590300127x

zbMATH Keywords

geometric optimizationcenter of areaTukey center

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items (3)

Centerpoints: A Link Between Optimization and Convex Geometry ⋮ Centerpoints: A Link between Optimization and Convex Geometry ⋮ An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon

Cites Work

• Another efficient algorithm for convex hulls in two dimensions
• Geometric applications of a randomized optimization technique
• An efficient algorithm for determining the convex hull of a finite planar set
• Algorithms for Reporting and Counting Geometric Intersections

This page was built for publication: COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON