Abstract
This paper studies the idea of answering range searching queries using simple data structures. The only data structure we need is the Delaunay Triangulation of the input points. The idea is to first locate a vertex of the (arbitrary) query polygon \(\mathcal{Q}\) and walk along the boundary of the polygon in the Delaunay Triangulation and report all the points enclosed by the query polygon. For a set of uniformly distributed random points in 2-D and a query polygon the expected query time of this algorithm is O(n 1/3 + Q + E K + L r n 1/2), where Q is the size of the query polygon \(\mathcal{Q}\), {\bf E}K = O(n\bcdot area\(\mathcal{Q}\) is the expected number of output points, L r is a parameter related to the shape of the query polygon \(\mathcal{Q}\) and n, and L r is always bounded by the sum of the edge lengths of \(\mathcal{Q}\). Theoretically, when L r = O(1/n1/6) the expected query time is O(n1/3 + Q + E K), which improves the best known average query time for general range searching. Besides the theoretical meaning, the good property of this algorithm is that once the Delaunay Triangulation is given, no additional preprocessing is needed. In order to obtain empirical results, we design a new algorithm for generating random simple polygons within a given domain. Our empirical results show that the constant coefficient of the algorithm is small, at least for the special (practical) cases when the query polygon is either a triangle (simplex range searching) or an axis-parallel box (orthogonal range searching) and for the general case when the query polygons are generated by our new polygon-generating algorithms and their sizes are relatively small.
Similar content being viewed by others
References
T. Asano, M. Edahiro, H. Imai, M. Iri, and K. Murota. “Practical use of bucketing techniques in computational geometry,” in G.T. Toussaint, (Ed.), Computational Geometry, 153–195. North-Holland: Amsterdam, Netherlands, 1985.
T. Auer and M. Held. “Heuristics for the generation of random polygons,” Proc. CCCG'96, pp. 38–43, 1996.
A. Andersson and K. Swanson. “On the difficulty of range searching,'' Proc. WADS'95, pp. 473–481, 1995.
P. Bose and L. Devroye. “Intersections with random geometric objects,” Manuscript, School of Computer Science, McGill University, 1995.
M. Bern, D. Eppstein, and F. Yao. “The e-pected e-tremes in a Delaunay triangulation,” Internat. J. Comput. Geom. Appl., Vol. 1:79–91, 1991.
E. Brisson. “Representing geometric structures in d dimensions: Topology and order,” Discrete & Computational Geometry,9(4):387–426, 1993.
B. Chazelle. “A functional approach to data structures and its use in multidimensional searching,” SIAM J. Comput., Vol. 17:427–462, 1988.
B. Chazelle. “Lower bounds on the comple-ity of polytope range searching,” J. Amer. Math. Soc., Vol. 2:637–666, 1989.
B. Chazelle and E. Welzl. “Quasi-optimal range searching in spaces of finite VC-dimension,” Discrete & Computational Geometry, Vol. 4:467–487, 1989.
D.P. Dobkin and M.J. Laszlo. “Primitives for the manipulation of three-dimensional subdivisions,” Algorithmica, Vol. 4(1):3–32, 1989.
L. Devroye, E.P. MuÈ cke, and B. Zhu. “A note on point location in Delaunay triangulations of random points,” Algorithmica, special issue on Average Case Analysis of Algorithms, Vol. 22:477–482, 1998.
R. Dwyer. “Higher dimensional voronoi diagrams in linear e-pected time,” Discrete & Computational Geometry, Vol. 6:343–367, 1991.
H. Edelsbrunner, D.G. Kirkpatrick, and R. Seidel. “On the shape of a set of points in the plane,” IEEE Trans. Inform. Theory, IT-29:3551–559, 1983.
L.J. Guibas and J. Stolfi. “Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,” Transactions on Graphics, Vol. 4(2):74–123, 1985.
D. Haussler and E. Welzl. “Epsilon-nets and simple-range queries,” Discrete & Computational Geometry, Vol. 2:127–151, 1987.
J. Matousěk. “Construction of-nets,” Discrete & Computational Geometry, Vol. 5:427–448, 1990.
J. Matousěk. “Range searching with efficient hierarchical cuttings,” Discrete & Computational Geometry, Vol. 10:157–182, 1993.
J. Matousěk. “Geometric range searching,” ACM. Comput. Survey, Vol. 26:421–462, 1994.
D. Haussler and E. Welzl. “Epsilon-nets and simple-range queries,” Discrete & Computational Geometry, Vol. 2:127–151, 1987.
E.P. Mücke, I. Saias, and B. Zhu. “Fast randomized point location without preprocessing in two and threedimensional D triangulations,” Comput. Geom. Theory and Appl., special issue for SoCG'96, Vol. 12:63–83, 1999.
J. O'Rourke. Computational Geometry in C. Cambridge University Press: Cambridge, U.K., 1994.
J. O'Rourke and M. Virmani. “Generating random polygons,'' Tech. Report 011, of Computer Science, Smith College, 1991.
F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag: Northampton, MA, 1985.
R. Sedgewick. Algorithms (2nd edition.) Addison-Wesley: Reading, MA, 1988.
D. Willard. “Polygon retrieval,” SIAM. J. Comput., Vol. 11:149–165, 1982.
E. Welzl. “Partition trees for triangle counting and other range searching problems,” Proc. 4th ACM Symp. on Computational Geometry, 23–33, 1990.
C. Zhu, G. Sundaram, J. Snoeyink, and J. Mitchell. “Generating random polygons with given vertices,” Comput. Geom. Theory and Appl., Vol. 6:277–290, 1996.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhu, B. Fast Range Searching with Delaunay Triangulations. GeoInformatica 4, 317–334 (2000). https://doi.org/10.1023/A:1009857410665
Issue Date:
DOI: https://doi.org/10.1023/A:1009857410665