Abstract
A data structure for representing convex simplicial complexes in d-dimensional space is presented with which a k-face of the complex containing a query point can be located in time O(logd nd). This is an improvement over a sequential search approach requiring O(nd 3) time. We show one such structure that needs O(dn d) storage. We then propose a compressed structure which is conjectured to need only O(nd2d) storage.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho and J. E. Hopcroft and J. D. Ullman Data Structures and Algorithms, Addison-Wesley, 1983.
F. Bernardini, “Integration of Polynomials over n-dimensional Polyhedra” Computer Aided Design, Special Issue Beyond Solid Modeling, 23(1):51–58, February 1991.
D. P. Dobkin and H. Edelsbrunner, “Space Searching for Intersecting Objects.” Journal of Algorithms, 8:348–361, 1987.
V. Ferrucci, “Simple n X : User Manual and Implementation Notes, Part1,” Università di Roma “La Sapienza”, Dip. di Informatica e Sistemistica, Tech. Rep. 06–90, Rome, May 1990.
V. Ferrucci and A. Paoluzzi, “Extrusion and Boundary Evaluation for Multidimensional Polyhedra”, Computer Aided Design, Special Issue Beyond Solid Modeling, 23(1):40–50, February 1991.
H. Fuchs and Z. M. Kedem and B. F. Naylor, “On Visible Surface Generation by a Priori Tree Structures.” Conf. Proc. of SIGGRAPH '80, 14(3):124–133, July 1980.
D. T. Lee and F. P. Preparata, “Location of a point in a planar subdivision and its applications,” SIAM Journal on Computing, 6(3):594–606, Sept, 1977.
A. Paoluzzi and C. Cattani, “Simplicial-Based Representation and Algorithms for Multidimensional Polyhedra”, manuscript, 1990, revised and extended version of the paper: C. Cattani and A. Paoluzzi, “Solid Modeling in Any Dimension”. Dip. di Informatica e Sistemistica, Università “La Sapienza”, Techn. rep. 02–89, Rome, Jan 1989.
L. K. Putnam and P. A. Subrahmanyam, “Boolean Operations on n-Dimensional Objects.” IEEE Comp. Graph. and Appl., 6(6):43–51, 1986.
F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction. Springer-Verlag, 1985.
J. R. Rossignac and M. A. O'Connor, “SGC: A dimension-independent model for point sets with internal structures and incomplete boundaries.” Geometric Modeling for Product Engeneering, Proceedings of the 1988 IFIP/INSF Workshop on Geometric Modeling, Rensselaerville, NY, Sept. 18–22, 1988. M. Wozny, J. Turner and K. Press, eds., North Holland, 1989, pp. 145–180.
G. Vaněček, Jr, “Towards Automatic Grid Generation using Binary Space Partition Trees,” Purdue University, Department of Computer Science, CAPO Report CER-90-6, West Lafayette, IN, Jan 1990.
G. Vaněček, Jr, “A Data Structure for Analyzing Collisions of Moving Objects,” Hawaii International Conference on System Science, HICSS-24, Kuai Hawaii, January 1991.
G. Vaněček, Jr, “Brep-Index: A Multidimensional Space Partitioning Tree,” Proceedings of the ACM Syposium on Solid Modeling Foundations and CAD/CAM Applications, Austin TX, June 1991, pp. 35–44.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrucci, V., Vaněček, G. (1991). A spatial index for convex simplicial complexes in d dimensions. In: Günther, O., Schek, HJ. (eds) Advances in Spatial Databases. SSD 1991. Lecture Notes in Computer Science, vol 525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54414-3_47
Download citation
DOI: https://doi.org/10.1007/3-540-54414-3_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54414-2
Online ISBN: 978-3-540-47615-3
eBook Packages: Springer Book Archive