Shortest path problems on a polyhedral surface

DOI10.1007/s00453-012-9723-6zbMath1307.68084OpenAlexW2081888796MaRDI QIDQ472466

Carola Wenk, Atlas F. IV. Cook

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2033/

zbMATH Keywords

Voronoi diagramFréchet distanceconvex polyhedral surfaceEuclidean shortest pathshortest path map

Mathematics Subject Classification ID

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

Related Items (5)

Unnamed Item ⋮ Shortest Path Problems on a Polyhedral Surface ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ Shortest path problems on a polyhedral surface ⋮ How to walk your dog in the mountains with no magic leash

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Shortest path problems on a polyhedral surface
• Computing the Fréchet distance between piecewise smooth curves
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Nonoverlap of the star unfolding
• New similarity measures between polylines with applications to morphing and polygon sweeping
• Queries on Voronoi diagrams on moving points
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• The Discrete Geodesic Problem
• Shortest Path Problems on a Polyhedral Surface
• The Number of Shortest Paths on the Surface of a Polyhedron
• Determining approximate shortest paths on weighted polyhedral surfaces
• Walking your dog in the woods in polynomial time
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Star Unfolding of a Polytope with Applications
• Voronoi Diagrams of Moving Points
• Parametric search made practical
• Slowing down sorting networks to obtain faster sorting algorithms
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Fréchet Distance for Curves, Revisited
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Approximate Shortest Path Queries on Weighted Polyhedral Surfaces

This page was built for publication: Shortest path problems on a polyhedral surface