Optimizing a constrained convex polygonal annulus

DOI10.1016/J.JDA.2003.12.004MaRDI QIDQ1775012zbMATH OpenOpenAlexFDO

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

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

OptimizationAnnuliOffsetTolerancing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Offset-polygon annulus placement problems
• Offset-polygon annulus placement problems
• Offset polygon and annulus placement problems
• Minimum-width square annulus intersecting polygons
• Computing constrained minimum-width annuli of point sets

Cites work

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

Cited in

(5)

• Offset-polygon annulus placement problems
• Offset-polygon annulus placement problems
• Covering points with a polygon
• Isoperimetric triangular enclosures with a fixed angle
• Offset polygon and annulus placement problems

This page was built for publication: Optimizing a constrained convex polygonal annulus

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