COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
DOI10.1142/S021819590300127XzbMATH Open1093.68124OpenAlexW2141214294MaRDI QIDQ4818604FDOQ4818604
Authors: 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
Recommendations
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
Cited In (9)
- Title not available (Why is that?)
- The Santalo point of a planar convex set
- An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
- Centerpoints: A Link Between Optimization and Convex Geometry
- Title not available (Why is that?)
- Computing a centerpoint of a finite planar set of points in linear time
- Algorithms for computing centroids
- On Computing the Centroid of the Vertices of an Arrangement and Related Problems
- Centerpoints: a link between optimization and convex geometry
This page was built for publication: COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818604)