Thread View: net.graphics
3 messages
3 total messages
Started by Dana Batali
Mon, 22 Sep 1986 01:51
bsp algorithm
Author: Dana Batali
Date: Mon, 22 Sep 1986 01:51
Date: Mon, 22 Sep 1986 01:51
5 lines
876 bytes
876 bytes
Can anyone give me some references on the BSP (binary space partition) algorithm for sorting 3d polygons ... has anyone implemented this algorithm .... from what little I've heard it seems like it would be useful in an interactive 3d graphics environment for speeding redraw.
Re: bsp algorithm
Author: falk
Date: Sat, 27 Sep 1986 23:02
Date: Sat, 27 Sep 1986 23:02
11 lines
846 bytes
846 bytes
> Can anyone give me some references on the BSP (binary space partition) > algorithm for sorting 3d polygons THE definitive reference is "Near Real-Time Shaded Display of Rigid Objects" by Henry Fuchs, Gergory D. Abram & Eric D. Grant. It's in the '83 Siggraphs proceedings. -- -ed falk, sun microsystems falk@sun.com sun!falk
Re: bsp algorithm
Author: FIUME Eugene
Date: Tue, 07 Oct 1986 20:47
Date: Tue, 07 Oct 1986 20:47
16 lines
1109 bytes
1109 bytes
In article <7708@sun.uucp> falk@sun.UUCP writes: >THE definitive reference is "Near Real-Time Shaded Display of Rigid >Objects" by Henry Fuchs, Gergory D. Abram & Eric D. Grant. It's in >the '83 Siggraphs proceedings. Well, in fairness, Bruce Naylor should be referred to when discussing BSP algorithms. See the SIGGRAPH 1980 paper by Fuchs, Kedem and Naylor, or Naylor's Ph.D. Thesis at U. of Texas at Dallas. --- Eugene Fiume Centre Universitaire d'Informatique mcvax!cernvax!cui!elf -- Eugene Fiume Centre Universitaire d'Informatique mcvax!cernvax!cui!elf (UUCP)
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads