메뉴 건너뛰기




Volumn 7501 LNCS, Issue , 2012, Pages 731-742

The simplex tree: An efficient data structure for general simplicial complexes

Author keywords

data structure; flag complex; relaxed witness complex; Rips complex; simplicial complex; witness complex

Indexed keywords

FLAG COMPLEX; RELAXED WITNESS COMPLEX; RIPS COMPLEX; SIMPLICIAL COMPLEX; WITNESS COMPLEX;

EID: 84866684782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33090-2_63     Document Type: Conference Paper
Times cited : (19)

References (11)
  • 1
    • 79960191232 scopus 로고    scopus 로고
    • Efficient data structure for representing and simplifying simplicial complexes in high dimensions
    • Attali, D., Lieutier, A., Salinas, D.: Efficient data structure for representing and simplifying simplicial complexes in high dimensions. In: SoCG 2011, pp. 501-509 (2011)
    • (2011) SoCG 2011 , pp. 501-509
    • Attali, D.1    Lieutier, A.2    Salinas, D.3
  • 2
    • 0030781644 scopus 로고    scopus 로고
    • Fast algorithms for sorting and searching strings
    • Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: SODA 1997, pp. 360-369 (1997)
    • (1997) SODA 1997 , pp. 360-369
    • Bentley, J.L.1    Sedgewick, R.2
  • 4
    • 85033242084 scopus 로고
    • Representing geometric structures in d dimensions: Topology and order
    • Brisson, E.: Representing geometric structures in d dimensions: topology and order. In: SCG 1989, pp. 218-227 (1989)
    • (1989) SCG 1989 , pp. 218-227
    • Brisson, E.1
  • 8
    • 84866641079 scopus 로고    scopus 로고
    • Private communication
    • Hornus, S.: Private communication
    • Hornus, S.1
  • 9
    • 0038092753 scopus 로고
    • N-dimensional generalized combinatorial maps and cellular quasi-manifolds
    • Lienhardt, P.: N-dimensional generalized combinatorial maps and cellular quasi-manifolds. Int. J. Comput. Geometry Appl. 4(3), 275-324 (1994)
    • (1994) Int. J. Comput. Geometry Appl. , vol.4 , Issue.3 , pp. 275-324
    • Lienhardt, P.1
  • 11
    • 77954929689 scopus 로고    scopus 로고
    • The tidy set: A minimal simplicial set for computing homology of clique complexes
    • Zomorodian, A.: The tidy set: a minimal simplicial set for computing homology of clique complexes. In: SCG 2010, pp. 257-266 (2010)
    • (2010) SCG 2010 , pp. 257-266
    • Zomorodian, A.1


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