On the public citation graph

Fast detection of polyhedral intersections

https://doi.org/10.1007/bfb0012765
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.
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.1016/0004-3702(76)90008-4openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/0031-3203(76)90020-0openalex-snapshot
The psychology of computer vision
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1109/sfcs.1980.18openalex-snapshot
Efficient uses of the past
inferredcites →https://doi.org/10.1145/800141.804662openalex-snapshot
Detection is easier than computation (Extended Abstract)
inferredcites →https://doi.org/10.2307/2283074openalex-snapshot
Linear Programming and Its Extensions.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rob.8101openalex-snapshot
Computation of a penetration measure between 3D convex polyhedral objects for collision detection
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1001openalex-snapshot
Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers
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-1-4613-1007-5_30openalex-snapshot
A Triangle Based Data Structure For Multiresolution Surface Representation
inferred← citeshttps://doi.org/10.1007/978-3-642-83492-9_26openalex-snapshot
Adjacency Finding Algorithms in a Variable-Resolution Boundary Model
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_3openalex-snapshot
Computational Geometry — Then and Now
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_4openalex-snapshot
Ruler, Compass and Computer
inferred← citeshttps://doi.org/10.1007/978-3-7091-7484-5_24openalex-snapshot
Hierarchical Back-Face Computation
inferred← citeshttps://doi.org/10.1007/bf00271644openalex-snapshot
Space sweep solves intersection of convex polyhedra
inferred← citeshttps://doi.org/10.1007/bf01190153openalex-snapshot
Computing the intersection-depth of polyhedra
inferred← citeshttps://doi.org/10.1007/bf01190849openalex-snapshot
Asymptotic speed-ups in constructive solid geometry
inferred← citeshttps://doi.org/10.1007/bf01840397openalex-snapshot
Computational geometry in a curved world
inferred← citeshttps://doi.org/10.1007/bf02187688openalex-snapshot
Computing circular separability
inferred← citeshttps://doi.org/10.1007/bfb0028837openalex-snapshot
Intersecting two polyhedra one of which is convex
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(85)90107-3openalex-snapshot
Finding extreme points in three dimensions and solving the post-office problem in the plane
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90042-1openalex-snapshot
Parallel construction of subdivision hierarchies
inferred← citeshttps://doi.org/10.1016/0141-1195(88)90014-9openalex-snapshot
A variable resolution graph based model of three dimensional objects
inferred← citeshttps://doi.org/10.1016/0167-8396(91)90001-ropenalex-snapshot
Detecting the intersection of convex objects in the plane
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90027-6openalex-snapshot
Efficient uses of the past
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90039-2openalex-snapshot
Computing the extreme distances between two convex polygons
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90005-2openalex-snapshot
Finding transversals for sets of simple geometric figures
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50007-4openalex-snapshot
Simple On-Line Algorithms for Convex Polygons
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.conbuildmat.2023.133570openalex-snapshot
Methods for the modelling of concrete mesostructures: a critical review
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.07.010openalex-snapshot
Approximating nearest neighbor among triangles in convex position
inferred← citeshttps://doi.org/10.1016/s0097-8493(99)00091-6openalex-snapshot
Hierarchical back-face computation
inferred← citeshttps://doi.org/10.1109/2945.468401openalex-snapshot
Visualization of geometric algorithms
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/robot.2000.845311openalex-snapshot
Fast distance queries with rectangular swept sphere volumes
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185410openalex-snapshot
Dynamic three-dimensional linear programming
inferred← citeshttps://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferred← citeshttps://doi.org/10.1145/142675.142687openalex-snapshot
Optimal parallel algorithms for triangulated simple polygons
inferred← citeshttps://doi.org/10.1145/160985.161151openalex-snapshot
Compatible tetrahedralizations
inferred← citeshttps://doi.org/10.1145/160985.161171openalex-snapshot
Building and using polyhedral hierarchies
inferred← citeshttps://doi.org/10.1145/1653771.1653795openalex-snapshot
Data structures and intersection algorithms for 3D spatial data types
inferred← citeshttps://doi.org/10.1145/177424.178100openalex-snapshot
GASP
inferred← citeshttps://doi.org/10.1145/220279.220308openalex-snapshot
Stabbing triangulations by lines in 3D
inferred← citeshttps://doi.org/10.1145/262839.263103openalex-snapshot
Back-face computation of polygon clusters
inferred← citeshttps://doi.org/10.1145/41958.41980openalex-snapshot
Parallel processing for efficient subdivision search
inferred← citeshttps://doi.org/10.1145/777792.777814openalex-snapshot
Curve-sensitive cuttings
inferred← citeshttps://doi.org/10.1287/ijoc.4.4.360openalex-snapshot
Dynamic Three-Dimensional Linear Programming
inferred← citeshttps://doi.org/10.3233/fi-1995-2244openalex-snapshot
COMPATIBLE TETRAHEDRALIZATIONS
inferred← citeshttps://doi.org/10.5555/314161.314199openalex-snapshot
An efficient algorithm for terrain simplification
inferred← citeshttps://doi.org/10.5555/951087.951117openalex-snapshot
GASP-a system for visualizing geometric algorithms
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.