New results on shortest paths in three dimensions
From MaRDI portal
Publication:5361664
DOI10.1145/997817.997839zbMath1373.68429OpenAlexW2132457975MaRDI QIDQ5361664
Joseph S. B. Mitchell, Micha Sharir
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/997817.997839
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Touring a sequence of disjoint polygons: complexity and extension, Computing the trajectories for the development of optimal routes, An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures, Flying over a polyhedral terrain, Navigating Weighted Regions with Scattered Skinny Tetrahedra, An approximation algorithm for computing shortest paths in weighted 3-d domains, Shortest monotone descent path problem in polyhedral terrain, A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes, A Model for Optimal Human Navigation with Stochastic Effects, Geodesics in CAT(0) cubical complexes, Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach, Path homotopy invariants and their application to optimal trajectory planning, Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings, A polynomial time algorithm to compute geodesics in CAT(0) cubical complexes, Some Discrete Properties of the Space of Line Transversals to Disjoint Balls, Shortest descending paths through given faces
