Orthogonal queries in segments
Abstract
We consider theorthgonal clipping problem in a set of segments: Given a set ofn segments ind-dimensional space, we preprocess them into a data structure such that given an orthogonal query window, the segments intersecting it can be counted/reported efficiently.
We show that the efficiency of the data structure significantly depends on a geometric discrete parameterK named theProjected-image complexity, which becomes ź(n2) in the worst case but practically much smaller. If we useO(m) space, whereK log4dź7nźmźn log4dź7n, the query time isO((K/m)1/2 logmax{4, 4dź5}n). This is near to an Ω((K/m)1/2) lower bound.
References
[1]
P. Agarwal, Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number, Proc. 5th ACM Comput. Geom., 1989, pp. 315-325.
[2]
M. Atallah, Some Dynamic Computational Geometry Problems, Comput. Math. Appl. 11 (1985), 1171-1181.
[3]
B. Chazelle, Reporting and Counting Segment Intersections, J. Comput. System Sci. 32 (1986), 156-182.
[4]
B. Chazelle, Filtering Search: A New Approach to Query-Answering, SIAM J. Comput. 15 (1986), 703-724.
[5]
B. Chazelle, A Functional Approach to Data Structures and Its Use in Multidimensional Searching, SIAM J. Comput. 17 (1988), 427-462.
[6]
B. Chazelle, Lower Bounds on the Complexity of Polytope Range Searching, J. Amer. Math. Sci. 2 (1989), 637-666.
[7]
B. Chazelle, Lower Bounds for Orthogonal Range Searching. I. The Reporting Case, J. Assoc. Comput. Mach. 37 0990), 200-212.
[8]
B. Chazelle, M. Sharir, and E. Welzl, Quasi-Optimal Upper Bound for Simplex Range Searching and New Zone Theorems, Algorithmica 8 (1992), 407-429.
[9]
S. Cheng and R. Janardan, Space-Efficient Ray-Shooting and Intersection Searching, J. Algorithms 13 (1992), 670-692.
[10]
D. Dobkin and H. Edelsbrunner, Space Searching for Intersecting Objects, J. Algorithms 8 (1987), 348-361.
[11]
J. Driscoll, N. Sarnak, D. Slator, and R. Tarjan, Making Data Structure Persistent, J. Comput. System Sci. 38 (1989), 86-124.
[12]
M. Edahiro, K. Tanaka, T. Hoshino, and T. Asano, A Bucketing Algorithm for the Orthogonal Segment Intersection Search Problems and Its Practical Efficiency, Algorithmica 4 (1987), 61-76.
[13]
D. Knuth, Sorting and Searching: The Art of Computer Programming III, Addison-Wesley, Reading, MA, 1973.
[14]
K. Kuse, Private communication.
[15]
G. Lueker, A Data Structure for Orthogonal Range Queries, Proc. 19th IEEE FOCS, 1978, pp. 28-34.
[16]
J. Matou¿ek, Efficient Partition Trees, Discrete Comput. Geom. 8 (1992), 315-334.
[17]
J. Matou¿ek, Range Searching with Efficient Hierarchical Cuttings, Discrete Comput. Geom. 10 (1993), 157-182.
[18]
N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
[19]
M.H. Overmars, The Design of Dynamic Data Structures, LNCS 156, Springer-Verlag, Berlin, 1983.
[20]
F. Preparata and M. Shamos, Computational Geometry, an Introduction, 2nd edition, Springer-Verlag, New York, 1988.
[21]
T. Tokuyama, Orthogonal Range Queries in Segments and Triangles, Proc. 4th ISSAC, LNCS 834, Springer-Verlag, Berlin, 1994, pp. 505-513.
[22]
D.E. Willard, New Data Structures for Orthogonal Range Queries, SIAM J. Comput. 14 (1985), 232-253.
[23]
A.C. Yao, Space-Time Tradeoff for Answering Range Queries, Proc. 14th ACM STOC, 1982, pp. 128-136.
- Orthogonal queries in segments
Recommendations
Stabbing segments with rectilinear objects
Given a set S of n line segments in the plane, we say that a region RR2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different ...
On finding a widest empty 1-corner corridor
A 1-corner corridor through a set S of points is an open subset of CH(S) containing no points from S and bounded by a pair of parallel polygonal lines each of which contains two segments. Given a set of n points in the plane, we consider the problem of ...
Stabbing line segments
AbstractAn algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane is presented. As a matter of fact, the algorithm computes a description of all stabbing lines. A ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 1997 Springer-Verlag.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 June 1997
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in