POINTERLESS IMPLEMENTATION OF HIERARCHICAL SIMPLICIAL MESHES AND EFFICIENT NEIGHBOR FINDING IN ARBITRARY DIMENSIONS-Reference-Cited by-同舟云学术

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

Published:2007-12 Issue:06 Volume:17 Page:595-631
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

ATALAY F. BETUL¹,MOUNT DAVID M.²

Affiliation:

1. Mathematics and Computer Science Department, Saint Joseph's University, Philadelphia, PA 19131, USA

2. Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742, USA

Abstract

We describe a pointerless representation of hierarchical regular simplicial meshes, based on a bisection approach proposed by Maubach. We introduce a new labeling scheme, called an LPT code, which uniquely encodes the geometry of each simplex of the hierarchy, and we present rules to compute the neighbors of a given simplex efficiently through the use of these codes. In addition, we show how to traverse the associated tree and how to answer point location and interpolation queries. Our system works in arbitrary dimensions.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195907002495

Reference27 articles.

1. Optimal Multilevel Iterative Methods for Adaptive Grids

2. Locally Adapted Tetrahedral Meshes Using Bisection

3. Tetrahedral grid refinement

4. Quality Local Refinement of Tetrahedral Meshes Based on Bisection

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Concurrent Binary Trees for Large-Scale Game Components;Proceedings of the ACM on Computer Graphics and Interactive Techniques;2024-08-09

2. Concurrent Binary Trees (with application to longest edge bisection);Proceedings of the ACM on Computer Graphics and Interactive Techniques;2020-08-26

3. Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions;Computational Geometry;2019-02

4. Stable subdivision of 4D polytopes;Numerical Algorithms;2017-12-19

5. Incremental Construction of Generalized Voronoi Diagrams on Pointerless Quadtrees;Mathematical Problems in Engineering;2014