cristy@brahms.udel.edu ( Cristy) (02/13/91)
Given a cube in an oct-tree, I need to find all the neighbor cubes at the same level of decomposition that have a distance to the center of the cube less than some pre-determined amount. Does someone know of references, source code, or an algorithm that can efficiently generate the list of all the neighbor cubes? Please Email your answer. Thanks in advance. cristy@brahms.udel.edu
metz@bolek.iam.unibe.ch (Igor Metz) (02/16/91)
In article <18700@brahms.udel.edu>, cristy@brahms.udel.edu ( Cristy) writes: |> |> Given a cube in an oct-tree, I need to find all the neighbor cubes |> at the same level of decomposition that have a distance to the |> center of the cube less than some pre-determined amount. Does |> someone know of references, source code, or an algorithm that can |> efficiently generate the list of all the neighbor cubes? Did you read Hanan Samet: Neighbor finding in Images Represented by Octrees. Computer Vision, Graphics, and Image Processing, 46(3), 1989, p. 367-386. -- Igor Metz Institut fuer Informatik und angew. Mathematik, Universitaet Bern, Switzerland. domainNet: metz@iam.unibe.ch Phone: (0041) 31 65 49 90 ARPA: metz%iam.unibe.ch@relay.cs.net Fax: (0041) 31 65 39 65