On the public citation graph
Castles in the air revisited
0 signed · 53 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/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/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/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferredcites →https://doi.org/10.1007/bf02187785openalex-snapshot
The complexity of many cells in arrangements of planes and related problems
inferredcites →https://doi.org/10.1007/bf02189317openalex-snapshot
On the zone of a surface in a hyperplane arrangement
inferredcites →https://doi.org/10.1007/bf02189323openalex-snapshot
The upper envelope of voronoi surfaces and its applications
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
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/109648.109683openalex-snapshot
On the complexity of a single cell in certain arrangements of surfaces in 3-space (extended abstract)
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/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/3-540-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9openalex-snapshot
From Linear Operators to Computational Biology
inferred← citeshttps://doi.org/10.1007/978-1-4471-4282-9_6openalex-snapshot
Jack Schwartz and Robotics: The Roaring Eighties
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/978-3-642-41610-1_166-1openalex-snapshot
Complexity of Planning
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/bf02712877openalex-snapshot
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf02716803openalex-snapshot
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1007/pl00009319openalex-snapshot
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-003-0854-zopenalex-snapshot
Cell Complexities in Hyperplane Arrangements
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-020-00274-0openalex-snapshot
Union of Hypercubes and 3D Minkowski Sums with Random Sizes
inferred← citeshttps://doi.org/10.1007/s10514-025-10198-4openalex-snapshot
Shortest coordinated motions for square robots
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00065-8openalex-snapshot
Excess in arrangements of segments
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.2008.10.005openalex-snapshot
Smoothed analysis of probabilistic roadmaps
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/s0097-8493(02)00128-0openalex-snapshot
Polyhedral surface decomposition with applications
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00024-7openalex-snapshot
Strategies for polyhedral surface decomposition: An experimental study
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00030-8openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
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.1137/1.9781611972979.12openalex-snapshot
Smoothed Analysis of Probabilistic Roadmaps
inferred← citeshttps://doi.org/10.1137/s0097539793250755openalex-snapshot
The Union of Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539794266602openalex-snapshot
On Translational Motion Planning of a Convex Polyhedron in 3-Space
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/177424.177427openalex-snapshot
Vertical decompositions for triangles in 3-space
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/195058.195113openalex-snapshot
On lazy randomized incremental construction
inferred← citeshttps://doi.org/10.1145/220279.220301openalex-snapshot
A new technique for analyzing substructures in arrangements
inferred← citeshttps://doi.org/10.1145/237218.237230openalex-snapshot
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces and its applications
inferred← citeshttps://doi.org/10.1145/513400.513437openalex-snapshot
Improved construction of vertical decompositions of three-dimensional arrangements
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.