메뉴 건너뛰기




Volumn 89, Issue 5-6, 2011, Pages 455-466

Three-dimensional constrained boundary recovery with an enhanced Steiner point suppression procedure

Author keywords

Boundary recovery; Delaunay triangulations; Mesh generation; Small polyhedron reconnection; Steiner point suppression

Indexed keywords

BOUNDARY RECOVERY; DELAUNAY; DELAUNAY TRIANGULATIONS; NUMERICAL EXAMPLE; RECOVERY ALGORITHMS; SMALL POLYHEDRON RECONNECTION; STEINER POINTS;

EID: 79551473359     PISSN: 00457949     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compstruc.2010.11.016     Document Type: Article
Times cited : (41)

References (25)
  • 1
    • 0345655516 scopus 로고
    • On the difficulty of triangulating three-dimensional non-convex polyhedra
    • J. Ruppert, and R. Seidel On the difficulty of triangulating three-dimensional non-convex polyhedra Discrete Comput Geom 7 3 1992 227 254
    • (1992) Discrete Comput Geom , vol.7 , Issue.3 , pp. 227-254
    • Ruppert, J.1    Seidel, R.2
  • 2
    • 8344280878 scopus 로고    scopus 로고
    • Constrained boundary recovery for three dimensional Delaunay triangulations
    • Q. Du, and D. Wang Constrained boundary recovery for three dimensional Delaunay triangulations Int J Numer Mech Eng 61 9 2004 1471 1500
    • (2004) Int J Numer Mech Eng , vol.61 , Issue.9 , pp. 1471-1500
    • Du, Q.1    Wang, D.2
  • 3
    • 33748871553 scopus 로고    scopus 로고
    • Optimal tetrahedralization for small polyhedron: A new local transformation strategy for 3-D mesh generation and mesh improvement
    • J. Liu, S. Sun, and D. Wang Optimal tetrahedralization for small polyhedron: a new local transformation strategy for 3-D mesh generation and mesh improvement CMES-Comp Model Eng Sci 14 1 2006 31 43
    • (2006) CMES-Comp Model Eng Sci , vol.14 , Issue.1 , pp. 31-43
    • Liu, J.1    Sun, S.2    Wang, D.3
  • 4
    • 35449001002 scopus 로고    scopus 로고
    • Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes
    • J. Liu, B. Chen, and Y. Chen Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes Int J Numer Mech Eng 72 6 2007 744 756
    • (2007) Int J Numer Mech Eng , vol.72 , Issue.6 , pp. 744-756
    • Liu, J.1    Chen, B.2    Chen, Y.3
  • 5
    • 68549103498 scopus 로고    scopus 로고
    • Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique
    • J. Liu, B. Chen, and S. Sun Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique Int J Numer Mech Eng 79 8 2009 1004 1018
    • (2009) Int J Numer Mech Eng , vol.79 , Issue.8 , pp. 1004-1018
    • Liu, J.1    Chen, B.2    Sun, S.3
  • 6
    • 33845887737 scopus 로고    scopus 로고
    • Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation
    • J. Chen, and Y. Zheng Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation J Zhejiang Univ Sci A 7 12 2006 2031 2042
    • (2006) J Zhejiang Univ Sci A , vol.7 , Issue.12 , pp. 2031-2042
    • Chen, J.1    Zheng, Y.2
  • 7
    • 0028447010 scopus 로고
    • Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints
    • N.P. Weatherill, and O. Hassan Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints Int J Numer Mech Eng 37 12 1994 2005 2039
    • (1994) Int J Numer Mech Eng , vol.37 , Issue.12 , pp. 2005-2039
    • Weatherill, N.P.1    Hassan, O.2
  • 8
    • 0030218408 scopus 로고    scopus 로고
    • Three-dimensional unstructured mesh generation: Part 3. volume meshes
    • R.W. Lewis, Y. Zheng, and D.T. Gethin Three-dimensional unstructured mesh generation: part 3. volume meshes Comput Method Appl Mech Eng 134 3-4 1996 285 310
    • (1996) Comput Method Appl Mech Eng , vol.134 , Issue.34 , pp. 285-310
    • Lewis, R.W.1    Zheng, Y.2    Gethin, D.T.3
  • 10
    • 0142080546 scopus 로고    scopus 로고
    • How far flipping can go towards 3D conforming/constrained triangulation
    • New Orleans, Louisiana, USA
    • Liu A, Baida M. How far flipping can go towards 3D conforming/constrained triangulation. In: Proc 9th International Meshing Roundtable, New Orleans, Louisiana, USA; 2000. p. 307-15.
    • (2000) Proc 9th International Meshing Roundtable , pp. 307-315
    • Liu, A.1    Baida, M.2
  • 11
    • 33749437904 scopus 로고    scopus 로고
    • The boundary recovery and sliver elimination algorithms of three-dimensional constrained Delaunay triangulation
    • Z. Guan, C. Song, and Y. Gu The boundary recovery and sliver elimination algorithms of three-dimensional constrained Delaunay triangulation Int J Numer Mech Eng 68 2 2006 192 209
    • (2006) Int J Numer Mech Eng , vol.68 , Issue.2 , pp. 192-209
    • Guan, Z.1    Song, C.2    Gu, Y.3
  • 12
    • 0142057096 scopus 로고    scopus 로고
    • 'Ultimate' robustness in meshing an arbitrary polyhedron
    • P.L. George, H. Borouchaki, and E. Saltel 'Ultimate' robustness in meshing an arbitrary polyhedron Int J Numer Mech Eng 58 7 2003 1061 1089
    • (2003) Int J Numer Mech Eng , vol.58 , Issue.7 , pp. 1061-1089
    • George, P.L.1    Borouchaki, H.2    Saltel, E.3
  • 13
    • 8344280670 scopus 로고    scopus 로고
    • Boundary recovery for three dimensional conforming Delaunay triangulation
    • Q. Du, and D. Wang Boundary recovery for three dimensional conforming Delaunay triangulation Comput Method Appl Mech Eng 193 23-26 2004 2547 2563
    • (2004) Comput Method Appl Mech Eng , vol.193 , Issue.2326 , pp. 2547-2563
    • Du, Q.1    Wang, D.2
  • 14
    • 0038534791 scopus 로고
    • Constrained Delaunay triangulation
    • L.P. Chew Constrained Delaunay triangulation Algorithmica 4 1 1989 97 108
    • (1989) Algorithmica , vol.4 , Issue.1 , pp. 97-108
    • Chew, L.P.1
  • 15
    • 0000508273 scopus 로고
    • Generalized Delaunay triangulations for planar graphs
    • D.T. Lee, and A.K. Lin Generalized Delaunay triangulations for planar graphs Discrete Comput Geom 1 1 1986 201 217
    • (1986) Discrete Comput Geom , vol.1 , Issue.1 , pp. 201-217
    • Lee, D.T.1    Lin, A.K.2
  • 16
    • 40449098629 scopus 로고    scopus 로고
    • General-dimensional constrained Delaunay and constrained regular triangulations I: Combinatorial properties
    • J.R. Shewchuk General-dimensional constrained Delaunay and constrained regular triangulations I: combinatorial properties Discrete Comput Geom 39 1-3 2008 580 637
    • (2008) Discrete Comput Geom , vol.39 , Issue.13 , pp. 580-637
    • Shewchuk, J.R.1
  • 17
    • 84878932047 scopus 로고    scopus 로고
    • Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations
    • San Diego, CA, USA
    • Si H, Gärtner K. Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In: Proc. 14th International Meshing Roundtable, San Diego, CA, USA; 2005. p. 147-63.
    • (2005) Proc. 14th International Meshing Roundtable , pp. 147-163
    • Si H Gärtner, K.1
  • 18
    • 71549116699 scopus 로고    scopus 로고
    • Constrained Delaunay tetrahedral mesh generation and refinement
    • H. Si Constrained Delaunay tetrahedral mesh generation and refinement Finite Elem Anal Des 46 1-2 2010 33 46
    • (2010) Finite Elem Anal des , vol.46 , Issue.12 , pp. 33-46
    • Si, H.1
  • 19
    • 71549136796 scopus 로고    scopus 로고
    • Boundary recovery for Delaunay tetrahedral meshes using local topological transformations
    • H. Ghadyania, J. Sullivana, and Z. Wu Boundary recovery for Delaunay tetrahedral meshes using local topological transformations Finite Elem Anal Des 46 1-2 2010 74 83
    • (2010) Finite Elem Anal des , vol.46 , Issue.12 , pp. 74-83
    • Ghadyania, H.1    Sullivana, J.2    Wu, Z.3
  • 20
    • 0034270462 scopus 로고    scopus 로고
    • Local optimization-based simplicial mesh untangling and improvement
    • L.A. Freitag, and P.E. Plassmann Local optimization-based simplicial mesh untangling and improvement Int J Numer Mech Eng 49 1-2 2000 109 125
    • (2000) Int J Numer Mech Eng , vol.49 , Issue.12 , pp. 109-125
    • Freitag, L.A.1    Plassmann, P.E.2
  • 21
  • 22
    • 0037423969 scopus 로고    scopus 로고
    • Tetrahedral mesh generation and optimization based on centroidal Vorono tessellation
    • Q. Du, and D. Wang Tetrahedral mesh generation and optimization based on centroidal Vorono tessellation Int J Numer Mech Eng 56 9 2003 1355 1373
    • (2003) Int J Numer Mech Eng , vol.56 , Issue.9 , pp. 1355-1373
    • Du, Q.1    Wang, D.2
  • 23
    • 79551471386 scopus 로고    scopus 로고
    • August 08
    • Ollivier-Gooch C. GRUMMP, August 08, 2010. http://tetra.mech.ubc.ca/ GRUMMP/.
    • (2010)
    • Ollivier-Gooch, C.1
  • 24
    • 0031277193 scopus 로고    scopus 로고
    • Tetrahedral mesh improvement using swapping and smoothing
    • L.A. Freitag, and C. Ollivier-Gooch Tetrahedral mesh improvement using swapping and smoothing Int J Numer Mech Eng 40 21 1997 3979 4002
    • (1997) Int J Numer Mech Eng , vol.40 , Issue.21 , pp. 3979-4002
    • Freitag, L.A.1    Ollivier-Gooch, C.2
  • 25
    • 79551497943 scopus 로고    scopus 로고
    • PhD thesis. Department of Electrical Engineering and Computer Sciences, University of California; November
    • Klingner BM. Improving tetrahedral meshes. PhD thesis. Department of Electrical Engineering and Computer Sciences, University of California; November 2008.
    • (2008) Improving Tetrahedral Meshes
    • Klingner, B.M.1


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