home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!tcsi.com!iat.holonet.net!news.cerf.net!usc!cs.utexas.edu!swrinde!gatech!mailer.cc.fsu.edu!sun13!dmi.usherb.ca
- From: jean-pierre.dussault@dmi.usherb.ca (Jean-Pierre Dussault)
- Newsgroups: comp.graphics.research
- Subject: Re: Help wanted with 3-D Voronoi/Delaunay Tessal
- Message-ID: <11823@sun13.scri.fsu.edu>
- Date: 26 Jan 93 21:35:54 GMT
- References: <11727@sun13.scri.fsu.edu>
- Sender: news@sun13.scri.fsu.edu
- Reply-To: jean-pierre.dussault@dmi.usherb.ca
- Organization: Universite de Sherbrooke -- Dept. De Mathematiques et D'Informatique
- Lines: 13
- Approved: murray@vs6.scri.fsu.edu
- Nntp-Posting-Host: tangara
- X-Submissions-To: graphics@scri1.scri.fsu.edu
- X-Administrivia-To: graphics-request@scri1.scri.fsu.edu
-
- I think that you cannot hope for better than O(n*n) for 3-D Voronoi diagrams.
- I think there is an example in some paper by Shamos showing that the diagram consists of
- O(n*n) elements
-
-
- Jean-Pierre Dussault
- D.M.I.
- Universite de Sherbrooke
-
-
- --
- Moderated by SCRI Vis <> Submissions to: graphics@scri1.scri.fsu.edu
- Guy, John R. Murray <> Administrivia to: graphics-request@scri1.scri.fsu.edu
-