Offset-polygon annulus placement problems

DOI10.1016/S0925-7721(98)00025-XzbMath0913.68199OpenAlexW1999752839WikidataQ128018867 ScholiaQ128018867MaRDI QIDQ1276941

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

Publication date: 2 February 1999

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00025-x

zbMATH Keywords

robot localizationtolerancingoffsettingoptimal polygon placement

Mathematics Subject Classification ID

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

Related Items (10)

Minimum-width rectangular annulus ⋮ Voronoi diagrams for polygon-offset distance functions ⋮ Computing a minimum-width square annulus in arbitrary orientation ⋮ Minimum Width Rectangular Annulus ⋮ Covering points with a polygon ⋮ Voronoi diagrams for convex polygon-offset distance functions ⋮ Optimizing a constrained convex polygonal annulus ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ Computing a Minimum-Width Square Annulus in Arbitrary Orientation ⋮ Geometric applications of posets

Cites Work

• Iterated nearest neighbors and finding minimal polytopes
• Computing the smallest \(k\)-enclosing circle and related problems
• Efficient randomized algorithms for some geometric optimization problems
• An optimal algorithm for roundness determination on convex polygons
• Translating a convex polygon to contain a maximum number of points.
• Applications of Parametric Searching in Geometric Optimization
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
• Voronoi diagrams for polygon-offset distance functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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