12. Computational Geometry

S. Arya and D. M. Mount: “Approximate Range Searching”

J. Basch, L. J. Guibas, G. D. Ramkumar: “Sweeping Lines and Line Segments with a Heap”

J. Bentley: “Multidimensional Divide-and-Conquer”

B. Chazelle and H. Edelsbrunner: “An Optimal Algorithm for Intersecting Line Segments in the Plane”




Tilbage til hovedsiden


Januar 2003 Keld Helsgaun