On the public citation graph

On lines missing polyhedral sets in 3-space

https://doi.org/10.1007/bf02574376
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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/1-84628-122-9_6openalex-snapshot
Combinatorial Topology
inferredcites →https://doi.org/10.1007/3-540-50728-0_44openalex-snapshot
Separating a polyhedron by one translation from a set of obstacles
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferredcites →https://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
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/bf02187804openalex-snapshot
Construction of ɛ-nets
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
inferredcites →https://doi.org/10.1007/bf02293043openalex-snapshot
Finding stabbing lines in 3-space
inferredcites →https://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/0925-7721(94)90016-7openalex-snapshot
On stabbling lines for convex polyhedra in 3D
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50018-9openalex-snapshot
Movable Separability of Sets
inferredcites →https://doi.org/10.1038/133967a0openalex-snapshot
Analytical Geometry of Three Dimensions
inferredcites →https://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
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/129712.129763openalex-snapshot
Ray shooting and parametric search
inferredcites →https://doi.org/10.1145/160985.160989openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/73393.73424openalex-snapshot
On planning assemblies
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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/11944836_11openalex-snapshot
Computing a Center-Transversal Line
inferred← citeshttps://doi.org/10.1007/s00454-005-1166-2openalex-snapshot
Lines Avoiding Unit Balls in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-006-1278-3openalex-snapshot
Lines Tangent to Four Triangles in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1007/s00454-012-9401-0openalex-snapshot
Lines Avoiding Balls in Three Dimensions Revisited
inferred← citeshttps://doi.org/10.1007/s00454-012-9414-8openalex-snapshot
On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00020-0openalex-snapshot
The union of moving polygonal pseudodiscs — Combinatorial bounds and applications
inferred← citeshttps://doi.org/10.1137/s0097539705447116openalex-snapshot
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
inferred← citeshttps://doi.org/10.1145/1810959.1810969openalex-snapshot
On the complexity of sets of free lines and line segments among balls in three dimensions
inferred← citeshttps://doi.org/10.1145/1810959.1810970openalex-snapshot
Lines avoiding balls in three dimensions revisited
inferred← citeshttps://doi.org/10.1145/508357.508362openalex-snapshot
The 3D visibility complex
inferred← citeshttps://doi.org/10.1145/997817.997826openalex-snapshot
On lines avoiding unit balls in three dimensions
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.