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

12/12/2021
by   Kazuma Tateiri, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 4

research
06/15/2020

Numerical computation of the cut locus via a variational approximation of the distance function

We propose a new method for the numerical computation of the cut locus o...
research
02/22/2021

Cut Locus Realizations on Convex Polyhedra

We prove that every positively-weighted tree T can be realized as the cu...
research
10/25/2020

How to Find the Convex Hull of All Integer Points in a Polyhedron?

We propose a cut-based algorithm for finding all vertices and all facets...
research
03/05/2019

Cut Polytopes of Minor-free Graphs

The cut polytope of a graph G is the convex hull of the indicator vector...
research
03/19/2021

Continuous iterative algorithms for anti-Cheeger cut

As a judicious correspondence to the classical maxcut, the anti-Cheeger ...
research
12/07/2018

Cut polytope has vertices on a line

The cut polytope CUT(n) is the convex hull of the cut vectors in a comp...
research
01/03/2022

A New Modeling of Classical Folds in Computational Origami

This paper shows a cut along a crease on an origami sheet makes simple m...

Please sign up or login with your details

Forgot password? Click here to reset