scientific article; zbMATH DE number 3778747

MaRDI QIDQ3957945zbMATH OpenFDO

Authors David P. Dobkin, David Kirkpatrick

Publication date 1982

zbMATH Keywords

computational geometry

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(7)

• Finding extreme points in three dimensions and solving the post-office problem in the plane
• Parallel construction of subdivision hierarchies
• Asymptotic speed-ups in constructive solid geometry
• Computing the intersection-depth to polyhedra
• A complete and efficient algorithm for the intersection of a general and a convex polyhedron
• Space sweep solves intersection of convex polyhedra
• Approximating nearest neighbor among triangles in convex position

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3957945)