by Thx.
1. Fast algorithm to find all k-nearest points?
The O(n log n + kn log k)-time algorithm of Dickerson, Drysdale, and
Sack doesn't just find the k nearest neighbors of one point, it finds
the k nearest neighbors of ALL n points. You don't need to run it n
times, just once.
By the way, a more recent algorithm of Dickerson and Eppstein gets rid
of the log k factor in the running time.
(I posted a couple of references here a few weeks ago. I can repost
them if anoyone is interested.)
--
Jeff Erickson Center for Geometric Computing
http://www.cs.duke.edu/~jeffe
2. Enhancement request to PSP - setting print size without resampling or calculation
3. Fast algorithm to find the k-nearest points?
4. Animation: Ease In And Ease Out?
5. I need a fast algorithm to find intersect of 2 lines
6. Can anyone help a newbie with tranformations
7. I need help in finding if a point is near a line
9. fast method for finding points of intersection between a line and a circle
10. A fast algorithm to find all closed regions in an image
11. Fast algorithm to find filled circle
12. fast median finding algorithm
13. WANTED: Algorithm to find distance from line segment to given point