메뉴 건너뛰기




Volumn , Issue , 2006, Pages 563-580

Generalized Delaunay mesh refinement: From scalar to parallel

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY MESHES; DELAUNAY REFINEMENTS; GUARANTEED QUALITY; PLACEMENT ALGORITHM; PLACEMENT STRATEGY; SHARED MEMORY ARCHITECTURE; THEORETICAL FOUNDATIONS; THREE FOLDS;

EID: 35248854084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-34958-7_32     Document Type: Conference Paper
Times cited : (13)

References (26)
  • 2
    • 0019563894 scopus 로고
    • Computing dirichlet tesselations
    • A. Bowyer. Computing Dirichlet tesselations. Computer Journal, 24:162-166, 1981.
    • (1981) Computer Journal , vol.24 , pp. 162-166
    • Bowyer, A.1
  • 4
    • 33847123076 scopus 로고    scopus 로고
    • Parallel guaranteed quality planar delaunay mesh generation by concurrent point insertion
    • MIT, Nov.
    • A. N. Chernikov and N. P. Chrisochoides. Parallel guaranteed quality planar Delaunay mesh generation by concurrent point insertion. In 14th Annual Fall Workshop on Computational Geometry, pages 55-56. MIT, Nov. 2004.
    • (2004) 14th Annual Fall Workshop on Computational Geometry , pp. 55-56
    • Chernikov, A.N.1    Chrisochoides, N.P.2
  • 11
    • 79958290648 scopus 로고    scopus 로고
    • A survey of parallel mesh generation methods
    • Also appears as a chapter in Numerical Solution of Partial Differential Equations on Parallel Computers (eds. Are Magnus Bruaset, Petter Bjorstad, Aslak Tveito), Springer Verlag
    • N. P. Chrisochoides. A survey of parallel mesh generation methods. Technical Report BrownSC-2005-09, Brown University, 2005. Also appears as a chapter in Numerical Solution of Partial Differential Equations on Parallel Computers (eds. Are Magnus Bruaset, Petter Bjorstad, Aslak Tveito), Springer Verlag.
    • (2005) Technical Report BrownSC-2005-09, Brown University
    • Chrisochoides, N.P.1
  • 15
    • 33746054942 scopus 로고    scopus 로고
    • Delaunay decoupling method for parallel guaranteed quality planar mesh refinement
    • L. Linardakis and N. Chrisochoides. Delaunay decoupling method for parallel guaranteed quality planar mesh refinement. SIAM Journal on Scientific Computing, 27(4):1394-1423, 2006.
    • (2006) SIAM Journal on Scientific Computing , vol.27 , Issue.4 , pp. 1394-1423
    • Linardakis, L.1    Chrisochoides, N.2
  • 20
    • 33750726614 scopus 로고
    • A delaunay refinement algorithm for quality 2-dimensional mesh generation
    • J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
    • (1995) Journal of Algorithms , vol.18 , Issue.3 , pp. 548-585
    • Ruppert, J.1
  • 21
    • 84878231734 scopus 로고    scopus 로고
    • Designing effective memory allocators for multicore and multithreaded systems: A case study with irregular and adaptive applications
    • Submitted to
    • S. Schneider, C. D. Antonopoulos, A. N. Chernikov, D. S. Nikolopoulos, and N. P. Chrisochoides. Designing effective memory allocators for multicore and multithreaded systems: A case study with irregular and adaptive applications. Submitted to the Supercomputing Conference, 2006.
    • (2006) The Supercomputing Conference
    • Schneider, S.1    Antonopoulos, C.D.2    Chernikov, A.N.3    Nikolopoulos, D.S.4    Chrisochoides, N.P.5
  • 22
    • 84940605935 scopus 로고    scopus 로고
    • Triangle: Engineering a 2D quality mesh generator and delaunay triangulator
    • M. C. Lin and D. Manocha, editors Springer-Verlag, May From the First ACM Workshop on Applied Computational Geometry
    • J. R. Shewchuk. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In M. C. Lin and D. Manocha, editors, Applied Computational Geometry: Towards Geometric Engineering, volume 1148 of Lecture Notes in Computer Science, pages 203-222. Springer-Verlag, May 1996. From the First ACM Workshop on Applied Computational Geometry.
    • (1996) Applied Computational Geometry: Towards Geometric Engineering, Volume 1148 of Lecture Notes in Computer Science , pp. 203-222
    • Shewchuk, J.R.1
  • 23
    • 31244438495 scopus 로고    scopus 로고
    • Delaunay refinement algorithms for triangular mesh generation
    • May
    • J. R. Shewchuk. Delaunay refinement algorithms for triangular mesh generation. Computational Geometry: Theory and Applications, 22(1-3):21-74, May 2002.
    • (2002) Computational Geometry: Theory and Applications , vol.22 , Issue.1-3 , pp. 21-74
    • Shewchuk, J.R.1
  • 24
    • 35048852526 scopus 로고    scopus 로고
    • Off-centers: A new type of steiner points for computing size-optimal guaranteed-quality delaunay triangulations
    • Apr.
    • A. Üngör. Off-centers: A new type of Steiner points for computing size-optimal guaranteed-quality Delaunay triangulations. In Proceedings of LATIN, pages 152-161, Apr. 2004.
    • (2004) Proceedings of LATIN , pp. 152-161
    • Üngör, A.1
  • 26
    • 0019563697 scopus 로고
    • Computing the n-dimensional delaunay tesselation with application to voronoi polytopes
    • D. F. Watson. Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes. Computer Journal, 24:167-172, 1981.
    • (1981) Computer Journal , vol.24 , pp. 167-172
    • Watson, D.F.1


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