On the public citation graph
Halfspace range search: An algorithmic application ofk-sets
0 signed · 67 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/b978-0-7204-2262-7.50018-1openalex-snapshot
Dissection Graphs of Planar Point Sets
inferredcites →https://doi.org/10.1016/s0019-9958(86)80030-4openalex-snapshot
New upper bounds for neighbor searching
inferredcites →https://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferredcites →https://doi.org/10.1109/sfcs.1983.17openalex-snapshot
Filtering search: A new approach to query-answering
inferredcites →https://doi.org/10.1109/tc.1982.1676031openalex-snapshot
On k-Nearest Neighbor Voronoi Diagrams in the Plane
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/800057.808677openalex-snapshot
On k-hulls and related problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.2000.1709openalex-snapshot
Efficient Searching with Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_1openalex-snapshot
Simplex Range Searching and Its Variants: A Review
inferred← citeshttps://doi.org/10.1007/bf01293483openalex-snapshot
Dynamic half-space range reporting and its applications
inferred← citeshttps://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferred← citeshttps://doi.org/10.1007/bf02187829openalex-snapshot
An upper bound on the number of planarK-sets
inferred← citeshttps://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferred← citeshttps://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1007/pl00009354openalex-snapshot
Improved Bounds for Planar k -Sets and Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-009-9322-3openalex-snapshot
On Bounded Leg Shortest Paths Problems
inferred← citeshttps://doi.org/10.1007/s00454-001-0022-2openalex-snapshot
Recognition of Flat Orbifolds and the Classification of Tilings in R 3
inferred← citeshttps://doi.org/10.1007/s00454-005-1165-3openalex-snapshot
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
inferred← citeshttps://doi.org/10.1007/s00454-007-9013-2openalex-snapshot
Robust Shape Fitting via Peeling and Grating Coresets
inferred← citeshttps://doi.org/10.1007/s00454-007-9046-6openalex-snapshot
Efficient Algorithms for Maximum Regression Depth
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90213-xopenalex-snapshot
Line arrangements and range search
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1093/comjnl/bxac067openalex-snapshot
Geometric Searchable Encryption Without False Positive And Its Applications
inferred← citeshttps://doi.org/10.1109/iwqos.2017.7969108openalex-snapshot
Efficient and generalized geometric range search on encrypted spatial data in the cloud
inferred← citeshttps://doi.org/10.1109/sfcs.1987.48openalex-snapshot
Polytope range searching and integral geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63458openalex-snapshot
An upper bound on the number of planar k-sets
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185370openalex-snapshot
Reporting points in halfspaces
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267816openalex-snapshot
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646104openalex-snapshot
Improved bounds on planar k-sets and k-levels
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743509openalex-snapshot
Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892109openalex-snapshot
On levels in arrangements of curves
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238227openalex-snapshot
On levels in arrangements of curves. II. A simple inequality and its consequences
inferred← citeshttps://doi.org/10.1137/s0097539798349188openalex-snapshot
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
inferred← citeshttps://doi.org/10.1145/100216.100260openalex-snapshot
Solving query-retrieval problems by compacting Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferred← citeshttps://doi.org/10.1145/160985.161141openalex-snapshot
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
inferred← citeshttps://doi.org/10.1145/177424.177648openalex-snapshot
Cutting dense point sets in half
inferred← citeshttps://doi.org/10.1145/1963190.2063517openalex-snapshot
Approximation algorithms for speeding up dynamic programming and denoising aCGH data
inferred← citeshttps://doi.org/10.1145/220279.220284openalex-snapshot
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
inferred← citeshttps://doi.org/10.1145/275487.275506openalex-snapshot
Efficient searching with linear constraints
inferred← citeshttps://doi.org/10.1145/276884.276916openalex-snapshot
On enumerating and selecting distances
inferred← citeshttps://doi.org/10.1145/2902251.2902290openalex-snapshot
Efficient Top-k Indexing via General Reductions
inferred← citeshttps://doi.org/10.1145/304893.304901openalex-snapshot
Efficient algorithms for maximum regression depth
inferred← citeshttps://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferred← citeshttps://doi.org/10.1515/crelle.2011.157openalex-snapshot
Overlap properties of geometric expanders
inferred← citeshttps://doi.org/10.21236/ada230380openalex-snapshot
Results in Computational Geometry: Geometric Embeddings and Query- Retrieval Problems
inferred← citeshttps://doi.org/10.5441/002/edbt.2014.39openalex-snapshot
A Unified Framework for Efficiently Processing Ranking Related Queries
inferred← citeshttps://doi.org/10.5555/1109557.1109579openalex-snapshot
Robust shape fitting via peeling and grating coresets
inferred← citeshttps://doi.org/10.5555/1283383.1283466openalex-snapshot
On bounded leg shortest paths problems
inferred← citeshttps://doi.org/10.5555/1496770.1496791openalex-snapshot
Optimal halfspace range reporting in three dimensions
inferred← citeshttps://doi.org/10.70675/75f898dfzfaacz4592za6e3z8ee996f080b5openalex-snapshot
K-set Polygons and Centroid Triangulations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.