Exact and approximate construction of offset polygons

DOI10.1016/J.CAD.2007.01.010zbMATH Open1206.65119OpenAlexW2110770130MaRDI QIDQ628173FDOQ628173

Authors: Ron Wein 

Publication date: 4 March 2011

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cad.2007.01.010

Recommendations

• Deconstructing approximate offsets
• Deconstructing approximate offsets
• Exact Minkowski sums of polygons with holes
• Exact Minkowski sums of polygons with holes
• Polygon offsetting using a Voronoi diagram and two stacks.

zbMATH Keywords

robustnessMinkowski sumsexact geometric computation\texttt{Cgal}offset polygons

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Software, source code, etc. for problems pertaining to geometry (51-04)

Cited In (10)

• Exact offset procedures for simple solids
• Polygon offsetting using a Voronoi diagram and two stacks.
• Swift and stable polygon growth and broken line offset.
• Offset-polygon annulus placement problems
• Offset-polygon annulus placement problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• 2D Minkowski sums
• Title not available (Why is that?)
• Offset polygon and annulus placement problems

Uses Software

• CGAL

This page was built for publication: Exact and approximate construction of offset polygons

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