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

DOI10.1142/S021819599900008XMaRDI QIDQ4513237zbMATH OpenOpenAlexFDO

Authors Ravi Janardan, Michiel 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

Voronoi diagramwidthroundness

Mathematics Subject Classification ID

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

Recommendations

• On the width of a planar convex set containing zero or one lattice points
• scientific article; zbMATH DE number 66676
• scientific article; zbMATH DE number 3944477
• On the sets of points on the plane with integer-valued distances
• On the distinct distances determined by a planar point set
• scientific article; zbMATH DE number 987445
• Approximating the diameter of a set of points in the Euclidean space
• A note on diameters of point sets
• Publication:4861416
• Approximating the Radii of Point Sets

Cites work

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

Cited in

(5)

• Optimizing a constrained convex polygonal annulus
• Optimal consensus set for digital flake hyperspheres in \(n\)D
• COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
• Certified efficient global roundness evaluation
• The strip of minimum width covering a centrally symmetric set of points

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513237)