ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE

DOI10.1142/S021819599900008XzbMath1026.65012OpenAlexW2138565607MaRDI QIDQ4513237

Ravi Janardan, Michiel H. M. Smid

Publication date: 7 November 2000

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

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

zbMATH Keywords

widthVoronoi diagramroundness

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Optimal consensus set for digital flake hyperspheres in \(n\)D ⋮ Optimizing a constrained convex polygonal annulus ⋮ Certified efficient global roundness evaluation

Cites Work

• Efficient randomized algorithms for some geometric optimization problems
• An optimal algorithm for roundness determination on convex polygons
• Applications of Parametric Searching in Geometric Optimization
• Approximation by circles

This page was built for publication: ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE