@conference {13332,
	title = {Spatial indexing on tetrahedral meshes},
	booktitle = {Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems},
	series = {GIS {\textquoteright}10},
	year = {2010},
	month = {2010///},
	pages = {506 - 509},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We address the problem of performing spatial queries on tetrahedral meshes. These latter arise in several application domains including 3D GIS, scientific visualization, finite element analysis. We have defined and implemented a family of spatial indexes, that we call tetrahedral trees. Tetrahedral trees subdivide a cubic domain containing the mesh in an octree or 3D kd-tree fashion, with three different subdivision criteria. Here, we present and compare such indexes, their memory usage, and spatial queries on them.},
	keywords = {kd-trees, octrees, spatial indexes, tetrahedral meshes},
	isbn = {978-1-4503-0428-3},
	doi = {10.1145/1869790.1869873},
	url = {http://doi.acm.org/10.1145/1869790.1869873},
	author = {De Floriani, Leila and Fellegara,Riccardo and Magillo,Paola}
}
