The Discrete Geodesic Problem
From MaRDI portal
Publication:3028357
Recommendations
Cited in
(98)- Geodesic distance approximation using a surface finite element method for the p-Laplacian
- Between shapes, using the Hausdorff distance
- Discrete Lagrangian algorithm for finding geodesics on triangular meshes
- Random field simulation over curved surfaces: applications to computational structural mechanics
- CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
- Efficient exact enumeration of single-source geodesics on a non-convex polyhedron
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- A survey of geodesic paths on 3D surfaces
- Storing the subdivision of a polyhedral surface
- scientific article; zbMATH DE number 2087475 (Why is no real title available?)
- Ordered line integral methods for solving the eikonal equation
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- An optimal-time algorithm for shortest paths on realistic polyhedra
- On realistic terrains
- Ununfoldable polyhedra with convex faces
- Towards geodesic ridge curve for region-wise linear representation of geodesic distance field
- Visibility graphs and obstacle-avoiding shortest paths
- An algorithmic approach to some problems in terrain navigation
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
- Geometric triangulations and discrete Laplacians on manifolds: an update
- An improved algorithm for the shortest descending path on a convex terrain
- SKEW VORONOI DIAGRAMS
- scientific article; zbMATH DE number 727953 (Why is no real title available?)
- curvedSpaceSim: a framework for simulating particles interacting along geodesics
- Topological analysis of voxelized objects by discrete geodesic Reeb graph
- Approximating generalized distance functions on weighted triangulated surfaces with applications
- DIG: discrete iso-contour geodesics for topological analysis of voxelized objects
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Geodesic convexity in discrete spaces
- A numerical simulation of neural fields on curved geometries
- scientific article; zbMATH DE number 1507956 (Why is no real title available?)
- Splines on manifolds: a survey
- Geodesics on point clouds
- Computing generalized higher-order Voronoi diagrams on triangulated surfaces
- A new algorithm for shortest paths among obstacles in the plane
- On maximum flows in polyhedral domains
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
- Computing the Riemannian center of mass on meshes
- Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing
- Near optimal algorithm for the shortest descending path on the surface of a convex terrain
- On finding spherical geodesic paths and circles in \(\mathbb Z^{3}\)
- A geometrical method for low-dimensional representations of simulations
- Higher-order Voronoi diagrams on triangulated surfaces
- Space complexity of exact discrete geodesic algorithms on regular triangulations
- On the number of shortest descending paths on the surface of a convex terrain
- Facility location on a polyhedral surface
- Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
- Shortest Path Problems on a Polyhedral Surface
- Designing approximation minimal parametric surfaces with geodesics
- Craniofacial reconstruction evaluation by geodesic network
- Geodesics on the regular tetrahedron and the cube
- Shortest monotone descent path problem in polyhedral terrain
- Time-minimal paths amidst moving obstacles in three dimensions
- Approximation algorithms for shortest descending paths in terrains
- scientific article; zbMATH DE number 3907791 (Why is no real title available?)
- An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Shortest descending paths through given faces
- Shortest path problems on a polyhedral surface
- Shortest paths in portalgons
- How to walk your dog in the mountains with no magic leash
- Shortest polygonal paths in space
- Wrapping spheres with flat paper
- scientific article; zbMATH DE number 597698 (Why is no real title available?)
- The transportation metric and related problems
- A quasi-meshfree method for constructing boundary-aware reproducing bases on geometrically complex domains using manifold geodesics
- A primal-dual level set method for computing geodesic distances
- Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
- Splitting (complicated) surfaces is hard
- Parallel rectilinear shortest paths with rectangular obstacles
- On different topological classes of spherical geodesic paths and circles in \(\mathbb{Z}^3\)
- scientific article; zbMATH DE number 7765371 (Why is no real title available?)
- Parallel Chen-Han (PCH) algorithm for discrete geodesics
- A Pseudopolynomial Algorithm for Alexandrov’s Theorem
- A quasi-meshfree method for nonlinear solid mechanics: separating domain discretization from solution discretization
- Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- COMPUTING SHORTEST PATHS ON POLYHEDRA: APPLICATIONS IN GEOMETRIC MODELING AND SCIENTIFIC VISUALIZATION
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- Shortest Journeys in Directed Temporal Graphs
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Fast geodesics computation with the phase flow method
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Straightest Paths on Meshes by Cutting Planes
- Discrete exterior calculus for meshes with concyclic polygons
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- A unified framework for computing geodesic distances on nonorientable manifold polyhedral surfaces
- Pursuit evasion on polyhedral surfaces
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
- Efficient piecewise-linear function approximation using the uniform metric
- Navigating weighted regions with scattered skinny tetrahedra
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Shortest descending paths: towards an exact algorithm
- On the optimality of shape and data representation in the spectral domain
- Computing approximately shortest descending paths on convex terrains via multiple shooting
This page was built for publication: The Discrete Geodesic Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028357)
