Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131): Difference between revisions

@@ Property / cites work @@
+Star Unfolding of a Polytope with Applications
@@ Property / cites work: Star Unfolding of a Polytope with Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Point Location in a Monotone Subdivision
@@ Property / cites work: Optimal Point Location in a Monotone Subdivision / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Search in Planar Subdivisions
@@ Property / cites work: Optimal Search in Planar Subdivisions / rank @@
+Normal rank
@@ Property / cites work @@
+The Discrete Geodesic Problem
@@ Property / cites work: The Discrete Geodesic Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for shortest-path motion in three dimensions
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+On Shortest Paths in Polyhedral Spaces
@@ Property / cites work: On Shortest Paths in Polyhedral Spaces / rank @@
+Normal rank