Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!news.cs.indiana.edu!msi.umn.edu!umeecs!zip!spencer From: spencer@eecs.umich.edu (Spencer W. Thomas) Newsgroups: comp.graphics Subject: Re: The closest point. Suggestions. Message-ID: Date: 22 Feb 91 07:06:27 GMT References: <1991Feb21.181630.3627@magnus.ircc.ohio-state.edu> <12449@helios.TAMU.EDU> <1991Feb22.005553.11729@cs.mcgill.ca> Sender: news@zip.eecs.umich.edu Distribution: na Organization: University of Michigan EECS Dept Lines: 6 In-Reply-To: baer@cs.mcgill.ca's message of Fri, 22 Feb 91 00:55:53 GMT Is it my imagination, or has nobody mentioned K-d trees? This is the "classic" way to solve this problem. -- =Spencer W. Thomas EECS Dept, U of Michigan, Ann Arbor, MI 48109 spencer@eecs.umich.edu 313-936-2616 (8-6 E[SD]T M-F) Brought to you by Super Global Mega Corp .com