The following pages link to The Discrete Geodesic Problem (Q3028357):
Displaying 50 items.
- Geodesics on the regular tetrahedron and the cube (Q329550) (← links)
- Approximating generalized distance functions on weighted triangulated surfaces with applications (Q425342) (← links)
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain (Q450580) (← links)
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- On the number of shortest descending paths on the surface of a convex terrain (Q553957) (← links)
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces (Q732480) (← links)
- Shortest polygonal paths in space (Q756442) (← links)
- Between shapes, using the Hausdorff distance (Q824335) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Fast geodesics computation with the phase flow method (Q860276) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\) (Q888442) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- On realistic terrains (Q934023) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- Higher-order Voronoi diagrams on triangulated surfaces (Q987784) (← links)
- Shortest descending paths through given faces (Q1025303) (← links)
- Wrapping spheres with flat paper (Q1028228) (← links)
- The transportation metric and related problems (Q1041811) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- A numerical simulation of neural fields on curved geometries (Q1628359) (← links)
- Computing approximately shortest descending paths on convex terrains via multiple shooting (Q1715706) (← links)
- Geodesics on point clouds (Q1719261) (← links)
- Topological analysis of voxelized objects by discrete geodesic Reeb graph (Q1747502) (← links)
- Designing approximation minimal parametric surfaces with geodesics (Q1788755) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- Ununfoldable polyhedra with convex faces (Q1869740) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Discrete Lagrangian algorithm for finding geodesics on triangular meshes (Q1985213) (← links)
- Random field simulation over curved surfaces: applications to computational structural mechanics (Q1986783) (← links)
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing (Q2139148) (← links)
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models (Q2180624) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Craniofacial reconstruction evaluation by geodesic network (Q2262704) (← links)
- Ordered line integral methods for solving the eikonal equation (Q2291900) (← links)
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces (Q2357709) (← links)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves (Q2384118) (← links)
- An improved algorithm for the shortest descending path on a convex terrain (Q2434932) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
