Subject: Re: Fast search of closest point on a fix 3D polyline
> - The polyline is a FIXED 3D polyline
> - The polyline tipically contains a few thousand of points
> - The search must be done many many times so it must be very very fast
That calls for a precomputed solution. I.e. a subdivision of 3D space
into regions sharing a closest point on the polyline. In other words,
you need the generalization of a Voronoi diagram for your polyline.
Hans-Bernhard Broeker (email@example.com)
Even if all the snow were burnt, ashes would remain.
View All Messages in comp.graphics.algorithms
Fast search of closest point on a fix 3D polyline =>
Copyright © 2006 WatermarkFactory.com. All Rights Reserved.