Shortest polygonal paths in space

DOI10.1007/BF02250584MaRDI QIDQ756442zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On Shortest Paths in Polyhedral Spaces
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• scientific article; zbMATH DE number 3907791
• Shortest paths in the plane with polygonal obstacles
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

Cites work

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

Cited in

(12)

• Shortest paths for line segments
• A finite descent method for Steiner's problem of inpolygons with minimal circumference
• Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
• scientific article; zbMATH DE number 7685241 (Why is no real title available?)
• scientific article; zbMATH DE number 123833 (Why is no real title available?)
• An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
• Polygonal path simplification with angle constraints
• The funnel tree algorithm for finding shortest paths on polyhedral surfaces
• Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
• Shortest Path in a Polygon using Sublinear Space.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756442)