On the public citation graph
On the zone theorem for hyperplane arrangements
0 signed · 31 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/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
inferredcites →https://doi.org/10.1007/bf02187734openalex-snapshot
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
inferredcites →https://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1016/0022-0000(89)90038-xopenalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1090/dimacs/006/03openalex-snapshot
Horizon theorems for lines and polygons
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/109648.109682openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
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-0-387-74759-0_94openalex-snapshot
Convex Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-26995-5_2openalex-snapshot
Non-convex Region Description by Hyperplane Arrangements
inferred← citeshttps://doi.org/10.1007/bf01266616openalex-snapshot
A theorem on the average number of subfaces in arrangements and oriented matroids
inferred← citeshttps://doi.org/10.1007/bf02189317openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferred← citeshttps://doi.org/10.1007/s00454-004-1138-yopenalex-snapshot
Convex Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s10878-007-9063-7openalex-snapshot
The use of edge-directions and linear programming to enumerate vertices
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/j.dam.2006.06.014openalex-snapshot
The partition bargaining problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106161openalex-snapshot
Zone theorem for arrangements in dimension three
inferred← citeshttps://doi.org/10.1109/acc.2011.5990908openalex-snapshot
On the hyperplanes arrangements in mixed-integer techniques
inferred← citeshttps://doi.org/10.1112/plms/s3-70.3.691openalex-snapshot
Polytope Containment and Determination by Linear Probes
inferred← citeshttps://doi.org/10.1137/0406019openalex-snapshot
Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
inferred← citeshttps://doi.org/10.1137/s0895480102408559openalex-snapshot
Convex Matroid Optimization
inferred← citeshttps://doi.org/10.1142/s0218195912600011openalex-snapshot
THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.1145/167088.167224openalex-snapshot
Piecewise linear paths among convex obstacles
inferred← citeshttps://doi.org/10.17169/refubium-30436openalex-snapshot
On the Average Complexity of the $k$-Level
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.3233/978-1-60750-718-5-183openalex-snapshot
Convex Discrete Optimization
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.