Boost logo

Geometry :

Subject: Re: [geometry] rtree nearest polygon to a point
From: Millman, Mark (mark.millman_at_[hidden])
Date: 2014-12-01 20:10:46

I know this is self evident but in none of the Delaunay triangle libraries
I recently reviewed did they first test if the point fell in the previous
triangle. I had to modify one so that I could pass the index to the
previous triangle back to it. In my data set (LiDAR data with billions of
points) this improved my searches by a hundred-fold or more. It's very
common in spatial data for points to be relatively close to each other and
providing an optional "hint" index can speed things along.


On Mon, Dec 1, 2014 at 4:35 PM, Andrew Hundt <athundt_at_[hidden]> wrote:

> I'm considering using rtree to store a set of triangles (I will use
> polygons), and query for the closet triangle to a point. Are there any
> examples I could use to help with setting up the appropriate objects and
> types?
> Cheers!
> Andrew Hundt
> _______________________________________________
> Geometry mailing list
> Geometry_at_[hidden]

Mark Millman | Mizar, LLC
mark.millman_at_[hidden] |
(360) 220-3504
9908 Alegria Dr | Las Vegas, NV 89144
 The information contained in this communication may be confidential, is
intended only for the use of the recipient(s) named above, and may be
legally privileged. If the reader of this message is not the intended
recipient, you are hereby notified that any dissemination, distribution, or
copying of this communication, or any of its contents, is strictly
prohibited. If you have received this communication in error, please return
it to the sender immediately and delete the original message and any copy
of it from your computer system. If you have any questions concerning this
message, please contact the sender.

Geometry list run by mateusz at