PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lieutier, André"

Author of the publication

copydeleteadd this publication to your clipboard
Topology guaranteeing manifold reconstruction using distance function to noisy data.

, and . Symposium on Computational Geometry, page 112-118. ACM, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

André Jaquemod University of Stuttgart

Univ. -Prof. Dr. rer. nat. André Thess University of Stuttgart

Dr. -Ing. André Buchau University of Stuttgart

André Loescher University of Stuttgart

Dr. phil. André Tomalka University of Stuttgart

 

Other publications of authors with the same name

Topology guaranteeing manifold reconstruction using distance function to noisy data., and . Symposium on Computational Geometry, page 112-118. ACM, (2006)Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes., , and . Symposium on Computational Geometry, page 491-500. ACM, (2011)Domain Theory and Differential Calculus (Functions of one Variable)., and . LICS, page 277-286. IEEE Computer Society, (2002)Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees., and . Comput. Geom., 40 (2): 156-170 (2008)Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes., , and . Comput. Geom., 46 (4): 448-465 (2013)Geometry-driven Collapses for Converting a Čech Complex into a Triangulation of a Nicely Triangulable Shape., and . Discrete & Computational Geometry, 54 (4): 798-825 (2015)The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces., , and . Symposium on Computational Geometry, volume 99 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Complexity of the delaunay triangulation of points on surfaces the smooth case., , and . Symposium on Computational Geometry, page 201-210. ACM, (2003)Computability in Computational Geometry., , and . CiE, volume 3526 of Lecture Notes in Computer Science, page 117-127. Springer, (2005)Any open bounded subset of Rn has the same homotopy type than its medial axis.. Symposium on Solid Modeling and Applications, page 65-75. ACM, (2003)