Re: How to find closest point(s) around a specific point in point cloud?
- From: Willem <willem@xxxxxxxx>
- Date: Mon, 31 Mar 2008 15:03:16 +0000 (UTC)
Ed wrote:
) Wait. Why suggest a linear search of the entire array?
)
) what's wrong with this pseudocode algorithm?
) Given point (P,Q,R)
)
) number of points found = 0
) current distance = 0
) while number of points found < 10
) {
) searcharray=find all points in shell between current distance and
) current distance + 1
Find all points in shell ?
You make it sound as if it's easy, but I don't think it is.
In fact, I think this alone requires a linear search of the array.
) <snip>
)
) That should find things faster. Defining the "find all points in
) shell" function can be tricky since the array in rectilinear but the
) shell is circular.
Even if the shell were rectilinear it would be more than just 'tricky'.
How are you going to find all points that fall inside a given box without
looking at most (if not all) of the points ?
SaSW, Willem
--
Disclaimer: I am in no way responsible for any of the statements
made in the above text. For all I know I might be
drugged or something..
No I'm not paranoid. You all think I'm paranoid, don't you !
#EOT
.
- Follow-Ups:
- References:
- Prev by Date: Re: How to find closest point(s) around a specific point in point cloud?
- Next by Date: Re: What Refactorings Would you Like for C
- Previous by thread: Re: How to find closest point(s) around a specific point in point cloud?
- Next by thread: Re: How to find closest point(s) around a specific point in point cloud?
- Index(es):
Relevant Pages
|
