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
LPTcode, that uniquely encodes each simplex of the hierarchy. 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.
UMIACS-TR-2004-29