Optimizing a constrained convex polygonal annulus

DOI10.1016/j.jda.2003.12.004zbMath1066.90099MaRDI QIDQ1775012

Prosenjit Bose, Gill Barequet, Michael T. Goodrich, Matthew T. Dickerson

Publication date: 4 May 2005

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2003.12.004

zbMATH Keywords

Optimization; Annuli; Offset; Tolerancing

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

Covering points with a polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Offset-polygon annulus placement problems
• Optimal output-sensitive convex hull algorithms in two and three dimensions
• Testing the quality of manufactured disks and balls
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• An optimal algorithm for roundness determination on convex polygons
• Smallest enclosing cylinders
• Translating a convex polygon to contain a maximum number of points.
• The Ultimate Planar Convex Hull Algorithm?
• Computational Geometry in C
• ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
• Voronoi diagrams for convex polygon-offset distance functions
• Exact and approximation algorithms for minimum-width cylindrical shells