How to cut corners and get bounded convex curvature

DOI10.1007/s00454-022-00404-warXiv1603.02080WikidataQ114229298 ScholiaQ114229298MaRDI QIDQ6045790

Mikkel Thorup, Mikkel Abrahamsen

Publication date: 12 May 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

bounded curvaturepocket machiningcircular ray shooting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability by paths of bounded curvature in a convex polygon
• Length minimising bounded curvature paths in homotopy classes
• Hierarchical decompositions and circular ray shooting in simple polygons
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Pocket machining based on contour-parallel tool paths generated by means of proximity maps
• Ray shooting in polygons using geodesic triangulations
• Voronoi diagrams and offset curves of curvilinear polygons.
• Algebraic methods and arithmetic filtering for exact predicates on circle arcs
• Visibility and ray shooting queries in polygonal domains
• Finding the Maximum Subset with Bounded Convex Curvature
• Disks in Curves of Bounded Convex Curvature
• Curvature-Constrained Shortest Paths in a Convex Polygon
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk

This page was built for publication: How to cut corners and get bounded convex curvature