Abstract
In this paper, we give the definition for the voronoi diagram and its dual graph — Delaunay triangulation for 3D cuboids. We prove properties of the 3D Delaunay triangulation, and provide algorithms to construct and update the Delaunay triangulation. The Delaunay triangulation data structure is used to perform proximity searches for both static and kinetic cases. We describe experimental results that show how the Delaunay triangulation is used on a mobile robot to model, understand and reason about the spatial information of the environment.
This work was done when the author was working at Honda Research Institute USA, Inc.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Agarwal, M. de Berg, J. Gudmundsson, M. Hammar, and H. Haverkort. Box-trees and R-trees with near-optimal query time. In Proceedings of the 17th ACM Symposium on Computational Geometry (SoCG 01’), pages 124–133, June 2001.
F. Aurenhammer. Voronoi diagrams: A survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345–405, Sept. 1991.
J. Basch, L. J. Guibas, and J. Hershberger. Data structures for mobile data. J. Alg., 31(1): 1–28, 1999.
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
D. W. J. E. G. Gilbert and S. S. Keerthi. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Trans. Robotics and Automation, 4(2):193–203, April 1988.
G. Edwards and B. Moulin. Toward the simulation of spatial mental images using the voronoi model. Representation and Processing of Spatial Expressions, pages 163–184, 1997.
J. Erickson. Dense point sets have sparse delaunay triangulations. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 125–134, 2002.
M. Gavrilova. Proximity and Applications in General Metrics. PhD thesis, Dept. of Computer Science, The University of Calgary, 1998.
L. J. Guibas. Kinetic data structures — a state of the art report. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Proc. Workshop Algorithmic Found. Robot., pages 191–209. A. K. Peters, Wellesley, MA, 1998.
L. J. Guibas, J. Snoeyink, and L. Zhang. Compact voronoi diagrams for moving convex polygons. In 7th Scandinavian Worshop on Algorithm Theory, 2000.
C. Lawrence, J. L. Zhou, and A. L. Tits. User’s guide for cfsqp version 2.5: A c code for solving (large scale) constrained nonlinear (minimax) optimization problems, generating iterates satisfying all inequality constraints. Technical Report Institute for Systems Research TR-94-16R1, University of Maryland, College Park, 1997.
M. McAllister, D. G. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear voronoi diagram for convex sites in the plane. In IEEE Symposium on Foundations of Computer Science, pages 573–582, 1993.
O. Procopiuc. Data structures for spatial database systems.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, J., Gupta, R. (2003). Efficient Proximity Search for 3-D Cuboids. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44842-X_83
Download citation
DOI: https://doi.org/10.1007/3-540-44842-X_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40156-8
Online ISBN: 978-3-540-44842-6
eBook Packages: Springer Book Archive