@conference {13281,
	title = {Constant-time navigation in four-dimensional nested simplicial meshes},
	booktitle = {Shape Modeling Applications, 2004. Proceedings},
	year = {2004},
	month = {2004/06//},
	pages = {221 - 230},
	abstract = {We consider a recursive decomposition of a four-dimensional hypercube into a hierarchy of nested 4-dimensional simplexes, that we call pentatopes. The paper presents an algorithm for finding the neighbors of a pentatope along its five tetrahedral faces in constant time. To this aim, we develop a labeling technique for nested pentatopes that enables their identification by using location codes. The constant-time behavior is achieved through bit manipulation operations, thus avoiding traversing the simplicial hierarchy via pointer following. We discuss an application of this representation to multi-resolution representations of four-dimensional scalar fields. Extracting adaptive continuous approximations of the scalar field from such a model requires generating conforming meshes, i.e., meshes in which the pentatopes match along their tetrahedral faces. Our neighbor finding algorithm enables computing face-adjacent pentatopes efficiently.},
	keywords = {4-dimensional, adaptive, algorithm;, approximations;, bit, codes;, computational, constant-time, continuous, decomposition;, face-adjacent, faces;, fields;, finding, following;, four-dimensional, generation;, geometry;, hierarchy;, hypercube;, location, manipulation, mesh, meshes;, multiresolution, navigation;, neighbor, nested, operations;, pentatopes;, pointer, recursive, representation;, scalar, simplexes;, simplicial, tetrahedral},
	doi = {10.1109/SMI.2004.1314509},
	author = {Lee,M. and De Floriani, Leila and Samet, Hanan}
}
