An optimal algorithm for roundness determination on convex polygons

DOI10.1016/0925-7721(95)00004-6zbMath0855.68035OpenAlexW2019561667MaRDI QIDQ1917034

Yanyan Li

Publication date: 14 July 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00004-6

zbMATH Keywords

minimum radial separation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Continuous location of dimensional structures. ⋮ Optimizing a constrained convex polygonal annulus ⋮ Measure of circularity for parts of digital boundaries and its fast computation ⋮ Offset-polygon annulus placement problems ⋮ Offset-polygon annulus placement problems ⋮ Certified efficient global roundness evaluation ⋮ ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE

Cites Work

• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Optimal Point Location in a Monotone Subdivision
• Medial Axis Transformation of a Planar Shape
• Unnamed Item

This page was built for publication: An optimal algorithm for roundness determination on convex polygons