Offset polygon and annulus placement problems
DOI10.1016/J.COMGEO.2013.10.003zbMATH Open1283.52031OpenAlexW4237051571MaRDI QIDQ390158FDOQ390158
Authors: Gill Barequet, Alex Goryachev 
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.10.003
Recommendations
- Offset-polygon annulus placement problems
- Offset-polygon annulus placement problems
- Exact and approximate construction of offset polygons
- Optimizing a constrained convex polygonal annulus
- scientific article; zbMATH DE number 446701
- scientific article; zbMATH DE number 177890
- Mitered offsets and skeletons for circular arc polygons
- scientific article; zbMATH DE number 4165895
- scientific article; zbMATH DE number 4051003
- Circuminscribed polygons in a plane annulus
optimization\(\delta\)-annulus\(\delta\)-offset polygoncontainment problemmaximum coverpartial containment problemtolerancing
Numerical mathematical programming methods (65K05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Cited In (8)
- Offset-polygon annulus placement problems
- Capturing points with a rotating polygon (and a 3D extension)
- Optimizing a constrained convex polygonal annulus
- Offset-polygon annulus placement problems
- Covering points with a polygon
- Computing a Minimum-Width Square Annulus in Arbitrary Orientation
- Red-blue rectangular annulus cover problem
- Computing a minimum-width square annulus in arbitrary orientation
This page was built for publication: Offset polygon and annulus placement problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390158)
