Xref: utzoo comp.graphics:8595 comp.databases:4206
Path: utzoo!attcan!uunet!lll-winken!decwrl!shelby!portia!hanauma!rick
From: rick@hanauma.stanford.edu (Richard Ottolini)
Newsgroups: comp.graphics,comp.databases
Subject: Re: Graphics data structure info request
Keywords: data-structures,closest-point
Message-ID: <6928@portia.Stanford.EDU>
Date: 22 Nov 89 05:37:28 GMT
References: <3905@nicmad.UUCP> <5482@cps3xx.UUCP>
Sender: USENET News System <news@Portia.stanford.edu>
Reply-To: rick@hanauma.UUCP (Richard Ottolini)
Followup-To: comp.graphics
Organization: Stanford University, Dept. of Geophysics
Lines: 9

>In article <3905@nicmad.UUCP> burton@nicmad.UUCP (Kevin Burton) writes:
>>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.
A related question.  Have there been attempts to coerce model data structures
into standard databases, e.g. normal relational form, to take advantage of
high speed database engines.  I remember some people doing this for AI
knowledge bases.  It wasn't very creative, but faster.