POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS

DOI10.1142/S0218195907002495zbMath1200.65013MaRDI QIDQ3503108

F. Betul Atalay, David M. Mount

Publication date: 20 May 2008

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

zbMATH Keywords

hierarchical simplicial meshespointerless data structuresneighbor finding

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

Incremental construction of generalized Voronoi diagrams on pointerless quadtrees ⋮ Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions ⋮ Stable subdivision of 4D polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local modification of meshes for adaptive and/or multigrid finite-element methods
• Provably good mesh generation
• Symbolic local refinement of tetrahedral grids
• Tetrahedral grid refinement
• Optimal Multilevel Iterative Methods for Adaptive Grids
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• Locally Adapted Tetrahedral Meshes Using Bisection
• An effective way to represent quadtrees
• Quality Local Refinement of Tetrahedral Meshes Based on Bisection
• Quality local refinement of tetrahedral meshes based on 8-subtetrahedron subdivision
• Right-triangulated irregular networks

This page was built for publication: POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS