메뉴 건너뛰기




Volumn , Issue , 2010, Pages 314-323

Dynamic well-spaced point sets

Author keywords

Dynamic stability; Dynamization; Mesh generation; Self adjusting computation; Voronoi diagrams; Well spaced point sets

Indexed keywords

DYNAMIC STABILITY; POINT SET; SELF-ADJUSTING; SELF-ADJUSTING COMPUTATION; VORONOI DIAGRAMS;

EID: 77954909040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1810959.1811011     Document Type: Conference Paper
Times cited : (21)

References (27)
  • 3
    • 33644905683 scopus 로고    scopus 로고
    • PhD thesis, Department of Computer Science, Carnegie Mellon University, May
    • Umut A. Acar. Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University, May 2005.
    • (2005) Self-Adjusting Computation
    • Acar, U.A.1
  • 12
    • 70349105765 scopus 로고    scopus 로고
    • Sparse voronoi refinement
    • Long version in Carnegie Mellon University Tech. Report CMU-CS-06-132
    • Benoît Hudson, Gary L. Miller, and Todd Phillips. Sparse Voronoi Refinement. In 15th Intl. Meshing Roundtable, pages 339-356, 2006. Long version in Carnegie Mellon University Tech. Report CMU-CS-06-132.
    • (2006) 15th Intl. Meshing Roundtable , pp. 339-356
    • Hudson, B.1    Miller, G.L.2    Phillips, T.3
  • 13
    • 33244476967 scopus 로고    scopus 로고
    • A time-optimal Delaunay refinement algorithm in two dimensions
    • Sariel Har-Peled and Alper Üngör. A time-optimal Delaunay refinement algorithm in two dimensions. In 21st Symposium on Computational Geometry, pages 228-236, 2005.
    • (2005) 21st Symposium on Computational Geometry , pp. 228-236
    • Har-Peled, S.1    Üngör, A.2
  • 15
    • 57349159009 scopus 로고    scopus 로고
    • Carnegie Mellon University, PhD thesis, School of Computer Science, December, Available as Technical Report CMU-CS-07-162
    • Benoît Hudson. Dynamic Mesh Refinement. PhD thesis, School of Computer Science, Carnegie Mellon University, December 2007. Available as Technical Report CMU-CS-07-162.
    • (2007) Dynamic Mesh Refinement
    • Hudson, B.1
  • 17
    • 0032597982 scopus 로고    scopus 로고
    • Simultaneous refinement and coarsening for adaptive meshing
    • Xiang-Yang Li, Shang-Hua Teng, and Alper Üngör. Simultaneous refinement and coarsening for adaptive meshing. Engineering with Computers, 15(3):280-291, 1999.
    • (1999) Engineering with Computers , vol.15 , Issue.3 , pp. 280-291
    • Li, X.-Y.1    Teng, S.-H.2    Üngör, A.3
  • 19
    • 12844282150 scopus 로고    scopus 로고
    • A virtual node algorithm for changing mesh topology during simulation
    • Neil Molino, Zhaosheng Bao, and Ron Fedkiw. A virtual node algorithm for changing mesh topology during simulation. In SIGGRAPH, 2004.
    • (2004) SIGGRAPH
    • Molino, N.1    Bao, Z.2    Fedkiw, R.3
  • 23
    • 33750726614 scopus 로고
    • A Delaunay refinement algorithm for quality 2-dimensional mesh generation
    • Jim Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548-585, 1995.
    • (1995) J. Algorithms , vol.18 , Issue.3 , pp. 548-585
    • Ruppert, J.1
  • 25
    • 0031518093 scopus 로고    scopus 로고
    • Adaptive precision floating-point arithmetic and fast robust geometric predicates
    • Jonathan Richard Shewchuk. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. Discrete & Computational Geometry, 18(3):305-363, 1997.
    • (1997) Discrete & Computational Geometry , vol.18 , Issue.3 , pp. 305-363
    • Shewchuk, J.R.1
  • 26
    • 33847159309 scopus 로고    scopus 로고
    • Parallel delaunay refinement: Algorithms and analyses
    • Daniel Spielman, Shang-Hua Teng, and Alper Üngör. Parallel Delaunay refinement: Algorithms and analyses. IJCGA, 17:1-30, 2007.
    • (2007) IJCGA , vol.17 , pp. 1-30
    • Spielman, D.1    Teng, S.-H.2    Üngör, A.3
  • 27
    • 0013130831 scopus 로고    scopus 로고
    • PhD thesis, Carnegie Mellon University, August. Available as Technical Report CMU-CS-97-164
    • Dafna Talmor. Well-Spaced Points for Numerical Methods. PhD thesis, Carnegie Mellon University, August 1997. Available as Technical Report CMU-CS-97-164.
    • (1997) Well-Spaced Points for Numerical Methods
    • Talmor, D.1


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