On the public citation graph
The complexity of many cells in arrangements of planes and related problems
0 signed · 69 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-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
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/bf02187742openalex-snapshot
Implicitly representing arrangements of lines or segments
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02579194openalex-snapshot
Extremal problems in discrete geometry
inferredcites →https://doi.org/10.1007/bf02788872openalex-snapshot
A theorem on arrangements of lines in the plane
inferredcites →https://doi.org/10.1016/0012-365x(86)90008-7openalex-snapshot
The complexity of cells in three-dimensional arrangements
inferredcites →https://doi.org/10.1016/0097-3165(86)90078-6openalex-snapshot
On the maximal number of edges of many faces in an arrangement
inferredcites →https://doi.org/10.1016/0304-3975(79)90055-0openalex-snapshot
Finding the intersection of n half-spaces in time O(n log n)
inferredcites →https://doi.org/10.1016/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot
How to search in history
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.1145/22145.22165openalex-snapshot
A probabilistic algorithm for the post office problem
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferredcites →https://doi.org/10.1145/73393.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
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.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/bf01955043openalex-snapshot
Lines in Space: Combinatorics and Algorithms
inferred← citeshttps://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02712875openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1007/s00454-003-0854-zopenalex-snapshot
Cell Complexities in Hyperplane Arrangements
inferred← citeshttps://doi.org/10.1007/s00454-006-1279-2openalex-snapshot
Incidence Theorems for Pseudoflats
inferred← citeshttps://doi.org/10.1007/s00454-011-9367-3openalex-snapshot
A Bichromatic Incidence Bound and an Application
inferred← citeshttps://doi.org/10.1007/s00454-015-9731-9openalex-snapshot
New Results for the Growth of Sets of Real Numbers
inferred← citeshttps://doi.org/10.1007/s00493-014-2686-2openalex-snapshot
The Szemerédi-Trotter theorem in the complex plane
inferred← citeshttps://doi.org/10.1007/s00493-016-3329-6openalex-snapshot
On the Number of Incidences Between Points and Planes in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s11856-015-1227-zopenalex-snapshot
On the Minkowski distances and products of sum sets
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/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(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
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/b978-044482537-7/50013-9openalex-snapshot
Link Distance Problems
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50019-1openalex-snapshot
10.1016/b978-044488002-4/50019-1
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101681openalex-snapshot
Two theorems on point-flat incidences
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/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1017/s0963548308009127openalex-snapshot
On a Question of Bourgain about Geometric Incidences
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1137/050641375openalex-snapshot
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes
inferred← citeshttps://doi.org/10.1142/s0218195900000036openalex-snapshot
COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
inferred← citeshttps://doi.org/10.1145/1064092.1064098openalex-snapshot
Incidences of not-too-degenerate hyperplanes
inferred← citeshttps://doi.org/10.1145/109648.109682openalex-snapshot
On the sum of squares of cell complexities in hyperplane arrangements
inferred← citeshttps://doi.org/10.1145/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/73393.73399openalex-snapshot
The complexity of many faces in arrangements of lines of segments
inferred← citeshttps://doi.org/10.1145/73393.73432openalex-snapshot
Triangles in space or building (and analyzing) castles in the Air
inferred← citeshttps://doi.org/10.1515/9783110642094-011openalex-snapshot
11. Point-plane incidences and some applications in positive characteristic
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a14openalex-snapshot
Incidences with $k$-non-degenerate sets and their applications
inferred← citeshttps://doi.org/10.4171/jems/705openalex-snapshot
A semi-algebraic version of Zarankiewicz's problem
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.60openalex-snapshot
Applications of Incidence Bounds in Point Covering Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1202.4972openalex-snapshot
New results for the growth of sets of real numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6237openalex-snapshot
On the Minkowski distances and products of sum sets
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04823openalex-snapshot
Incidences between points on a variety and planes in R^3
inferred← citeshttps://doi.org/10.7282/t3qj7m8topenalex-snapshot
Some applications of algebraic methods in combinatorial geometry
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.