An optimal transport approach to robust reconstruction and simplification of 2D shapes

Computer Graphics Forum

Volumn 30, Issue 5, 2011, Pages 1593-1602

  De Goes, Fernando ^a   Cohen Steiner, David ^b   Alliez, Pierre ^b   Desbrun, Mathieu ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS;

DELAU-NAY TRIANGULATIONS; DIRAC MEASURES; GRAY-SCALE IMAGES; LINE DRAWINGS; OPTIMAL TRANSPORT; ROBUST RECONSTRUCTION; SIMPLICIAL COMPLEX; SIMPLIFICATION ALGORITHMS;

GEOMETRY;

EID: 84870154998     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2011.02033.x     Document Type: Article

References (35)

1. AMENTA N., BERN M., EPPSTEIN D.: The crust and the beta-skeleton: Combinatorial curve reconstruction. GMIP Proceedings 60, 2 (1998), 125-135.
2. ALLIEZ P., COHEN-STEINER D., TONG Y., DESBRUN M.: Voronoi-based variational reconstruction of unoriented point sets. In Symposium on Geometry Processing (2007), pp. 39-48.
3. AGARWAL P. K., HAR-PELED S., MUSTAFA N. H., WANG Y.: Near-linear time approximation algorithms for curve simplification. Lecture Notes in Computer Science 2461 (2002), 29-41.
4. 1-sparse reconstruction of sharp point set surfaces. ACM Trans. on Graphics 29, 5 (2010), 1-12.
5. ATTALI D.: R-regular shape reconstruction from unorganized points. In Proc. of ACMSymp. on Comp. Geometry (1997), pp. 248-253.
6. CHAZAL F., COHEN-STEINER D., MERIGOT Q.: Geometric Inference for Measures based on Distance Functions. Tech. Rep. 00383685, INRIA, 2009.
7. CHENG S.-W., FUNKE S., GOLIN M., KUMAR P., POON S.-H., RAMOS E.: Curve reconstruction from noisy samples. In Proc. of the Conf. on Comp. Geometry (2003), pp. 302-311.
8. CGAL, Computational Geometry Algorithms Library. http://www.cgal.org.
9. DYKEN C, DÆHLEN M., SEVALDRUD T.: Simultaneous curve simplification. Journal of Geographical Systems 11, 3 (2009), 273-289.
10. DEY T. K., EDELSBRUNNER H., GUHA S., NEKHAYEV D. V.: Topology preserving edge contraction. Publ. Inst. Math. (Beograd) 66 (1999), 23-45.
11. DE GOES F., GOLDENSTEIN S., DESBRUN M., VELHO L.: Exoskeleton: Curve network abstraction for 3d shapes. Comput. Graph. 35 (Feb 2011), 112-121.
12. DEY T. K., KUMAR P.: A simple provable algorithm for curve reconstruction. In SODA Proceedings (1999), pp. 893-894.
13. DEY T. K., MEHLHORN K., RAMOS E. A.: Curve reconstruction: Connecting dots with good reason. SoCG Procedings 15 (1999), 229-244.
14. DEY T. K., WENGER R.: Fast reconstruction of curves with sharp corners. Int. J. Comput. Geometry Appl 12, 5 (2002), 353-400.
15. EDELSBRUNNER H. KIRKPATRICK D. G. SEIDEL R.: On the shape of a set of points in the plane. IEEE Trans. on Information Theory 29 (1983), 551-559.
16. FLEISHMAN S., COHEN-OR D., SILVA C.: Robust moving least-squares fitting with sharp features. In Proceedings of ACM SIGGRAPH (2005).
17. FUNKE S., RAMOS E. A.: Reconstructing a collection of curves with corners and endpoints. In SODA Proceedings (2001), pp. 344-353.
18. GOLD C., SNOEYINK J.: A one-step crust and skeleton extraction algorithm. Algorithmica 30 (2001).
19. GARLAND M., ZHOU Y.: Quadric-based simplification in any dimension. ACM Transactions on Graphics 24, 2 (2005), 209-239.
20. HERSHBERGER J., SNOEYINK J.: An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification. In SoCG (1994), pp. 383-384.
21. KAZHDAN M., BOLITHO M., HOPPE H.: Poisson Surface Reconstruction. In SGP Proceedings (2006), pp. 61-70.
22. KRASNOSHCHEKOV D. N., POLISHCHUK V.: Robust curve reconstruction with k-order alpha-shapes. In Shape Modeling International (2008), pp. 279-280.
23. KOLLURI R., SHEWCHUK J. R., O'BRIEN J. F.: Spectral surface reconstruction from noisy point clouds. In SGP Proceedings (2004), pp. 11-21.
24. LIPMAN Y., DAUBECHIES I.: Conformal wasserstein distances: Comparing surfaces in polynomial time. Advances in Mathematics (2010).
25. LEE I.-K.: Curve reconstruction from unorganized points. Computer Aided Geometric Design 17, 2 (2000), 161-177.
26. MUKHOPADHYAY A., DAS A.: Curve reconstruction in the presence of noise. In CGIV Proceedings (2007), pp. 177-182.
27. MI X., DECARLO D., STONE M.: MÉMOLI F.: Gromov-wasserstein distances and the metric approach to object matching. Foundations of Computational Mathematics (2011).
28. MELHI M., IPSON S. S., BOOTH W.: A novel triangulation procedure for thinning hand-written text. Pattern Recognition Letters 22, 10 (2001), 1059-1071.
29. MULLEN P., MEMARI P., DE GOES F., DESBRUN M.: HOT: Hodge Optimized Triangulations. ACM Trans. Graph. 30 (July 2011).
30. MEHRA R., TRIPATHI P., SHEFFER A., MITRA N. J.: Visibility of noisy point cloud data. Computers and Graphics 34(3) (2010), 219-230.
31. PREPARATA F., SHAMOS M.: Computational Geometry: An Introduction. Springer-Verlag, 1985.
32. RUIZ O., VANEGAS C. A., CADAVID C.: Ellipse-based principal component analysis for self-intersecting curve reconstruction from noisy point sets. The Visual Computer 27, 3 (2011), 227.
33. SONG Y.: Boundary fitting for 2d curve reconstruction. The Visual Computer 26 (2010), 187-204.
34. VILLANI C.: Topics in Optimal Transportation. American Mathematical Society, 2010.
35. WU J., KOBBELT L.: Fast mesh decimation by multiple-choice techniques. In Proceedings of the Vision, Modeling, and Visualization Conference (2002), pp. 241-248.