Path: utzoo!mnetor!tmsoft!torsqnt!news-server.csri.toronto.edu!bonnie.concordia.ca!uunet!mcsun!cernvax!chx400!chx400!bolek!metz
From: metz@bolek.iam.unibe.ch (Igor Metz)
Newsgroups: comp.theory
Subject: Re: Neighbor Finding in an Oct-Tree
Message-ID: <1991Feb16.134017.23542@chx400.switch.ch>
Date: 16 Feb 91 13:40:17 GMT
References: <18700@brahms.udel.edu>
Sender: news@chx400.switch.ch (USENET News System)
Reply-To: metz@iam.unibe.ch (Igor Metz)
Organization: SWITCH
Lines: 19

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