메뉴 건너뛰기




Volumn , Issue , 2005, Pages 165-181

Delaunay refinement by corner lopping

Author keywords

Curved boundary; Delaunay; Mesh; Planar; Simplicial; Unstructured

Indexed keywords

CURVED BOUNDARY; DELAUNAY; MESH; PLANAR; SIMPLICIAL; UNSTRUCTURED;

EID: 67349090532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-29090-7_10     Document Type: Conference Paper
Times cited : (18)

References (15)
  • 1
    • 33750726614 scopus 로고
    • A delaunay refinement algorithm for quality 2-dimensional mesh generation
    • Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993)
    • Ruppert J. "A Delaunay refinement algorithm for quality 2-dimensional mesh generation." J. Algorithms, vol. 18, no. 3, 548-585, 1995. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993)
    • (1995) J. Algorithms , vol.18 , Issue.3 , pp. 548-585
    • Ruppert, J.1
  • 2
    • 17444431924 scopus 로고    scopus 로고
    • Ph.D. thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania, May URL
    • Pav S.E. Delaunay Refinement Algorithms. Ph.D. thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 2003. URL http://www.math.cmu.edu/\~-{}nw0z/publications/phdtheses/pav/p%avabs
    • (2003) Delaunay Refinement Algorithms
    • Pav, S.E.1
  • 3
    • 0003942989 scopus 로고    scopus 로고
    • Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May Available as Technical Report CMU-CS-97-137
    • Shewchuk J.R. Delaunay Refinement Mesh Generation. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 1997. Available as Technical Report CMU-CS-97-137
    • (1997) Delaunay Refinement Mesh Generation
    • Shewchuk, J.R.1
  • 4
    • 17444391698 scopus 로고    scopus 로고
    • When and why delaunay refinement algorithms work
    • Special Issue: Selected Papers from the 12th International Meshing Roundtable
    • Miller G.L., Pav S.E., Walkington N.J. "When and Why Delaunay Refinement Algorithms Work." Internat. J. Comput. Geom. Appl., vol. 15, no. 1, 25-54, 2005. Special Issue: Selected Papers from the 12th International Meshing Roundtable, 2003
    • (2003) Internat. J. Comput. Geom. Appl. , vol.15 , Issue.1 , pp. 25-54
    • Miller, G.L.1    Pav, S.E.2    Walkington, N.J.3
  • 5
    • 0037058692 scopus 로고    scopus 로고
    • Guaranteed-quality triangular mesh generation for domains with curved boundaries
    • Boivin C, Ollivier-Gooch C.F. "Guaranteed-Quality Triangular Mesh Generation For Domains with Curved Boundaries." Internat. J. Numer. Methods Eng., vol. 55, no. 10, 1185-1213, 2002
    • (2002) Internat. J. Numer. Methods Eng. , vol.55 , Issue.10 , pp. 1185-1213
    • Boivin, C.1    Ollivier-Gooch, C.F.2
  • 11
    • 0016939764 scopus 로고
    • On the angle condition in the finite element method
    • Babuška I., Aziz A.K. "On the angle condition in the finite element method." SIAM J. Numer. Anal., vol. 13, no. 2, 214-226, 1976
    • (1976) SIAM J. Numer. Anal. , vol.13 , Issue.2 , pp. 214-226
    • Babuška, I.1    Aziz, A.K.2
  • 14
    • 70349102371 scopus 로고    scopus 로고
    • CGAL - The computational geometry algorithm library
    • Sandia National Laboratory October
    • Fabri A. "CGAL - The Computational Geometry Algorithm Library." Proceedings of the 10th International Meshing Roundtable, pp. 137-142. Sandia National Laboratory, October 2001
    • (2001) Proceedings of the 10th International Meshing Roundtable , pp. 137-142
    • Fabri, A.1


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