On the public citation graph
The number of edges of many faces in a line segment arrangement
0 signed · 36 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/bf02122693openalex-snapshot
Entropy splitting for antiblocking corners and perfect graphs
inferredcites →https://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferredcites →https://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
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.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferredcites →https://doi.org/10.1007/bf02788872openalex-snapshot
A theorem on arrangements of lines in the plane
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.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
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-55719-9_94openalex-snapshot
A tail estimate for Mulmuley's segment intersection algorithm
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_234openalex-snapshot
Connected component and simple polygon intersection searching
inferred← citeshttps://doi.org/10.1007/978-3-319-27261-0_30openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_1openalex-snapshot
On the Complexity of Many Faces in Arrangements of Pseudo-Segments and Circles
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bf01940884openalex-snapshot
Connected component and simple polygon intersection searching
inferred← citeshttps://doi.org/10.1007/s00454-003-0854-zopenalex-snapshot
Cell Complexities in Hyperplane Arrangements
inferred← citeshttps://doi.org/10.1007/s00454-017-9919-2openalex-snapshot
Drawing Graphs Using a Small Number of Obstacles
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
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.2021.101794openalex-snapshot
Solving the minimum convex partition of point sets with integer programming
inferred← citeshttps://doi.org/10.1016/j.dam.2008.06.019openalex-snapshot
Topological sweep of the complete graph
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104217openalex-snapshot
Faces in rectilinear drawings of complete graphs
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00004-1openalex-snapshot
The common exterior of convex polygons in the plane
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959882openalex-snapshot
On the complexity of many faces in arrangements of circles
inferred← citeshttps://doi.org/10.1137/1.9781611977073.123openalex-snapshot
Constructing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.1137/s009753979426616xopenalex-snapshot
Computing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.47749/t/unicamp.2022.1254700openalex-snapshot
Geometric decomposition problems
inferred← citeshttps://doi.org/10.5555/365411.365440openalex-snapshot
Simplified kinetic connectivity for rectangles and hypercubes
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.