scientific article; zbMATH DE number 1305036
From MaRDI portal
Publication:4251963
Recommendations
- scientific article; zbMATH DE number 26895
- Geodesic spanners on polyhedral surfaces
- Geodesics on flat surfaces
- Geodesics on regular constant distance surfaces
- Vertex to Vertex Geodesics on Platonic Solids
- Geodesic curve computations on surfaces
- Geodesics on regular polyhedra with endpoints at the vertices
- Geodesic-like curves on parametric surfaces
Cited in
(29)- Geodesic Walks in Polytopes
- The time scale calculus approach to the geodesic problem in 3D dynamic data sets
- On the angular defect of triangulations and the pointwise approximation of curvatures
- scientific article; zbMATH DE number 7151640 (Why is no real title available?)
- Bending models of lipid bilayer membranes: spontaneous curvature and area-difference elasticity
- The funnel tree algorithm for finding shortest paths on polyhedral surfaces
- Computing the Riemannian center of mass on meshes
- Geodesic polyhedra and nets
- An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing
- Parallel Chen-Han (PCH) algorithm for discrete geodesics
- Affine invariant geometry for non-rigid shapes
- Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
- scientific article; zbMATH DE number 7561219 (Why is no real title available?)
- Geometric triangulations and discrete Laplacians on manifolds: an update
- Computing approximately shortest descending paths on convex terrains via multiple shooting
- Estimating differential quantities using polynomial fitting of osculating jets
- Geodesic curve computations on surfaces
- A geometric method for computation of geodesic on parametric surfaces
- Discrete derivatives of vector fields on surfaces -- an operator approach
- Geodesic-like curves on parametric surfaces
- Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
- De Casteljau's algorithm on manifolds
- Straightest Paths on Meshes by Cutting Planes
- Multiple shooting approach for computing approximately shortest paths on convex polytopes
- Non-uniform interpolatory subdivision schemes with improved smoothness
- Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves
- Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
- Geodesics on point clouds
- Geodesics in non-positively curved plane tessellations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251963)
