🔒 Locked

Sorting points

Started by leoptimus Dec 6, 2005 at 10:06 PM 4 replies 750+ views

Original Post

Dec 6, 2005 at 10:06 PM

Hi! Anybody knows, if there is an structure for sorting points? The purpose is to collect a set of points, and search the nearest point to an arbitraty.

alvaro

1,980

alvaro

Dec 6, 2005 at 10:28 PM

You need to make your question more clearly. What is exactly the problem you are trying to solve?

leoptimus

Author

leoptimus

Dec 6, 2005 at 11:04 PM

Sorry!
In other words, is needed to mantain a set of points, that allows to do queries about which point is the nearest to the new one. Something like a hash-space, or a quad-tree.

Grain

104

Grain

Dec 6, 2005 at 11:49 PM

Use a tree, Octree/Quadtree or BSP

Aryabhatta

Dec 7, 2005 at 12:37 AM

Quote:
Original post by leoptimus
Sorry!
In other words, is needed to mantain a set of points, that allows to do queries about which point is the nearest to the new one. Something like a hash-space, or a quad-tree.

Let me try to rephrase your problem..

You are given a set of locations of fire stations in a City. Now given a building which has caught fire, locate the nearest fire station.

Am I guessing you right?

For this you can use something called as Voronoi Diagram.

Here is a link: Voronoi Diagram

leoptimus

Author

leoptimus

Dec 7, 2005 at 1:20 AM

Wow, that's it!
Thanks.

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.