메뉴 건너뛰기




Volumn 37, Issue 12, 1994, Pages 2005-2039

Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; STATISTICS; THREE DIMENSIONAL; TOPOLOGY;

EID: 0028447010     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.1620371203     Document Type: Article
Times cited : (363)

References (28)
  • 3
    • 84986999022 scopus 로고
    • ‘Applications of mesh generation to complex 3‐D configurations’, AGARD Conf. Proc., No. 464, May
    • (1989)
  • 10
    • 84986999043 scopus 로고
    • ‘Sur la sphere vide’, Bull. Acad. Sci. URSS, Class. Sci. Nat.
    • (1934) , pp. 793-800
    • Delaunay, B.1
  • 11
    • 84987017479 scopus 로고
    • ‘The generation of unstructured grids using Dirichlet tessellations’, Princeton University, MAE Report No. 1715, July
    • (1985)
    • Weatherill, N.P.1
  • 14
    • 84987030242 scopus 로고
    • ‘Three‐dimensional mesh generation by triangulation of arbitrary point sets’, Proc. AIAA 8th CFD Conf., Hawaii, June
    • (1987)
    • Baker, T.J.1
  • 20
    • 0000734331 scopus 로고
    • Nouvelles applicatons des parametre continus a la theorie des formes quadratiques. Recherches sur les paralleltoedres primitifs
    • (1908) J. Reine angew. Math. , vol.134
    • Vororoi, G.1
  • 22
    • 0019563697 scopus 로고
    • Computing the n‐dimensional Delaunay tesallation with application to Voronoi polytopes
    • (1981) Comput. J. , vol.24 , pp. 167-172
    • Watson, D.F.1


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