@conference {13335,
	title = {The half-edge tree: a compact data structure for level-of-detail tetrahedral meshes},
	booktitle = {Shape Modeling and Applications, 2005 International Conference},
	year = {2005},
	month = {2005/06//},
	pages = {332 - 337},
	abstract = {We propose a new data structure for the compact encoding of a level-of detail (LOD) model of a three-dimensional scalar field based on unstructured tetrahedral meshes. Such data structure, called a half-edge tree (HET), is built through the iterative application of a half-edge collapse, i.e. by contracting an edge to one of its endpoints. We also show that selective refined meshes extracted from an HET contain on average about 34\% and up to 75\% less tetrahedra than those extracted from an LOD model built through a general edge collapse.},
	keywords = {application;, compact, computational, data, detection;, edge, encoding;, generation;, geometry;, half-edge, iterative, level-of-detail, mesh, meshes;, methods;, model;, structure;, structures;, tetrahedral, tree, tree;},
	doi = {10.1109/SMI.2005.47},
	author = {Danovaro,E. and De Floriani, Leila and Magillo,P. and Puppo,E. and Sobrero,D. and Sokolovsky,N.}
}
@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}
}
@conference {13678,
	title = {The processing of form documents},
	booktitle = {Document Analysis and Recognition, 1993., Proceedings of the Second International Conference on},
	year = {1993},
	month = {1993/10//},
	pages = {497 - 501},
	abstract = {An overview of an approach to the generic modeling and processing of known forms is presented. The system provides a methodology by which models are generated from regions in the document based on their usage. Automatic extraction of an optimal set of features to be used for registration is proposed, and it is shown how specialized detectors can be designed for each feature based on their position, orientation and width properties. Registration of the form with the model is accomplished using probing to establish correspondence. Form components which are corrupted by markings are detected and isolated, the intersections are interpreted and the properties of the non-form markings are used to reconstruct the strokes through the intersections. The feasibility of these ideas is demonstrated through an implementation of key components of the system},
	keywords = {AUTOMATIC, business, detectors;, document, documents;, extraction;, feature, form, forms;, generation;, generic, handling;, known, markings;, model, modeling;, non-form, optimal, properties;, reconstruction;, set;, specialized, stroke, width},
	doi = {10.1109/ICDAR.1993.395687},
	author = {David Doermann and Rosenfeld, A.}
}
