The following pages link to The Discrete Geodesic Problem (Q3028357):
Displaying 35 items.
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Space complexity of exact discrete geodesic algorithms on regular triangulations (Q2628269) (← links)
- Discrete exterior calculus for meshes with concyclic polygons (Q2693678) (← links)
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526) (← links)
- DIG: Discrete Iso-contour Geodesics for Topological Analysis of Voxelized Objects (Q2815202) (← links)
- Shortest descending paths: towards an exact algorithm (Q2893462) (← links)
- Shortest Path Problems on a Polyhedral Surface (Q3183449) (← links)
- A Pseudopolynomial Algorithm for Alexandrov’s Theorem (Q3183474) (← links)
- On the Optimality of Shape and Data Representation in the Spectral Domain (Q3192647) (← links)
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER (Q3527435) (← links)
- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains (Q3541078) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
- Efficient runner networks for investment castings (Q4506062) (← links)
- Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913) (← links)
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124) (← links)
- SKEW VORONOI DIAGRAMS (Q4949988) (← links)
- A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
- An Extended MMP Algorithm: Wavefront and Cut-Locus on a Convex Polyhedron (Q5104669) (← links)
- A Geometrical Method for Low-Dimensional Representations of Simulations (Q5228365) (← links)
- Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
- Parallel chen-han (PCH) algorithm for discrete geodesics (Q5419165) (← links)
- Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface (Q5471251) (← links)
- Time-minimal paths amidst moving obstacles in three dimensions (Q5958315) (← links)
- Pursuit evasion on polyhedral surfaces (Q5963379) (← links)
- How to walk your dog in the mountains with no magic leash (Q5964220) (← links)
- (Q6065409) (← links)
- Shortest Journeys in Directed Temporal Graphs (Q6066460) (← links)
- Computing the Riemannian center of mass on meshes (Q6098162) (← links)
- A quasi-meshfree method for constructing boundary-aware reproducing bases on geometrically complex domains using manifold geodesics (Q6194195) (← links)
- Efficient exact enumeration of single-source geodesics on a non-convex polyhedron (Q6552515) (← links)
- Towards geodesic ridge curve for region-wise linear representation of geodesic distance field (Q6563879) (← links)
- Geometric triangulations and discrete Laplacians on manifolds: an update (Q6579117) (← links)
- Splines on manifolds: a survey (Q6592887) (← links)
- A quasi-meshfree method for nonlinear solid mechanics: separating domain discretization from solution discretization (Q6643619) (← links)
