메뉴 건너뛰기




Volumn , Issue , 2008, Pages 232-241

Towards persistence-based reconstruction in euclidean spaces

Author keywords

ech complex; Filtration; Manifold reconstruction; Persistent homology; Rips complex; Witness complex

Indexed keywords

NITRATION; POROUS MATERIALS; REPAIR; RESTORATION; TOPOLOGY;

EID: 57349115995     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1377676.1377719     Document Type: Conference Paper
Times cited : (182)

References (33)
  • 1
    • 0033465068 scopus 로고    scopus 로고
    • Surface reconstruction by Vororioi filtering
    • N. Amenta and M. Bern. Surface reconstruction by Vororioi filtering. Discrete Comput. Geom., 22(4):481-504. 1999.
    • (1999) Discrete Comput. Geom , vol.22 , Issue.4 , pp. 481-504
    • Amenta, N.1    Bern, M.2
  • 2
  • 4
    • 84976826673 scopus 로고
    • Voronoi diagrams: A survey of a fundamental geometric data structure
    • September
    • F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345-405, September 1991.
    • (1991) ACM Comput. Surv , vol.23 , Issue.3 , pp. 345-405
    • Aurenhammer, F.1
  • 8
    • 84892331864 scopus 로고    scopus 로고
    • Delaunay triangulation based surface reconstruction
    • J.D. Boissonnat and M. Teillaud, editors, Springer
    • F. Cazals and J. Giesen. Delaunay triangulation based surface reconstruction. In J.D. Boissonnat and M. Teillaud, editors. Effective Computational Geometry for Curves and Surfaces, pages 231-273. Springer, 2006.
    • (2006) Effective Computational Geometry for Curves and Surfaces , pp. 231-273
    • Cazals, F.1    Giesen, J.2
  • 10
    • 18844412375 scopus 로고    scopus 로고
    • The λ-medial axis
    • July
    • F. Chazal and A. Lieutier. The λ-medial axis. Graphical Models, 67(4):304-331, July 2005.
    • (2005) Graphical Models , vol.67 , Issue.4 , pp. 304-331
    • Chazal, F.1    Lieutier, A.2
  • 11
    • 33748062672 scopus 로고    scopus 로고
    • Topology guaranteeing manifold reconstruction using distance function to noisy data
    • F. Chazal and A. Lieutier. Topology guaranteeing manifold reconstruction using distance function to noisy data. In Proc. 22nd Annu. Sympos. on Comput. Geom., pages 112-118, 2006.
    • (2006) Proc. 22nd Annu. Sympos. on Comput. Geom , pp. 112-118
    • Chazal, F.1    Lieutier, A.2
  • 16
    • 57349166371 scopus 로고    scopus 로고
    • V, de Silva. A weak definition of Delaunay triangulation. Technical report, Stanford University, October, To appear in
    • V, de Silva. A weak definition of Delaunay triangulation. Technical report, Stanford University, October 2003. To appear in Geometriae Dedicata.
    • (2003) Geometriae Dedicata
  • 18
    • 41849094721 scopus 로고    scopus 로고
    • Coverage in sensor networks via persistent homology
    • V. de Silva and R. Ghrist. Coverage in sensor networks via persistent homology. Algebraic & Geometric Topology, 7:339-358, 2007.
    • (2007) Algebraic & Geometric Topology , vol.7 , pp. 339-358
    • de Silva, V.1    Ghrist, R.2
  • 19
    • 84972498049 scopus 로고
    • An extension of Tietze's theorem
    • J. Dugundji. An extension of Tietze's theorem. Pacific J. Math., 1:353-367, 1951.
    • (1951) Pacific J. Math , vol.1 , pp. 353-367
    • Dugundji, J.1
  • 20
    • 51249162203 scopus 로고
    • The union of balls and its dual shape
    • H. Edelsbrunner. The union of balls and its dual shape. Discrete Comput. Georn., 13:415-440, 1995.
    • (1995) Discrete Comput. Georn , vol.13 , pp. 415-440
    • Edelsbrunner, H.1
  • 23
  • 24
    • 57349162830 scopus 로고    scopus 로고
    • Barcodes: The persistent topology of data
    • October
    • R Ghrist. Barcodes: The persistent topology of data. Bull. Amer. Math. Soc., October 2007.
    • (2007) Bull. Amer. Math. Soc
    • Ghrist, R.1
  • 25
  • 29
    • 40349102105 scopus 로고    scopus 로고
    • Finding the homology of subrnanifolds with high confidence from random samples
    • to appear
    • P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of subrnanifolds with high confidence from random samples. Discrete Comput. Geom., to appear.
    • Discrete Comput. Geom
    • Niyogi, P.1    Smale, S.2    Weinberger, S.3
  • 30
    • 57349134721 scopus 로고    scopus 로고
    • S. Y. Oudot. On the topology of the restricted Delaunay triangulation and witness complex in higher dimensions. Technical report, Stanford University, November 2006. LANL arXiv:0803.1296v1 [cs.CG], http://arxiv.org/abs/0803.1296.
    • S. Y. Oudot. On the topology of the restricted Delaunay triangulation and witness complex in higher dimensions. Technical report, Stanford University, November 2006. LANL arXiv:0803.1296v1 [cs.CG], http://arxiv.org/abs/0803.1296.
  • 31
    • 33244484866 scopus 로고    scopus 로고
    • Towards computing homology from approximations
    • V, Robins. Towards computing homology from approximations. Topology, 24:503-532, 1999.
    • (1999) Topology , vol.24 , pp. 503-532
    • Robins, V.1
  • 32
    • 0001228780 scopus 로고
    • A new algorithm for generating all the maximal independent sets
    • S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. on Computing. 6:505-517, 1977.
    • (1977) SIAM J. on Computing , vol.6 , pp. 505-517
    • Tsukiyama, S.1    Ide, M.2    Ariyoshi, H.3    Shirakawa, I.4
  • 33


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.