Home Products Download Order Contacts

comp.graphics.algorithms

Subject: Re: Fast search of closest point on a fix 3D polyline



I was thinking something similar...

My search algorithm generates a binary tree of bounding boxes
containing a portion of the polyline.
The leafs of that tree are bounding boxes containing just 1 segment
I was thinking to start the next search from the leaf bbox
corresponding to the closest segment of previous search and then
somehow move in the direction of the root of the tree to determine the
root of the smallest subtree containing the closest segment of the
current search and the previous search.

Now I'm wondering if this makes sense...


Reply


View All Messages in comp.graphics.algorithms

path:
Fast search of closest point on a fix 3D polyline =>Re: Fast search of closest point on a fix 3D polyline =>Re: Fast search of closest point on a fix 3D polyline =>Re: Fast search of closest point on a fix 3D polyline =>

Replies:

Copyright 2006 WatermarkFactory.com. All Rights Reserved.