Xref: utzoo comp.graphics:5572 sci.math:6626
Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!elroy!gryphon!richard
From: richard@gryphon.COM (Richard Sexton)
Newsgroups: comp.graphics,sci.math
Subject: A question
Keywords: stuff
Message-ID: <15589@gryphon.COM>
Date: 8 May 89 18:54:23 GMT
Organization: Trailing Edge Technology, Redondo Beach, Ca.
Lines: 14

given two objects with m and n elements:
these can be intersected in n*m amount of time.
if one of them is represented by a BSP tree than the
intersection takes n*log(m) time....

if both are represented by BSP trees...is the time
log(n)*log(m)... and exactly how is this intersection 
accomplished?

please send email
-- 
``But if she wants it (particularly if she wants it bad), I am going to have
a hard time saying "no".'' - Ted Kaldis
richard@gryphon.COM  decwrl!gryphon!richard   gryphon!richard@elroy.jpl.NASA.GOV