Xref: utzoo comp.graphics:8587 comp.databases:4196
Path: utzoo!attcan!uunet!aplcen!uakari.primate.wisc.edu!dogie.macc.wisc.edu!uwvax!astroatc!nicmad!burton
From: burton@nicmad.UUCP (Kevin Burton)
Newsgroups: comp.graphics,comp.databases
Subject: Graphics data structure info request
Keywords: data-structures,closest-point
Message-ID: <3905@nicmad.UUCP>
Date: 21 Nov 89 16:00:44 GMT
Organization: Nicolet Instrument Corp., Madison, WI
Lines: 13

I have been considering for quite some time an efficient data structure
for 2-D objects. By efficient I mean that the closest object or objects
to a given object can be found very quickly and objects can be added and
deleted easily. There are many structures that lend themselves very well
to points (eg binary trees, B-trees, Delaunay triangulation ...) but I
am unaware of any that explicitly deal with two dimensional objects. The
quad-tree has the general flavor of the structure I am looking for but
it seems too "raster" oriented to be adapted. Does anybody have any infor-
mation, opinions, advice  ?

If I get enough response I will post a summary. Thanks in advance !!

		Kevin Burton