TIP: Click on subject to list as thread! ANSI
echo: c_plusplus
to: HERMAN SCHONFELD
from: JAVIER KOHEN
date: 1997-04-23 19:40:00
subject: BSP trees

Javier Kohen to Schonfeld. Ensign:
At the stardate 16-Apr-97, Herman Schonfeld established a sub-space link to 
All refering to BSP trees.
 HS> Does anyone know which method is the best to use?
Nope :(
 HS> I need some suggestions as my rather large extensive games library is 
 HS> finished and I need to start on the 3d engine.
Congratulations!!! I guess you're going to make PD, ain't you?????
 HS> Also, does anyone know how to compute the fastest possible BSP tree 
 HS> without using a brute-force method. (Trial and error).
Casuality??? ;) It isn't possible, but you can *invent* a method that
*generally* gives the better results.
 HS> I've seen such node compilers in a map editor called Deep, if anyone has 
 HS> any idea on how this is acheived PLEASE message me back.
Get Dr. Dobb's Sourcebook #2400 (July/August 1995), there's a BSP
compiler there, and it's supposed how to use the compiled trees on the
next issue, but I don't have it... :( I'd like to get DDJ CDROM...
For info about my document server:
send a mail with "InfoMail" in the To: field at any of my Fido-like 
ddresses.
InterNet: jkohen@tough.com * FidoNet: 4:900/748.3 * Sk-NetWork: 200:201/201.2
                          -=[ PGP keyID 3423EAA9 ]=-
... Pick two: [1] Fast [2] Right [3] Cheap
--- Terminate 4.00/Pro
4:900/748.3)
---------------
* Origin: The King of The Ring BBS þ +54-1-OFF-LINE þ TLD 0 - 7

SOURCE: echomail via exec-pc

Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.