On the public citation graph
On the zone of a surface in a hyperplane arrangement
0 signed · 71 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/3-540-55808-x_1openalex-snapshot
On range searching with semialgebraic sets
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bfb0028245openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bfb0028246openalex-snapshot
Ray-shooting and isotopy classes of lines in 3-dimensional space
inferredcites →https://doi.org/10.1007/bfb0038185openalex-snapshot
On the zone theorem for hyperplane arrangements
inferredcites →https://doi.org/10.1090/dimacs/006/03openalex-snapshot
Horizon theorems for lines and polygons
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0161339-9openalex-snapshot
On the Betti Numbers of Real Varieties
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
inferredcites →https://doi.org/10.1145/109648.109651openalex-snapshot
Efficient ray shooting and hidden surface removal
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.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/3-540-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
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-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_27openalex-snapshot
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/bf01258293openalex-snapshot
Robot motion planning and the single cell problem in arrangements
inferred← citeshttps://doi.org/10.1007/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bf02570714openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1007/bf02573973openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02712877openalex-snapshot
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
inferred← citeshttps://doi.org/10.1007/s00453-008-9220-0openalex-snapshot
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/s00454-002-0727-xopenalex-snapshot
The Number of Congruent Simplices in a Point Set
inferred← citeshttps://doi.org/10.1007/s00454-003-0854-zopenalex-snapshot
Cell Complexities in Hyperplane Arrangements
inferred← citeshttps://doi.org/10.1007/s00454-004-1093-7openalex-snapshot
An Improved Bound for Joints in Arrangements of Lines in Space
inferred← citeshttps://doi.org/10.1007/s00454-004-1116-4openalex-snapshot
New Constructions of Weak ?-Nets
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90005-1openalex-snapshot
On joints in arrangements of lines in space and related problems
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90027-2openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90016-7openalex-snapshot
On stabbling lines for convex polyhedra in 3D
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/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/j.comgeo.2014.12.001openalex-snapshot
On the zone of the boundary of a convex body
inferred← citeshttps://doi.org/10.1016/j.dam.2014.04.009openalex-snapshot
A note on visibility-constrained Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.disc.2017.02.022openalex-snapshot
On the zone of a circle in an arrangement of lines
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.032openalex-snapshot
On the zone of a circle in an arrangement of lines
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/focs.2018.00030openalex-snapshot
An Improved Bound for Weak Epsilon-Nets in the Plane
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366835openalex-snapshot
The union of convex polyhedra in three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366849openalex-snapshot
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1137/21m1423324openalex-snapshot
Optimal Algorithms for Geometric Centers and Depth
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539793252080openalex-snapshot
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1145/109648.109651openalex-snapshot
Efficient ray shooting and hidden surface removal
inferred← citeshttps://doi.org/10.1145/1150334.1150338openalex-snapshot
Efficient algorithms for bichromatic separability
inferred← citeshttps://doi.org/10.1145/142675.142702openalex-snapshot
Diameter, width, closest line pair, and parametric searching
inferred← citeshttps://doi.org/10.1145/177424.177436openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1145/220279.220301openalex-snapshot
A new technique for analyzing substructures in arrangements
inferred← citeshttps://doi.org/10.1145/3406325.3451062openalex-snapshot
Stronger bounds for weak epsilon-nets in higher dimensions
inferred← citeshttps://doi.org/10.1145/3555985openalex-snapshot
An Improved Bound for Weak Epsilon-nets in the Plane
inferred← citeshttps://doi.org/10.1145/378583.378587openalex-snapshot
On the number of congruent simplices in a point
inferred← citeshttps://doi.org/10.1145/777792.777813openalex-snapshot
New constructions of weak epsilon-nets
inferred← citeshttps://doi.org/10.21236/ada228278openalex-snapshot
Implementation and Experimentation with Motion Planning Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6305openalex-snapshot
Output-Sensitive Tools for Range Searching in Higher Dimensions
inferred← citeshttps://doi.org/10.5555/313559.313764openalex-snapshot
Ray shooting amidst convex polytopes in three dimensions
inferred← citeshttps://doi.org/10.5555/982792.982897openalex-snapshot
Efficient algorithms for bichromatic separability
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.