On the public citation graph
Cutting hyperplane arrangements
0 signed · 46 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/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
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.1988.21970openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
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.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/73393.73400openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1145/73833.73835openalex-snapshot
A deterministic algorithm for partitioning arrangements of lines and its application
inferredcites →https://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
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.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.1007/978-3-319-44479-6openalex-snapshot
A Journey Through Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bfb0028246openalex-snapshot
Ray-shooting and isotopy classes of lines in 3-dimensional space
inferred← citeshttps://doi.org/10.1007/bfb0028277openalex-snapshot
Applications of a new space partitioning technique
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.1016/0925-7721(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185370openalex-snapshot
Reporting points in halfspaces
inferred← citeshttps://doi.org/10.1145/103418.103470openalex-snapshot
Approximations and optimal geometric divide-and-conquer
inferred← citeshttps://doi.org/10.1145/109648.109650openalex-snapshot
Counting circular arc intersections
inferred← citeshttps://doi.org/10.1145/1498698.1626535openalex-snapshot
Reduction rules deliver efficient FPT-algorithms for covering points with lines
inferred← citeshttps://doi.org/10.1145/160985.160990openalex-snapshot
On lines missing polyhedral sets in 3-space
inferred← citeshttps://doi.org/10.1201/9781420035315.ch44openalex-snapshot
The discrepancy method in computational geometry
inferred← citeshttps://doi.org/10.25904/1912/1694openalex-snapshot
The NP-Hardness of Covering Points with Lines, Paths and Tours and their Tractability with FPT-Algorithms
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.