On the public citation graph

Intersecting two polyhedra one of which is convex

https://doi.org/10.1007/bfb0028837
0 signed · 30 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/3-540-12689-9_105openalex-snapshot
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/978-3-642-69900-9_2openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf00271644openalex-snapshot
Space sweep solves intersection of convex polyhedra
inferredcites →https://doi.org/10.1007/bfb0012765openalex-snapshot
Fast detection of polyhedral intersections
inferredcites →https://doi.org/10.1016/0020-0190(85)90107-3openalex-snapshot
Finding extreme points in three dimensions and solving the post-office problem in the plane
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.22028/d291-26109openalex-snapshot
Space sweep solves intersection of two convex polyhedra elegantly

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nme.1229openalex-snapshot
The Arlequin method as a flexible engineering design tool
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_28openalex-snapshot
Elementary set operations with d-dimensional polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_258openalex-snapshot
A complete and efficient algorithm for the intersection of a general and a convex polyhedron
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_35openalex-snapshot
Wechselwirkung Zwischen der Computergrafik und der Theorie der Polyeder
inferred← citeshttps://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferred← citeshttps://doi.org/10.1007/bf01187036openalex-snapshot
Ray shooting on triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bfb0032047openalex-snapshot
Determining the separation of preprocessed polyhedra — A unified approach
inferred← citeshttps://doi.org/10.1007/bfb0036075openalex-snapshot
Collision detection algorithms for motion planning
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90120-2openalex-snapshot
The shortest watchtower and related problems for polyhedral terrains
inferred← citeshttps://doi.org/10.1090/dimacs/067/13openalex-snapshot
Mass properties of the union of millions of identical cubes
inferred← citeshttps://doi.org/10.1108/compel-03-2013-0091openalex-snapshot
Locally conservative projection methods: benchmarking and practical implementation
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/robot.1996.506915openalex-snapshot
Speeding up interference detection between polyhedra
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63539openalex-snapshot
An optimal algorithm for intersecting three-dimensional convex polyhedra
inferred← citeshttps://doi.org/10.1109/vrais.1998.658428openalex-snapshot
Rapid collision detection by dynamically aligned DOP-trees
inferred← citeshttps://doi.org/10.1115/detc97/cie-4306openalex-snapshot
Real-Time and Exact Collision Detection for Interactive Virtual Prototyping
inferred← citeshttps://doi.org/10.1137/21m1408245openalex-snapshot
On Ray Shooting for Triangles in 3-Space and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539792229404openalex-snapshot
On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
inferred← citeshttps://doi.org/10.1145/195058.195110openalex-snapshot
Computational geometry
inferred← citeshttps://doi.org/10.1145/73007.73044openalex-snapshot
Lines in space-combinators, algorithms and applications
inferred← citeshttps://doi.org/10.13140/rg.2.2.35200.84482openalex-snapshot
Virtual Reality in Assembly Simulation - Collision Detection, Simulation Algorithms, and Interaction Techniques
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.