Level set driven smooth curve approximation from unorganized or noisy point set
ESAIM. Proceedings, Tome 27 (2009), pp. 254-271
Cet article a éte moissonné depuis la source EDP Sciences
In this paper, we propose a curve construction method for a non uniform point data set based on a minimal curve approximation model. Numerically, the level set method is used for curve reconstruction. We represent the shape of the curve through its distance function and formulate curve reconstruction as a constrained minimization problem. We solve the minimization problem on a highly anisotropic triangulation to improve the accuracy of the numerical scheme. This method can handle complex geometries and deal with arbitrary topologies as well as with noisy data sets. Several numerical examples are provided to show the efficiency of the proposed approach.
@article{EP_2009_27_a14,
author = {A. Claisse and P. Frey},
title = {Level set driven smooth curve approximation from unorganized or noisy point set},
journal = {ESAIM. Proceedings},
pages = {254--271},
year = {2009},
volume = {27},
doi = {10.1051/proc/2009031},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/proc/2009031/}
}
TY - JOUR AU - A. Claisse AU - P. Frey TI - Level set driven smooth curve approximation from unorganized or noisy point set JO - ESAIM. Proceedings PY - 2009 SP - 254 EP - 271 VL - 27 UR - http://geodesic.mathdoc.fr/articles/10.1051/proc/2009031/ DO - 10.1051/proc/2009031 LA - en ID - EP_2009_27_a14 ER -
A. Claisse; P. Frey. Level set driven smooth curve approximation from unorganized or noisy point set. ESAIM. Proceedings, Tome 27 (2009), pp. 254-271. doi: 10.1051/proc/2009031
Cité par Sources :