메뉴 건너뛰기




Volumn 61, Issue 9, 2004, Pages 1471-1500

Constrained boundary recovery for three dimensional Delaunay triangulations

Author keywords

Guaranteed constrained boundary recovery; Mesh generation and optimization; Steiner point insertion and placement; Three dimensional Delaunay triangulation

Indexed keywords

BOUNDARY CONDITIONS; CONSTRAINT THEORY; GEOMETRY; NUMERICAL METHODS;

EID: 8344280878     PISSN: 00295981     EISSN: None     Source Type: Journal    
DOI: 10.1002/nme.1120     Document Type: Article
Times cited : (47)

References (22)
  • 1
    • 0019563697 scopus 로고
    • Computing the n-dimensional Delaunay tessellation with applications to Voronoi polytopes
    • Watson D. Computing the n-dimensional Delaunay tessellation with applications to Voronoi polytopes. Computer Journal 1981; 24:167-172.
    • (1981) Computer Journal , vol.24 , pp. 167-172
    • Watson, D.1
  • 2
    • 0019563894 scopus 로고
    • Computing Dirichlet tessellations
    • Bowyer A. Computing Dirichlet tessellations. Computer Journal 1981; 24(2):162-166.
    • (1981) Computer Journal , vol.24 , Issue.2 , pp. 162-166
    • Bowyer, A.1
  • 4
    • 0025383370 scopus 로고
    • The integrity of geometrical boundaries in the two-dimensional Delaunay triangulation
    • Weatherill N. The integrity of geometrical boundaries in the two-dimensional Delaunay triangulation. Computer Applications in Numerical Methods 1990; 6:101-109.
    • (1990) Computer Applications in Numerical Methods , vol.6 , pp. 101-109
    • Weatherill, N.1
  • 7
    • 0032000799 scopus 로고    scopus 로고
    • Generation and optimization of tetrahedral meshes by advancing front technique
    • Rassineux A. Generation and optimization of tetrahedral meshes by advancing front technique, International Journal for Numerical Methods in Engineering 1998; 41:651-674.
    • (1998) International Journal for Numerical Methods in Engineering , vol.41 , pp. 651-674
    • Rassineux, A.1
  • 11
    • 8344283071 scopus 로고    scopus 로고
    • How far flipping can go towards 3D conforming/constrained triangulation
    • Liu A, Baida M. How far flipping can go towards 3D conforming /constrained triangulation. 9th International Meshing Roundtable 2000; 295-306.
    • (2000) 9th International Meshing Roundtable , vol.295-306
    • Liu, A.1    Baida, M.2
  • 13
    • 0028447010 scopus 로고
    • Efficient three dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
    • Weatherill N, Hassan O. Efficient three dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints. International Journal for Numerical Methods in Engineering 1994; 37: 2005-2039.
    • (1994) International Journal for Numerical Methods in Engineering , vol.37 , pp. 2005-2039
    • Weatherill, N.1    Hassan, O.2
  • 14
    • 0003942989 scopus 로고    scopus 로고
    • Ph.D. Thesis, Computer Science Department, Carnegie Mellon University
    • Shewchuk J. Delaunay refinement mesh generation. Ph.D. Thesis, Computer Science Department, Carnegie Mellon University 1997.
    • (1997) Delaunay Refinement Mesh Generation
    • Shewchuk, J.1
  • 20
    • 0037423969 scopus 로고    scopus 로고
    • Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellation
    • Du Q, Wang D. Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellation. International Journal for Numerical Methods in Engineering 2003; 56(9):1355-1373.
    • (2003) International Journal for Numerical Methods in Engineering , vol.56 , Issue.9 , pp. 1355-1373
    • Du, Q.1    Wang, D.2
  • 22
    • 8344240719 scopus 로고    scopus 로고
    • Private Communication
    • Hassan O. Private communication, 2003.
    • (2003)
    • Hassan, O.1


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