메뉴 건너뛰기




Volumn 18, Issue 12, 2006, Pages 1595-1612

Parallel divide-and-conquer scheme for 2D Delaunay triangulation

Author keywords

Delaunay triangulation; Parallel algorithm; Unstructured mesh generation

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER SYSTEMS; DATA REDUCTION; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER); TRIANGULATION;

EID: 33749316456     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1007     Document Type: Article
Times cited : (33)

References (11)
  • 4
    • 0000259094 scopus 로고    scopus 로고
    • Design and implementation of a practical parallel Delaunay algorithm
    • Blelloch GE, Hardwick JC, Miller GL, Talmor D. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica 1999; 24:243-269.
    • (1999) Algorithmica , vol.24 , pp. 243-269
    • Blelloch, G.E.1    Hardwick, J.C.2    Miller, G.L.3    Talmor, D.4
  • 6
    • 84942026338 scopus 로고
    • Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
    • Guibas L, Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Transactions on Graphics 1985; 4:74-123.
    • (1985) ACM Transactions on Graphics , vol.4 , pp. 74-123
    • Guibas, L.1    Stolfi, J.2
  • 7
    • 0023210272 scopus 로고
    • A faster divide and conquer algorithm for constructing Delaunay triangulation
    • Dwyer RA. A faster divide and conquer algorithm for constructing Delaunay triangulation. Algorithmica 1987; 2:137-151.
    • (1987) Algorithmica , vol.2 , pp. 137-151
    • Dwyer, R.A.1
  • 11
    • 0348164422 scopus 로고
    • Algorithm 63 (partition) and algorithm 65 (find)
    • Hoare CAR. Algorithm 63 (partition) and algorithm 65 (find). Communications of the ACM 1961; 4:321-322.
    • (1961) Communications of the ACM , vol.4 , pp. 321-322
    • Hoare, C.A.R.1


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