Algorithms in a Nutshell

(^320) | Chapter 11: Epilogue
problem, either. We ultimately resorted to statistically checking theresults of these
algorithms, rather than seeking absolute and definitive answers for all cases.
Table 11-6 summarizes computational geometry, covered in Chapter 9.
Table 11-6. Chapter 9: Computational geometry
Algorithm Best Average Worst Concepts Page
CONVEXHULLSCAN nn lognn logn Array, Greedy 261
LINESWEEP (n+k) log n (n+k) log n n^2 Priority Queue, Binary Tree 270, 271
NEARESTNEIGHBORQUERY logn lognn kd-tree, Recursion 283
RANGEQUERIES n1-1/d+rn1-1/d+rn kd-tree, Recursion 292
Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.
Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use