scientific article
From MaRDI portal
Publication:3957945
zbMath0494.68056MaRDI QIDQ3957945
David P. Dobkin, David G. Kirkpatrick
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (7)
Computing the intersection-depth to polyhedra ⋮ Asymptotic speed-ups in constructive solid geometry ⋮ A complete and efficient algorithm for the intersection of a general and a convex polyhedron ⋮ Parallel construction of subdivision hierarchies ⋮ Approximating nearest neighbor among triangles in convex position ⋮ Space sweep solves intersection of convex polyhedra ⋮ Finding extreme points in three dimensions and solving the post-office problem in the plane
This page was built for publication:
