Offset-polygon annulus placement problems

DOI10.1007/3-540-63307-3_76zbMath1497.68517OpenAlexW1887667123MaRDI QIDQ5096954

Amy J. Briggs, Michael T. Goodrich, Matthew T. Dickerson, Gill Barequet

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_76

zbMATH Keywords

robot localizationtolerancingoffsettingoptimal polygon placement

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Optimal placement of convex polygons to maximize point containment

Cites Work

• Iterated nearest neighbors and finding minimal polytopes
• Computing the smallest \(k\)-enclosing circle and related problems
• An optimal algorithm for roundness determination on convex polygons
• Applications of Parametric Searching in Geometric Optimization
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Offset-polygon annulus placement problems