Re: Fortran to find nearest point from set in 3-D
- From: "Rob McDonald" <rob.a.mcdonald@xxxxxxxxx>
- Date: 15 Apr 2006 19:09:50 -0700
To search a 1-D list, the best you can do is use a sorted list and a
binary search. This is efficiently implemented (especially when you
need to add/remove points) using a binary tree.
Similarly, you need an extension of a binary tree to 3-D. So, you may
want to use an octree 2^3=8, or another generalization of a tree. Such
as a k-d tree, an R tree, R+ tree, k-b-d tree, etc.
I don't have any Fortran source laying around, but that should give you
some keywords to google from (n-dimensional binary tree or
multidimensional binary tree, as well as the algorithms above). At a
minimum, you'll find a pile of technical papers describing various
algorithms, this is a classic problem of computer science.
Rob
.
- References:
- Fortran to find nearest point from set in 3-D
- From: David . Paterson
- Fortran to find nearest point from set in 3-D
- Prev by Date: Fortran to find nearest point from set in 3-D
- Next by Date: Re: Fortran to find nearest point from set in 3-D
- Previous by thread: Fortran to find nearest point from set in 3-D
- Next by thread: Re: Fortran to find nearest point from set in 3-D
- Index(es):
Relevant Pages
|
