Geodesic remeshing using front propagation

International Journal of Computer Vision

Volumn 69, Issue 1, 2006, Pages 145-156

  Peyré, Gabriel ^a   Cohen, Laurent D ^b  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Deformable models; Fast marching algorithm; Geodesic computation; Mesh segmentation; Remeshing; Surface parameterization; Texture mapping

Indexed keywords

DEFORMABLE MODELS; FAST MARCHING ALGORITHM; GEODESIC COMPUTATION; MESH SEGMENTATION; REMESHING; SURFACE PARAMETERIZATION; TEXTURE MAPPING;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; PROBLEM SOLVING; THREE DIMENSIONAL;

GEODESY;

EID: 33646881516     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-006-6859-3     Document Type: Article

References (39)

1. Alliez, P., Cohen-Steiner, D., Devillers, O., Levy, B., and Desbrun, M. 2003. Anisotropic Polygonal Remeshing. ACM Transactions on Graphics. Special Issue for SIGGRAPH Conference, pp. 485-493.
2. Bengio, Y., Paiement, J.-R, and Vincent, P. 2003. Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering. Proc. NIPS, 2003.
3. Chen, J. and Hahn, Y. 1990. Shortest Path on a Polyhedron. Proc. 6th ACM Sympos, Comput Geom pp. 360-369.
4. Chew, L.P. 1993. Guaranteed-Quality Mesh Generation for Curved Surfaces. In Proc. of the Ninth Symposium on Computational Geometry, pp. 274-280.
5. Cohen, L. 2001. Multiple contour finding and perceptual grouping using minimal paths. Journal of Mathematical Imaging and Vision, 14(3):225-236.
6. Cohen, L.D. and Kimmel, R. 1997. Global minimum for active contour models: A minimal path approach. International Journal of Computer Vision 24(1):57-78.
7. Cohen-Steiner, D. and Morvan, J.-M. 2003. Restricted delaunay triangulations and normal cycles. In Proc. 19th ACM Sympos, Comput. Geom. pp. 237-246.
8. Delingette, H. 1999. General object reconstruction based on simplex meshes. International Journal of Computer Vision, 32(2): 111-146.
9. Desbrun, M., Meyer, M., and Alliez, P. 2002. Intrinsic parameterizations of surface meshes. Eurographics Conference Proceedings, 21(2):209-218.
10. Eldar, Y., Lindenbaum, M., Porat, M., and Zeevi, Y. 1997. The farthest point strategy for progressive image sampling. IEEE Trans. on Image Processing, 6(9): 1305-1315.
11. Floater, M.S., Hormann, K., and Reimers, M. 2002. Parameterization of manifold triangulations. Approximation Theory X: Abstract and Classical Analysis, pp. 197-209.
12. Fua, P. 1997. From multiple stereo views to multiple 3-D Surfaces. International Journal of Computer Vision, 24(1):19-35.
13. Gu, X. and Yau, S.-T. 2003. Global conformal surface parameterization. In Proc, ACM Symposium on Geometry Processing, 2003 pp. 127-137.
14. Hoppe, H. 1996. Progressive meshes. In Proc. ACM SIGGRAPH 1996 pp. 99-108.
15. Khodakovsky, A., Litke, N., and Schröder, P. 2003. Globally smooth parameterizations with low distortion. ACM Transactions on Graphics. Special Issue for SIGGRAPH Conference, pp. 350-357.
16. Kimmel, R. and Sethian, J. 1998. Computing geodesic paths on manifolds. Proc. Natl. Acad. Sci., 95(15):8431-8435.
17. Kimmel, R. and Sethian, J.A. 2000. Fast voronoi diagrams on triangulated surfaces. In Proc. of the 16th European Workshop on Comp. Geom., (EUROCG-00). pp. 1-4.
18. Kunert, G. 2002. Towards anisotropic mesh construction and error estimation in the finite element method. Numerical Methods in PDE, 18:625-648.
19. Lee, A.W.F., Schröder, P., Sweldens, W., Cowsar, L., and Dobkin, D. 1998. MAPS: Multiresolution adaptive parameterization of surfaces. Computer Graphics 32(Ann. Conf. Series), 95-104.
20. Leibon, G. and Letscher, D. 2000. Delaunay triangulations and voronoi diagrams for riemannian manifolds. ACM Symposium on Computational Geometry, pp. 341-349.
21. Manay, S. and Yezzi, A. 2003. Second-order models for computing distance transforms. In Proc. IEEE Variational, Geometric and Level Set Methods 2003, pp. 105-112.
22. McInerney, T. and Terzopoulos, D. 1996. Deformable models in medical image analysis: A survey. Medical Image Analysis 1(2):91-108.
23. Moenning, C. and Dodgson, N.A. 2003. Fast marching farthest point sampling. In Proc. EURO-GRAPHICS, 2003.
24. Onishi, K. and Itoh, J. 2003. Estimation of the necessary number of points in Riemannian Voronoi diagram. In Proc. CCCG 2003, pp. 19-24.
25. Osher, S. and Paragios, N. 2003. Geometric Level Set Methods in Imaging, Vision, and Graphics. Springer-Verlag New York, Inc.
26. Peyré, G. and Cohen, L.D. 2003. Geodesic remeshing using front propagation. In Proc. IEEE Variational, Geometric and Level Set Methods 2003, pp. 33-40.
27. Peyré, G. and Cohen, L.D. 2004a. Geodesic computations for fast and accurate surface flattening. Preprint CMAP.
28. Peyré, G. and Cohen, L.D. 2004b. Surface Segmentation Using Geodesic Centroidal Tesselation. In Proc. IEEE 3D Data Processing Visualization Transmission 2004, pp. 995-1002.
29. Roweis, S. and Saul, L. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323-2326.
30. Ruppert, J. 1995. A delaunay refinement algorithm for quality 2-Dimensional mesh generation. Journal of Algorithms, 18(3):548-585.
31. Sander, P., Wood, Z., Gortler, S., Snyder, J., and Hoppe, H. 2003. Multi-chart geometry images. Proc. Symposium on Geometry Processing 2003 pp. 146-155.
32. Sethian, J. 1999. Level Sets Methods and Fast Marching Methods. 2nd edition, Cambridge University Press.
33. Sifri, O., Sheffer, A., and Gotsman, C. 2003. Geodesic-based surface remeshing. In Proc. 12th International Meshing Roundtable, pp. 189-199.
34. Surazhsky, V., Alliez, P., and Gotsman, C. 2003. Isotropic remeshing of surfaces: A Local Parameter-ization Approach. In Proc. 12th International Meshing Roundtable.
35. Tenenbaum, J.B., de Silva, V., and Langford, J.C. 2000. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319-2323.
36. Terzopoulos, D. and Vasilescu, M. 1992. Adaptive meshes and shells: Irregular triangulation, dis-continuities, and hierarchical subdivision. In Proc. IEEE CVPR 92. Champaign, Illinois, pp. 829-832.
37. Tsitsiklis, J. 1995. Efficient algorithms for globally optimal trajectories. IEEE Trans. on Automatic Control.
38. Ulichney, R. 1993. The void-and-cluster method for generating dither arrays. Proc. IS&T Symposium on Electronic Imaging Science & Technology, San Jose, CA 1913(9):332-343.
39. Zigelman, G., Kimmel, R., and Kiryati, N. 2002. Texture mapping using surface flattening via multi-dimensional scaling. IEEE Trans. on Visualization and Computer Graphics, 8(1):198-207.