Shortest polygonal paths in space

DOI10.1007/BF02250584zbMath0722.68098OpenAlexW1561670232MaRDI QIDQ756442

D. Kharzeev

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02250584

zbMATH Keywords

convex functionlinear time algorithmfunnelconstrained pathsshortest inpolygonsshortest polygonal paths

Mathematics Subject Classification ID

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

Related Items (3)

Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments ⋮ Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves ⋮ An Exact Algorithm for Minimizing a Sum of Euclidean Norms on Rays in 2D and 3D

Cites Work

• Unnamed Item
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Optimum watchman routes
• An optimal solution to a wire-routing problem
• The Discrete Geodesic Problem
• Euclidean shortest paths in the presence of rectilinear barriers
• A finite descent method for Steiner's problem of inpolygons with minimal circumference
• On Shortest Paths in Polyhedral Spaces
• Visibility graphs and obstacle-avoiding shortest paths
• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner

This page was built for publication: Shortest polygonal paths in space