An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron

DOI10.1142/S0218195922500029MaRDI QIDQ5104669zbMATH OpenFDO

Authors Kazuma Tateiri, Toru Ohmoto

Publication date 15 September 2022

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.06164

zbMATH Keywords

cut locusgeodesicssource unfoldingwavefront propagation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Abstract: In the present paper, we propose a novel generalization of the celebrated MMP algorithm in order to find the wavefront propagation and the cut-locus on a convex polyhedron with an emphasis on actual implementation for instantaneous visualization and numerical computation.

Recommendations

• Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
• The Discrete Geodesic Problem
• scientific article; zbMATH DE number 1102588
• Efficiently determining a locally exact shortest path on polyhedral surfaces
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

Cites work

• A survey of geodesic paths on 3D surfaces
• Convex Polyhedra
• Geometric folding algorithms. Linkages, origami, polyhedra
• scientific article; zbMATH DE number 54061 (Why is no real title available?)
• Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface
• The Discrete Geodesic Problem

Describes a project that uses

Uses Software

• Thaw

This page was built for publication: An extended MMP algorithm: wavefront and cut-locus on a convex polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5104669)