PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS

DOI10.1142/S0218195999000303zbMath1074.68630OpenAlexW2121431945WikidataQ61661660 ScholiaQ61661660MaRDI QIDQ4682197

David Eppstein, Shang-Hua Teng, Marshall W. Bern

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195999000303

zbMATH Keywords

mesh generationparallel algorithmsPRAM modelnonobtuse triangulationQuadtreefair split tree

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel numerical computation (65Y05) Algorithms for approximation of functions (65D15)

Related Items (22)

Simulating two-phase flows with thermodynamically consistent energy stable Cahn-Hilliard Navier-Stokes equations on parallel adaptive octree based meshes ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Scalable Local Timestepping on Octree Grids ⋮ An unstructured adaptive mesh refinement approach for computational fluid dynamics of reacting flows ⋮ An adaptive well-balanced positivity preserving central-upwind scheme on quadtree grids for shallow water equations ⋮ A fully-coupled framework for solving Cahn-Hilliard Navier-Stokes equations: second-order, energy-stable numerical methods on adaptive octree based meshes ⋮ Algorithmic patterns for \(\mathcal {H}\)-matrices on many-core processors ⋮ A finite element level set method based on adaptive octree meshes for thermal free‐surface flows ⋮ A projection-based, semi-implicit time-stepping approach for the Cahn-Hilliard Navier-Stokes equations on adaptive octree meshes ⋮ Efficient transformations for Klee's measure problem in the streaming model ⋮ Near-linear-time deterministic plane Steiner spanners for well-spaced point sets ⋮ Preprocessing imprecise points for Delaunay triangulation: simplified and extended ⋮ A dual interpolation boundary face method for 3D elasticity ⋮ Massively Parallel Simulations of Binary Black Hole Intermediate-Mass-Ratio Inspirals ⋮ REVERSE NEAREST NEIGHBOR QUERIES IN FIXED DIMENSION ⋮ Fast Construction of Compressed Web Graphs ⋮ Reporting flock patterns ⋮ 2D and 3D finite element meshing and remeshing ⋮ An octree-based immersogeometric approach for modeling inertial migration of particles in channels ⋮ FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002) ⋮ Dynamic smooth compressed quadtrees ⋮ PARALLEL DELAUNAY REFINEMENT: ALGORITHMS AND ANALYSES

Cites Work

• Nonobtuse triangulation of polygons
• Parallel unstructured grid generation
• Surpassing the information theoretic bound with fusion trees
• Approximating the minimum weight Steiner triangulation
• Provably good mesh generation
• Parallel Merge Sort
• The Parallel Evaluation of General Arithmetic Expressions

This page was built for publication: PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS