Deconstructing approximate offsets

DOI10.1007/s00454-012-9441-5zbMath1254.68293arXiv1109.2158OpenAlexW2070878335MaRDI QIDQ1930550

Michael Kerber, Roza Pogalnikova, Dan Halperin, Eric Berberich

Publication date: 11 January 2013

Published in: Discrete \& Computational Geometry, Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.2158

zbMATH Keywords

Minkowski sumsoffsetsdeconstructionpolygonal smoothing

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Multi-robot motion planning for unit discs with revolving areas

Uses Software

• CGAL
• 2D Minkowski sums
• 2D Regularized Boolean Set-Operations
• 2D polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Another efficient algorithm for convex hulls in two dimensions
• On the computational geometry of pocket machining
• Finding minimal convex nested polygons
• An efficient algorithm for determining the convex hull of a finite planar set
• Minkowski decomposition of convex sets
• BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS
• An algorithm for generating NC tool paths for arbitrarily shaped pockets with islands
• Decomposition of polytopes and polynomials

This page was built for publication: Deconstructing approximate offsets