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

06/15/2020
by   François Générau, et al.
0

We propose a new method for the numerical computation of the cut locus of a compact submanifold of R^3 without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We illustrate the versatility of our approach by the approximation of voronoi cells on embedded surface of R^3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/12/2021

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

In the present paper, we propose a novel generalization of the celebrate...
research
01/28/2020

Variational phase recovering without phase unwrapping in phase-shifting interferometry

We present a variational method for recovering the phase term from the i...
research
07/07/2020

Approximation of surface diffusion flow: a second order variational Cahn–Hilliard model with degenerate mobilities

This paper tackles the approximation of surface diffusion flow using a C...
research
06/02/2020

Stochastic Approximation Cut Algorithm for Inference in Modularized Bayesian Models

Bayesian modelling enables us to accommodate complex forms of data and m...
research
05/18/2021

Numerical Solution for an Inverse Variational Problem

In the present work, firstly, we use a minimax equality to prove the exi...
research
12/23/2021

A Weighted State Redistribution Algorithm for Embedded Boundary Grids

State redistribution is an algorithm that stabilizes cut cells for embed...
research
09/07/2014

A Computational Model of the Short-Cut Rule for 2D Shape Decomposition

We propose a new 2D shape decomposition method based on the short-cut ru...

Please sign up or login with your details

Forgot password? Click here to reset