Subject: Re: Fast search of closest point on a fix 3D polyline
You showed me a good example.
So lets say that:
- the polyline represents the centerline of a path that your car should
- the input point is a point of the car or in front of the car (not too
In this scenario, situations like the one you described are not likely
to happen (I think).
Of course I need to have a robust solution meaning that in certain
unlucky cases (don't know what they are now) I HAVE to do safe search
without taking into account the position of the previous input point.
Dave Eberly ha scritto:
> > I guess that somehow I can do that taking into account that the
> > position of the input point does not change
> > too much between 2 searches and so the closest point of a new search is
> > likely to be close to the one of the previous search.
> Without any knowledge of specific properties of your
> polyline, the closeness of two input points does not
> help you. Consider the problem in 2D. The "polyline"
> is a circle (for simplicity of the argument) with center
> (0,0) and radius 1. The first input point is (e,0) for
> a small positive e. The closest point is (1,0). The
> second input point is (-e,0) but the closest point is
> now (-1,0), so searching near (1,0) will not quickly
> find the closest point.
> Dave Eberly
View All Messages in comp.graphics.algorithms
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
Copyright © 2006 WatermarkFactory.com. All Rights Reserved.