Geodesic delaunay triangulation and witness complex in the plane

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 571-580

  Gao, Jie ^a   Guibas, Leonidas J ^b   Oudot, Steve Y ^b   Wang, Yue ^a  

^a Stony Brook University   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY TRIANGULATION (DT); FEATURE SIZES; HOMOTOPY; LOCAL GEOMETRY; SAMPLING CONDITIONS; SIMULATION RESULTS;

POWER SPECTRAL DENSITY; SENSOR NETWORKS; TRIANGULATION;

GEODESY;

EID: 53149144130     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. N. Amenta and M Bern. Surface reconstruction by Voronoi filtering. Discrete Comput. Geom., 22(4):481-504, 1999.
2. N. Amenta, M. Bern, and D. Eppstein. The crust and the β-skeleton: Combinatorial curve reconstruction. Graphical Models and Image Processing, 60:125-135, 1998.
3. D. Attali, H. Edelsbrunner, and Y. Mileyko. Weak witnesses for Delaunay triangulations of submanifolds. In Proc. ACM Sympos. on Solid and Physical Modeling, pages 143-150, 2007.
4. H. Blum. A transformation for extracting new descriptors of shape. In W. Wathen-Dunn, editor, Models for the Perception of Speech and Visual Form, pages 362-380. MIT Press, 1967.
5. A. I. Bobenko and B. A. Springborn. A discrete laplacebeltrami operator for simplicial surfaces. Technical Report, 2005.
6. J.-D. Boissonnat, L. J. Guibas, and S. Y. Oudot. Manifold reconstruction in arbitrary dimensions using witness complexes. In Proc. 23rd ACM Sympos. on Comput. Geom., pages 194-203. 2007.
7. J.-D. Boissonnat and S. Oudot. Provably good sampling and meshing of Lipschitz surfaces. In Proc. 22nd Annu. Sympos. Comput. Geom., pages 337-346, 2006.
8. K. Borsuk. On the imbeddings of systems of compacta in simplicial complexes. Fund. Math., 35:217-234, 1948.
9. D. Burago, Y. Burago, and S. lvanov. A Course in Metric Geometry, volume 33 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2001.
10. G. Carlsson, A. Zomorodian, A. Collins, and L. Guibas. Persistence barcodes for shapes. In Proc. Symp. Geom. Process., pages 127-138, 2004.
11. E Chazal, D. Cohen-Steiner, and A. Lieutier. A sampling theory for compact sets in Euclidean space. In Proc. 22nd Annu. ACM Sympos. Comput. Geom., pages 319-326, 2006.
12. n from noisy data samples. In Proc. 21st Annual ACM Symposium on Computational Geometry, pages 255-262, 2005.
13. S.-W. Cheng, T. K. Dey, and E. A. Ramos. Manifold reconstruction from point samples. In Proc. 16th Sympos. Discrete Algorithms, pages 1018-1027, 2005.
14. D. Cohen-Steiner, H. Edelsbrunner, and J. Harer. Stability of persistence diagrams. In Proc. 21st ACM Sympos. Comput. Geom., pages 263-271, 2005.
15. V. de Silva. A weak definition of Delaunay triangulation. Technical report, Stanford University, October 2003.
16. V. de Silva and G. Carlsson. Topological estimation using witness complexes. In Proc. Sympos. Point-Based Graphics, pages 157-166, 2004.
17. T. K. Dey and S. Goswami. Provable surface reconstruction from noisy samples. Computational Geometry: Theory and Applications, 35(1-2): 124-141, 2006.
18. R. Dyer, H. Zhang, and T. Moeller. Delaunay mesh construction. In Proc. Eurographics Sympos. Geometry Processing, pages 273-282, 2007.
19. J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk. Discrete and Computational Geometry, 31(1):37-59, 2004.
20. J. Erickson and K. Whittlesey. Greedy optimal homotopy and homology generators. In Proc. 16th ACM-SlAM Sympos. on Discrete algorithms, pages 1038-1046, 2005.
21. Q. Fang, J. Gao, and L. J. Guibas. Landmark-based information storage and retrieval in sensor networks. In Proc. IEEE INFOCOM '06, pages 1-12, April 2006.
22. Q. Fang. J. Gao, L. J. Guibas, V. de Silva, and L. Zhang. GLIDER: gradient landmark-based distributed routing for sensor networks. In Proc. IEEE INFOCOM'05, volume 1, pages 339-350, 2005.
23. M. Fisher, B. Springborn, A. I. Bobenko, and P. Schroder. An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing. In SIGGRAPH Courses, pages 69-74, 2006.
24. D. Freedman and C. Chen. Measuring and localizing homology classes. Technical Report, Rensselaer Polytechnic Institute, May 2007.
25. J. Gao, L. J. Guibas. S. Y. Oudot, and Y. Wang. Geodesic Delaunay triangulation and witness complex in the plane. Full version. http://geometry.stanford.edu/papers/ggow-gdtwcp-08/ggow-gdtwcp-08-full.pdf.
26. R. Ghrist and A. Muhammad. Coverage and hole-detection in sensor networks via homology. In Proc. the 4th International Symposium on Information Processing in Sensor Networks (IPSN'05), pages 254-260, 2005.
27. L. G. Guibas and S. Y. Oudot. Reconstruction using witness complexes. In Proc. 18th Sympos. on Discrete Algorithms, pages 1076-1085, 2007.
28. A. Hatcher. Algebraic Topology. Cambridge University Press, 2001.
29. A. Kolmogorov and V. Tikhomirov. ∈;entropy and ∈-capacity of sets of functions. Translations of the AMS, 17:277-364, 1961.
30. G. Leibon and D. Letscher. Delaunay triangulations and Voronoi diagrams for Riemannian manifolds. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 341-349, 2000.
31. P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom., to appear.
32. Y. Wang, J. Gao, and J. S. B. Mitchell. Boundary recognition in sensor networks by topological methods. In Proc. Mobi-Com, pages 122-133, September 2006.
33. W.-T. Wu. On a theorem of Leray. Chinese Mathematics, 2:398-410, 1962.
34. A. Zomorodian and G. Carlsson. Computing persistent homology. Discrete Comput. Geom., 33(2):249-274. 2005.