메뉴 건너뛰기




Volumn 28, Issue 2-3 SPEC. ISS., 2004, Pages 191-215

Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains

Author keywords

Delaunay triangulation; Distributed mesh data structures; Guaranteed quality mesh generation; Parallel mesh generation

Indexed keywords


EID: 2442691414     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2004.03.009     Document Type: Conference Paper
Times cited : (49)

References (39)
  • 8
    • 0033130832 scopus 로고    scopus 로고
    • Parallel volume meshing using face removals and hierarchical repartitioning
    • H. de Cougny, and M. Shephard Parallel volume meshing using face removals and hierarchical repartitioning Comput. Meth. Appl. Mech. Engrg. 174 3-4 1999 275 298
    • (1999) Comput. Meth. Appl. Mech. Engrg. , vol.174 , Issue.34 , pp. 275-298
    • De Cougny, H.1    Shephard, M.2
  • 9
    • 0003658372 scopus 로고    scopus 로고
    • Tech. Rep. NASA/CR-1999-208999 and ICASE Report No. 99-9, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA
    • D. Mavriplis, S. Pirzadeh, Large-scale parallel unstructured mesh computations for 3d high-lift analysis, Tech. Rep. NASA/CR-1999-208999 and ICASE Report No. 99-9, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, 1999
    • (1999) Large-scale Parallel Unstructured Mesh Computations for 3d High-lift Analysis
    • Mavriplis, D.1    Pirzadeh, S.2
  • 14
    • 0019563894 scopus 로고
    • Computing Dirichlet tessellations
    • A. Bowyer Computing Dirichlet tessellations Comput. J. 24 2 1981 162 166
    • (1981) Comput. J. , vol.24 , Issue.2 , pp. 162-166
    • Bowyer, A.1
  • 15
    • 0019563697 scopus 로고
    • Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
    • D.F. Watson Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes Comput. J. 24 2 1981 167 172 (Pubitemid 12503887)
    • (1981) Computer Journal , vol.24 , Issue.2 , pp. 167-172
    • Watson, D.F.1
  • 17
    • 0025849214 scopus 로고
    • An alternating digital tree (ADT) algorithm for 3d geometric searching and intersection problems
    • J. Bonet, and J. Peraire An alternating digital tree (ADT) algorithm for 3d geometric searching and intersection problems Internat. J. Numer. Meth. Engrg. 31 1991 1 17
    • (1991) Internat. J. Numer. Meth. Engrg. , vol.31 , pp. 1-17
    • Bonet, J.1    Peraire, J.2
  • 19
    • 0031622924 scopus 로고    scopus 로고
    • A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations
    • ACM
    • J.R. Shewchuk A condition guaranteeing the existence of higher-dimensional constrained Delaunay triangulations Fourteenth Annual Symposium on Computational Geometry 1998 ACM 76 85
    • (1998) Fourteenth Annual Symposium on Computational Geometry , pp. 76-85
    • Shewchuk, J.R.1
  • 23
    • 0037815396 scopus 로고    scopus 로고
    • The scalability of mesh improvement algorithms
    • M.T. Heath, A. Ranade, R.S. Schreibner, IMA Volumes in Mathematics and Its Applications Springer-Verlag Berlin
    • L.A. Freitag, M.T. Jones, and P.E. Plassmann The scalability of mesh improvement algorithms M.T. Heath, A. Ranade, R.S. Schreibner, Algorithms for Parallel Processing IMA Volumes in Mathematics and Its Applications vol. 105 1998 Springer-Verlag Berlin 185 212
    • (1998) Algorithms for Parallel Processing , vol.105 , pp. 185-212
    • Freitag, L.A.1    Jones, M.T.2    Plassmann, P.E.3
  • 24
    • 0000061516 scopus 로고
    • Software for C1 surface interpolation
    • J.R. Rice, Academic Press New York
    • C. Lawson Software for C1 surface interpolation J.R. Rice, Mathematical Software III 1977 Academic Press New York 161 194
    • (1977) Mathematical Software III , pp. 161-194
    • Lawson, C.1
  • 25
    • 0026151963 scopus 로고
    • Construction of three-dimensional Delaunay triangulations using local transformations
    • B. Joe Construction of three-dimensional Delaunay triangulations using local transformations Computer Aided Geometric Design 10 1989 123 142
    • (1989) Computer Aided Geometric Design , vol.10 , pp. 123-142
    • Joe, B.1
  • 26
    • 0029723001 scopus 로고    scopus 로고
    • Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations
    • E.P. Mücke, I. Saias, and B. Zhu Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations Twelfth Annual Symposium on Computational Geometry 1996 274 283
    • (1996) Twelfth Annual Symposium on Computational Geometry , pp. 274-283
    • Mücke, E.P.1    Saias, I.2    Zhu, B.3
  • 28
    • 17544375745 scopus 로고    scopus 로고
    • Spacing control and sliver-free Delaunay mesh
    • Sandia National Labs
    • X.-Y. Li Spacing control and sliver-free Delaunay mesh Ninth International Meshing Roundtable 2000 Sandia National Labs 295 306
    • (2000) Ninth International Meshing Roundtable , pp. 295-306
    • Li, X.-Y.1
  • 31
    • 0343279188 scopus 로고    scopus 로고
    • Mobile object layer: A runtime substrate for parallel adaptive and irregular computations
    • N. Chrisochoides, K. Barker, D. Nave, and C. Hawblitzel Mobile object layer: A runtime substrate for parallel adaptive and irregular computations Adv. Engrg. Software 31 8-9 2000 621 637
    • (2000) Adv. Engrg. Software , vol.31 , Issue.89 , pp. 621-637
    • Chrisochoides, N.1    Barker, K.2    Nave, D.3    Hawblitzel, C.4
  • 33
    • 0022807929 scopus 로고
    • A simple parallel algorithm for the maximal independent set
    • M. Luby A simple parallel algorithm for the maximal independent set SIAM J. Comput. 15 1986 1036 1053 (Pubitemid 17465853)
    • (1986) SIAM Journal on Computing , vol.15 , Issue.4 , pp. 1036-1053
    • Luby Michael1
  • 34
    • 0003942989 scopus 로고    scopus 로고
    • PhD Thesis, Carnegie Mellon University, School of Computer Science, available as Technical Report CMU-CS-97-137, May
    • J.R. Shewchuk, Delaunay refinement mesh generation, PhD Thesis, Carnegie Mellon University, School of Computer Science, available as Technical Report CMU-CS-97-137, May 1997
    • (1997) Delaunay Refinement Mesh Generation
    • Shewchuk, J.R.1


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