Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Chazelle (1993)
Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 9
S. Arya, G. Fonseca, D. Mount (2016)
Optimal Approximate Polytope Membership
(1992)
Schwarzkopf , On ray shooting in convex polytopes , Discrete Comput
(1992)
Welzl , Quasioptimal range searching in spaces of finite VCdimension , Discrete Comput
M. Berg (1997)
Computational geometry: algorithms and applications
S. Arya, D. Mount (1993)
Approximate nearest neighbor queries in fixed dimensions
(1986)
Halfplanar range search in linear space and O(n0.695) query time, Inform
V. Gaede, O. Günther (1998)
Multidimensional access methodsACM Comput. Surv., 30
E. Ramos (2000)
Linear programming queries revisited
D. Dobkin, D. Kirkpatrick (1985)
A Linear Algorithm for Determining the Separation of Convex PolyhedraJ. Algorithms, 6
S. Arya, Theocharis Malamatos, D. Mount (2009)
Space-time tradeoffs for approximate nearest neighbor searchingJ. ACM, 57
Haim Kaplan, Natan Rubin, M. Sharir (2009)
Linear Data Structures for Fast Ray-Shooting amidst Convex PolyhedraAlgorithmica, 55
H. Scholten, M. Overmars (1989)
General Methods for Adding Range Restrictions to Decomposable Searching ProblemsJ. Symb. Comput., 7
O. Cheong (1992)
Ray shooting in convex polytopes
B. Chazelle, L. Guibas (1989)
Visibility and intersection problems in plane geometryDiscrete & Computational Geometry, 4
P. Agarwal, J. Matoušek (1992)
On range searching with semialgebraic setsDiscrete & Computational Geometry, 11
J. Matoušek (1992)
Reporting Points in Halfspaces
J. Matoušek, Zuzana Patáková (2014)
Multilevel Polynomial Partitions and Simplified Range SearchingDiscrete & Computational Geometry, 54
(1993)
Patáková , Multilevel polynomial partitions and simplified range searching , Discrete Comput
J. Nievergelt, P. Widmayer (1996)
Spatial Data Structures: Concepts and Design Choices
M. Pocchiola, G. Vegter (1996)
Pseudo-triangulations: theory and applications
P. Agarwal, M. Kreveld, M. Overmars (1993)
Intersection Queries in Curved ObjectsJ. Algorithms, 15
Jeff Erickson (2000)
Space-Time Tradeoffs for Emptiness QueriesSIAM J. Comput., 29
Siu-Wing Cheng, Ravi Janardan (1992)
Algorithms for Ray-Shooting and Intersection SearchingJ. Algorithms, 13
B. Chazelle, E. Welzl (1989)
Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 4
G. Vegter (1997)
In handbook of discrete and computational geometry
(2011)
Relative (p, )-approximations in geometry, Discr
J. Hershberger, S. Suri (1995)
A pedestrian approach to ray shooting: shoot a ray, take a walkJ. Algorithms, 18
Sariel Har-Peled, M. Sharir (2011)
Relative (p,ε)-Approximations in GeometryDiscrete & Computational Geometry, 45
(1982)
Maurer , A spaceoptimal solution of general region location , Theoret
S. Arya, D. Mount (1995)
Approximate range searchingComput. Geom., 17
Extended Abstrac (1983)
A 3-space partition and its applicationsProceedings of the fifteenth annual ACM symposium on Theory of computing
P. Agarwal, M. Sharir (1996)
Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three DimensionsSIAM J. Comput., 25
J. Matoušek (1990)
Construction of ɛ-netsDiscrete & Computational Geometry, 5
D. Haussler, E. Welzl (1986)
Epsilon-nets and simplex range queries
R. Cole, C. Yap (1986)
Geometric retrieval problems24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
Timothy Chan (2010)
Optimal Partition TreesDiscrete & Computational Geometry, 47
E. Welzl (1988)
Partition trees for triangle counting and other range searching problems
Hervé Brönnimann, B. Chazelle (1992)
How hard is halfspace range searching?
Hervé Brönnimann, B. Chazelle, J. Pach (1993)
How hard is half-space range searching?Discrete & Computational Geometry, 10
P. Agarwal, J. Erickson (2007)
Geometric Range Searching and Its Relatives
A. Aggarwal, Mark Hansen, F. Leighton (1990)
Solving query-retrieval problems by compacting Voronoi diagrams
B. Chazelle (1983)
Filtering search: A new approach to query-answering24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
A. Yao (1985)
On the Complexity of Maintaining Partial SumsSIAM J. Comput., 14
(1989)
Janardan , Algorithms for rayshooting and intersection searching
N. Megiddo (1981)
Applying parallel computation algorithms in the design of serial algorithms22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
Kasper Larsen, Huy Nguyen (2012)
Improved range searching lower bounds
B. Chazelle, L. Guibas, Der-Tsai Lee (1983)
The power of geometric dualityBIT Numerical Mathematics, 25
J. Matoušek, O. Cheong (1992)
Linear optimization queriesJ. Algorithms, 14
J. Matoušek (2003)
Using The Borsuk-Ulam Theorem
Haim Kaplan, E. Ramos, M. Sharir (2011)
Range Minima Queries with Respect to a Random Permutation, and Approximate Range CountingDiscrete & Computational Geometry, 45
K. Clarkson (1988)
A Randomized Algorithm for Closest-Point QueriesSIAM J. Comput., 17
M. Kreveld, M. Löffler (2016)
Range Searching
S. Arya, G. Fonseca, D. Mount (2011)
Approximate polytope membership queries
J. Bentley (1975)
Multidimensional binary search trees used for associative searchingCommun. ACM, 18
(1983)
Vegter , Pseudotriangulations : Theory and applications
Edelsbrunner , Space searching for intersecting objects
P. Afshani, Chris Hamilton, N. Zeh (2009)
A general approach for cache-oblivious range reporting and approximate range countingComput. Geom., 43
H. Edelsbrunner, H. Maurer (1981)
A Space-Optimal Solution of General Region LocationTheor. Comput. Sci., 16
A. Yao, F. Yao (1985)
A general approach to d-dimensional geometric queries
(2011)
Relative (p
G. Fonseca (2007)
Approximate Range Searching: The Absolute Model
J. Bentley (1980)
Multidimensional divide-and-conquerCommun. ACM, 23
D. Haussler, E. Welzl (1987)
ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 2
F. Yao, D. Dobkin, H. Edelsbrunner, Michael Paterson (1989)
Partitioning Space for Range QueriesSIAM J. Comput., 18
Timothy Chan (2000)
Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three DimensionsSIAM J. Comput., 30
B. Chazelle, J. Goodman, R. Pollack (1999)
Advances in Discrete and Computational Geometry, 223
B. Chazelle (1998)
A Spectral Approach to Lower Bounds with Applications to Geometric SearchingSIAM J. Comput., 27
J. Matoušek (1990)
Cutting hyperplane arrangementsDiscrete & Computational Geometry, 6
K. Clarkson (1987)
New applications of random sampling in computational geometryDiscrete & Computational Geometry, 2
R. Cole (2018)
Partitioning Point Sets in 4 Dimensions
S. Rahul (2015)
Approximate Range Counting RevisitedJ. Comput. Geom., 12
K. Clarkson (1995)
Las Vegas algorithms for linear and integer programming when the dimension is smallJ. ACM, 42
D. Avis (1984)
Non-Partitionable Point SetsInf. Process. Lett., 19
M. Fredman (1981)
Lower Bounds on the Complexity of Some Optimal Data StructuresSIAM J. Comput., 10
(2015)
Approximate range counting revisited, CoRR, abs/1512
G. Lueker (1978)
A data structure for orthogonal range queries19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
M. Sharir, Hayim Shaul (2009)
Semialgebraic Range Reporting and Emptiness Searching with ApplicationsSIAM J. Comput., 40
J. Matoušek (1991)
Efficient partition treesDiscrete & Computational Geometry, 8
B. Chazelle, F. Preparata (1986)
Halfspace range search: An algorithmic application ofk-setsDiscrete & Computational Geometry, 1
(1990)
Construction of e-nets
D. Dobkin, H. Edelsbrunner (1984)
Space Searching for Intersecting Objects
H. Edelsbrunner, E. Welzl (1986)
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query TimeInf. Process. Lett., 23
Jeff Erickson (1996)
New lower bounds for halfspace emptinessProceedings of 37th Conference on Foundations of Computer Science
S. Arya, D. Mount, Jian Xia (2010)
Tight Lower Bounds for Halfspace Range SearchingDiscrete & Computational Geometry, 47
P. Agarwal, J. Matoušek, M. Sharir (2012)
On Range Searching with Semialgebraic Sets II2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
P. Agarwal, J. Matoušek (1992)
Ray shooting and parametric searchSIAM J. Comput., 22
J. Matoušek (1994)
Geometric range searchingACM Comput. Surv., 26
P. Agarwal, M. Sharir (1991)
Applications of a New Space Partitioning Technique
L. Guth, N. Katz (2015)
On the Erdős distinct distances problem in the planeAnnals of Mathematics, 181
P. Afshani, Timothy Chan (2009)
Optimal halfspace range reporting in three dimensions
Timothy Chan, Konstantinos Tsakalidis (2015)
Optimal Deterministic Algorithms for 2-d and 3-d Shallow CuttingsDiscrete & Computational Geometry, 56
B. Chazelle, B. Rosenberg (1995)
Simplex Range Reporting on a Pointer MachineComput. Geom., 5
D. Willard (1982)
Polygon RetrievalSIAM J. Comput., 11
P. Agarwal, M. Sharir (1996)
Ray Shooting Amidst Convex Polygons in 2DJ. Algorithms, 21
B. Chazelle, M. Sharir, E. Welzl (1990)
Quasi-optimal upper bounds for simplex range searching and new zone theoremsAlgorithmica, 8
P. Indyk (2004)
Nearest Neighbors in High-Dimensional Spaces
B. Chazelle (1998)
The Discrepancy Method
E. Ramos (1999)
On range reporting, ray shooting and k-level construction
P. Afshani (2012)
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
B. Chazelle, Ding Liu, A. Magen (2004)
Approximate range searching in higher dimensionComput. Geom., 39
Sariel Har-Peled, M. Sharir (2009)
Relative (p,epsilon)-Approximations in GeometryArXiv, abs/0909.0717
(1996)
New lower bounds for Hopcroft's problem, Discrete Comput
Kasper Larsen (2011)
On Range Searching in the Group Model and Combinatorial Discrepancy2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
B. Chazelle (1988)
A Functional Approach to Data Structures and Its Use in Multidimensional SearchingSIAM J. Comput., 17
J. Matoušek (1992)
Range searching with efficient hierarchical cuttingsDiscrete & Computational Geometry, 10
B. Aronov, Sariel Har-Peled (2005)
On approximating the depth and related problemsSIAM J. Comput., 38
V. Koltun (2004)
Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four DimensionsDiscrete & Computational Geometry, 31
Jeff Erickson (1995)
New lower bounds for Hopcroft's problemDiscrete & Computational Geometry, 16
M. Fredman (1981)
A Lower Bound on the Complexity of Orthogonal Range QueriesJ. ACM, 28
B. Aronov, M. Sharir (2010)
Approximate Halfspace Range CountingSIAM J. Comput., 39
Timothy Chan (1996)
Fixed-dimensional linear programming queries made easy
B. Chazelle (1990)
Lower bounds for orthogonal range searching: part II. The arithmetic modelJ. ACM, 37
H. Edelsbrunner, H. Maurer, D. Kirkpatrick (1982)
Polygonal Intersection SearchingInf. Process. Lett., 14
Sal Barone, S. Basu (2011)
Refined Bounds on the Number of Connected Components of Sign Conditions on a VarietyDiscrete & Computational Geometry, 47
B. Chazelle, J. Friedman (1988)
A deterministic view of random sampling and its use in geometryCombinatorica, 10
[A central problem in computational geometry, range searching arises in many applications, and numerous geometric problems can be formulated in terms of range searching. A typical range-searching problem has the following form. Let S be a set of n points in ℝd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^{d}$$ \end{document}, and let ℛ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}$$ \end{document} be a family of subsets of ℝd\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^{d}$$ \end{document}; elements of ℛ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}$$ \end{document} are called ranges. Preprocess S into a data structure so that for a query range γ∈ℛ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\gamma \in \mathbb{R}$$ \end{document}, the points in S ∩γ can be reported or counted efficiently. Notwithstanding extensive work on range searching over the last four decades, it remains an active research area. A series of papers by Jirka Matoušek and others in the late 1980s and the early 1990s had a profound impact not only on range searching but also on computational geometry as a whole. This chapter reviews the known results and techniques, including recent developments, for simplex range searching and its variants.]
Published: May 9, 2017
Keywords: Simplex Range Searching; Range Counting Queries; Linear Size Data Structure; Query Time; Query Halfspace
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.