On the public citation graph
Cutting hyperplane arrangements
0 signed · 136 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.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187805openalex-snapshot
Partitioning arrangements of lines I: An efficient deterministic algorithm
inferredcites →https://doi.org/10.1007/bf02187809openalex-snapshot
Partitioning arrangements of lines II: Applications
inferredcites →https://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
inferredcites →https://doi.org/10.1016/0022-0000(88)90003-7openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1016/s0022-0000(05)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1109/sfcs.1986.45openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1109/sfcs.1989.63447openalex-snapshot
Simulating (log/sup c/n)-wise independence in NC
inferredcites →https://doi.org/10.1109/sfcs.1989.63455openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1137/0220013openalex-snapshot
Approximate Levels in Line Arrangements
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferredcites →https://doi.org/10.1145/22145.22163openalex-snapshot
A general approach to d-dimensional geometric queries
inferredcites →https://doi.org/10.1145/41958.41994openalex-snapshot
Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1145/98524.98530openalex-snapshot
How to net a lot with little: small ε-nets for disks and halfspaces
inferredcites →https://doi.org/10.1145/98524.98567openalex-snapshot
Euclidean minimum spanning trees and bichromatic closest pairs
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jagm.1996.0038openalex-snapshot
Repetitive Hidden Surface Removal for Polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_1openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_714openalex-snapshot
Parallel randomized techniques for some fundamental geometric problems: A survey
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_34openalex-snapshot
Improved Deterministic Parallel Padded Sorting
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_7openalex-snapshot
Parallel Randomized Techniques for Some Fundamental Geometric Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
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/978-3-540-73951-7_41openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_4openalex-snapshot
Epsilon-Nets and Computational Geometry
inferred← citeshttps://doi.org/10.1007/bf01758854openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02189314openalex-snapshot
Cutting hyperplanes for divide-and-conquer
inferred← citeshttps://doi.org/10.1007/bf02392598openalex-snapshot
Improved upper bounds for approximation by zonotopes
inferred← citeshttps://doi.org/10.1007/bf02523679openalex-snapshot
On counting pairs of intersecting segments and off-line triangle range searching
inferred← citeshttps://doi.org/10.1007/bf02570718openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferred← citeshttps://doi.org/10.1007/bf02573972openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1007/bf02573985openalex-snapshot
An optimal convex hull algorithm in any fixed dimension
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bfb0035458openalex-snapshot
Deterministic sampling and optimization
inferred← citeshttps://doi.org/10.1007/bfb0049415openalex-snapshot
Fast algorithms for collision and proximity problems involving moving geometric objects
inferred← citeshttps://doi.org/10.1007/pl00009325openalex-snapshot
Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming
inferred← citeshttps://doi.org/10.1007/pl00009327openalex-snapshot
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s00365-025-09712-9openalex-snapshot
Optimal Approximation of Zonoids and Uniform Approximation by Shallow Neural Networks
inferred← citeshttps://doi.org/10.1007/s00453-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
inferred← citeshttps://doi.org/10.1007/s00453-017-0376-3openalex-snapshot
Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges
inferred← citeshttps://doi.org/10.1007/s00454-008-9118-2openalex-snapshot
On Regular Vertices of the Union of Planar Convex Objects
inferred← citeshttps://doi.org/10.1007/s00454-009-9158-2openalex-snapshot
Cuttings for Disks and Axis-Aligned Rectangles in Three-Space
inferred← citeshttps://doi.org/10.1007/s00454-016-9784-4openalex-snapshot
Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings
inferred← citeshttps://doi.org/10.1007/s00454-018-0043-8openalex-snapshot
A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model
inferred← citeshttps://doi.org/10.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90025-5openalex-snapshot
The power of parallel projection
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90234-zopenalex-snapshot
Optimal slope selection via expanders
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00098-0openalex-snapshot
Many-face complexity in incremental convex arrangements
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferred← citeshttps://doi.org/10.1016/0925-7721(94)00019-0openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90009-4openalex-snapshot
Point location among hyperplanes and unidirectional ray-shooting
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00012-7openalex-snapshot
Algorithms for generalized halfspace range searching and other intersection searching problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00021-6openalex-snapshot
Point location in zones of k-flats in arrangements
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00025-9openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00028-3openalex-snapshot
Fast algorithms for collision and proximity problems involving moving geometric objects
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50017-6openalex-snapshot
Randomized Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.003openalex-snapshot
Counting and representing intersections among triangles in three dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.004openalex-snapshot
Space/query-time tradeoff for computing the visibility polygon
inferred← citeshttps://doi.org/10.1016/j.csda.2006.08.033openalex-snapshot
A practical approximation algorithm for the LMS line estimator
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.010openalex-snapshot
A note on point location in arrangements of hyperplanes
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.021openalex-snapshot
Computing coverage kernels under restricted settings
inferred← citeshttps://doi.org/10.1109/12.376174openalex-snapshot
On computing connected components of line segments
inferred← citeshttps://doi.org/10.1109/focs.2007.10openalex-snapshot
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2007.9openalex-snapshot
Extractors and Rank Extractors for Polynomial Sources
inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366847openalex-snapshot
Product range spaces, sensitive sampling, and derandomization
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365724openalex-snapshot
Parallel algorithms for higher-dimensional convex hulls
inferred← citeshttps://doi.org/10.1137/070684483openalex-snapshot
Efficient Colored Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1137/1.9781611977585.ch25openalex-snapshot
An Optimal Lower Bound for Simplex Range Reporting
inferred← citeshttps://doi.org/10.1137/21m145118xopenalex-snapshot
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments
inferred← citeshttps://doi.org/10.1137/s0097539704444245openalex-snapshot
Output-Sensitive Construction of the Union of Triangles
inferred← citeshttps://doi.org/10.1137/s0097539793256880openalex-snapshot
On Point Location and Motion Planning among Simplices
inferred← citeshttps://doi.org/10.1137/s0097539795281840openalex-snapshot
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
inferred← citeshttps://doi.org/10.1137/s0097539796260321openalex-snapshot
Product Range Spaces, Sensitive Sampling, and Derandomization
inferred← citeshttps://doi.org/10.1137/s0097539797325727openalex-snapshot
Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications to Linear Programming and Related Problems
inferred← citeshttps://doi.org/10.1142/s0218195901000523openalex-snapshot
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
inferred← citeshttps://doi.org/10.1145/1247069.1247110openalex-snapshot
On regular vertices on the union of planar objects
inferred← citeshttps://doi.org/10.1145/142675.142732openalex-snapshot
Range searching with efficient hierarchical cuttings
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1145/160985.161002openalex-snapshot
Geometric partitioning made easier, even in parallel
inferred← citeshttps://doi.org/10.1145/1613676.1613678openalex-snapshot
On the union of fat tetrahedra in three dimensions
inferred← citeshttps://doi.org/10.1145/167088.167217openalex-snapshot
A deterministic algorithm for the three-dimensional diameter problem
inferred← citeshttps://doi.org/10.1145/177424.177521openalex-snapshot
Constructing levels in arrangements and higher order Voronoi diagrams
inferred← citeshttps://doi.org/10.1145/177424.178029openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferred← citeshttps://doi.org/10.1145/177424.178096openalex-snapshot
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
inferred← citeshttps://doi.org/10.1145/1810959.1810974openalex-snapshot
The 2-center problem in three dimensions
inferred← citeshttps://doi.org/10.1145/195058.195112openalex-snapshot
On point location and motion planning among simplices
inferred← citeshttps://doi.org/10.1145/225058.225285openalex-snapshot
Computing faces in segment and simplex arrangements
inferred← citeshttps://doi.org/10.1145/237218.237347openalex-snapshot
On computing Voronoi diagrams by divide-prune-and-conquer
inferred← citeshttps://doi.org/10.1145/237502.237564openalex-snapshot
Parallel multidimensional search using approximation algorithms
inferred← citeshttps://doi.org/10.1145/2582112.2582155openalex-snapshot
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
inferred← citeshttps://doi.org/10.1145/2700222openalex-snapshot
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
inferred← citeshttps://doi.org/10.1145/276884.276914openalex-snapshot
Randomized external-memory algorithms for some geometric problems
inferred← citeshttps://doi.org/10.1145/3012939openalex-snapshot
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries
inferred← citeshttps://doi.org/10.1145/304893.304993openalex-snapshot
On range reporting, ray shooting and k -level construction
inferred← citeshttps://doi.org/10.1145/3406325.3451062openalex-snapshot
Stronger bounds for weak epsilon-nets in higher dimensions
inferred← citeshttps://doi.org/10.1145/3578574openalex-snapshot
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
inferred← citeshttps://doi.org/10.1145/98524.98532openalex-snapshot
Quasi-optimal upper bounds for simplex range searching and new zone theorems
inferred← citeshttps://doi.org/10.1201/9781315119335-67openalex-snapshot
Computational Geometry: Generalized (or Colored) Intersection Searching
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2020.78openalex-snapshot
Epsilon-approximations and epsilon-nets
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.8openalex-snapshot
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6305openalex-snapshot
Output-Sensitive Tools for Range Searching in Higher Dimensions
inferred← citeshttps://doi.org/10.48550/arxiv.1510.01041openalex-snapshot
GPU-Based Computation of 2D Least Median of Squares with Applications to Fast and Robust Line Detection
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05541openalex-snapshot
2D Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.5555/2634074.2634176openalex-snapshot
Optimal deterministic shallow cuttings for 3D dominance ranges
inferred← citeshttps://doi.org/10.5555/314161.314349openalex-snapshot
A practical approximation algorithm for the LMS line estimator
inferred← citeshttps://doi.org/10.5555/314161.314438openalex-snapshot
Methods for achieving fast query times in point location data structures
inferred← citeshttps://doi.org/10.5555/545381.545401openalex-snapshot
Motorcycle graphs and straight skeletons
inferred← citeshttps://doi.org/10.5555/982792.982852openalex-snapshot
Output-sensitive construction of the union of triangles
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.