On the public citation graph
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
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-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
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/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/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02189317openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bf02570698openalex-snapshot
Vertical decomposition of arrangements of hyperplanes in four dimensions
inferredcites →https://doi.org/10.1007/bf02570705openalex-snapshot
On lazy randomized incremental construction
inferredcites →https://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferredcites →https://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferredcites →https://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferredcites →https://doi.org/10.1109/sfcs.1993.366835openalex-snapshot
The union of convex polyhedra in three dimensions
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
inferredcites →https://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferredcites →https://doi.org/10.1145/177424.177445openalex-snapshot
On translational motion planning in 3-space
inferredcites →https://doi.org/10.1145/220279.220288openalex-snapshot
Voronoi diagrams in higher dimensions under certain polyhedral distance functions
inferredcites →https://doi.org/10.1145/220279.220299openalex-snapshot
The overlay of lower envelopes in three dimensions and its applications
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
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/11751540_3openalex-snapshot
Visibility Maps of Segments and Triangles in 3D
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_10openalex-snapshot
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
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/978-3-319-27261-0_18openalex-snapshot
On the Zarankiewicz Problem for Intersection Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_11openalex-snapshot
Matching Polyhedral Terrains Using Overlays of Envelopes
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_27openalex-snapshot
The Union of Colorful Simplices Spanned by a Colored Point Set
inferred← citeshttps://doi.org/10.1007/s00453-004-1107-0openalex-snapshot
Matching Polyhedral Terrains Using Overlays of Envelopes
inferred← citeshttps://doi.org/10.1007/s00454-002-2799-zopenalex-snapshot
The Combinatorial and Topological Complexity of a Single Cell
inferred← citeshttps://doi.org/10.1007/s00454-003-2871-3openalex-snapshot
Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-003-2950-5openalex-snapshot
Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-005-1165-3openalex-snapshot
On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences
inferred← citeshttps://doi.org/10.1007/s00454-006-1272-9openalex-snapshot
A Single Cell in an Arrangement of Convex Polyhedra in ${\Bbb R}^3$
inferred← citeshttps://doi.org/10.1007/s00454-008-9118-2openalex-snapshot
On Regular Vertices of the Union of Planar Convex Objects
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.2006.11.001openalex-snapshot
Visibility maps of segments and triangles in 3D
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.006openalex-snapshot
The union of colorful simplices spanned by a colored point set
inferred← citeshttps://doi.org/10.1016/j.jcta.2016.02.001openalex-snapshot
On the Zarankiewicz problem for intersection hypergraphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00336-2openalex-snapshot
A lower bound on Voronoi diagram complexity
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00026-1openalex-snapshot
Dynamic motion planning in low obstacle density environments
inferred← citeshttps://doi.org/10.1080/02331934.2021.1939699openalex-snapshot
An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
inferred← citeshttps://doi.org/10.1090/conm/453/08794openalex-snapshot
State of the union (of geometric objects)
inferred← citeshttps://doi.org/10.1109/focs.2010.41openalex-snapshot
Improved Bounds for Geometric Permutations
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743511openalex-snapshot
On the combinatorial and topological complexity of a single cell
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959880openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181989openalex-snapshot
The partition technique for overlays of envelopes
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238227openalex-snapshot
On levels in arrangements of curves. II. A simple inequality and its consequences
inferred← citeshttps://doi.org/10.1137/110835918openalex-snapshot
Improved Bounds for Geometric Permutations
inferred← citeshttps://doi.org/10.1137/s0097539704444245openalex-snapshot
Output-Sensitive Construction of the Union of Triangles
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1145/1017460.1017461openalex-snapshot
Almost tight upper bounds for vertical decompositions in four dimensions
inferred← citeshttps://doi.org/10.1145/1064092.1064099openalex-snapshot
Almost tight bound for a single cell in an arrangement of convex polyhedra in R 3
inferred← citeshttps://doi.org/10.1145/1247069.1247110openalex-snapshot
On regular vertices on the union of planar objects
inferred← citeshttps://doi.org/10.1145/2462356.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2493132.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2794075openalex-snapshot
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
inferred← citeshttps://doi.org/10.1145/3406325.3451062openalex-snapshot
Stronger bounds for weak epsilon-nets in higher dimensions
inferred← citeshttps://doi.org/10.1145/380752.380815openalex-snapshot
A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D
inferred← citeshttps://doi.org/10.1145/513400.513428openalex-snapshot
Polyhedral Voronoi diagrams of polyhedra in three dimensions
inferred← citeshttps://doi.org/10.1145/513400.513437openalex-snapshot
Improved construction of vertical decompositions of three-dimensional arrangements
inferred← citeshttps://doi.org/10.48550/arxiv.1007.3244openalex-snapshot
Improved Bounds for Geometric Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.1410.3154openalex-snapshot
Epsilon-Nets for Halfspaces Revisited
inferred← citeshttps://doi.org/10.5555/982792.982852openalex-snapshot
Output-sensitive construction of the union of triangles
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.