Piecewise linear paths among convex obstacles

DOI10.1007/BF02570694zbMath0939.68876OpenAlexW2010483875MaRDI QIDQ1894717

Mark T. de Berg, Otfried Schwarzkopf, Ji{ří} Matoušek

Publication date: 1 August 1995

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

Full work available at URL: https://eudml.org/doc/131390

Mathematics Subject Classification ID

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

Related Items (2)

The visibility-Voronoi complex and its applications ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles

Cites Work

• The Hecke bicategory
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Simplified Voronoi diagrams
• Applications of random sampling to on-line algorithms in computational geometry
• A linear algorithm for determining the separation of convex polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Piecewise linear paths among convex obstacles