Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!sunic!tut!ra!vinsci From: vinsci@ra.abo.fi (Leonard Norrgard) Newsgroups: comp.sys.amiga.tech Subject: Re: 3D-graphics Message-ID: Date: 30 Nov 89 20:22:30 GMT References: <1470@cc.helsinki.fi> <18344@watdragon.waterloo.edu> <3440@convex.UUCP> <18765@watdragon.waterloo.edu> Sender: vinsci@ra.abo.fi Organization: Computer Centre, Abo Akademi University Lines: 14 In-reply-to: bmacintyre@watdragon.waterloo.edu's message of 28 Nov 89 23:28:39 GMT Look up the article on BSP-trees in the SIGGRAPH '83 proceedings, pp. 65-72, by H. Fuchs, G. D. Abram & E. D. Grant. Since the city to be drawed (hopefully :-) is static, BSP-trees should be a reasonable solution to your speed requirements. In short, the alghoritm allow you to redraw the scene (the city) from any arbitrary angle without recalculating hidden surfaces, but instead traverse the tree. -- Leonard PS. [To those of you waiting for the Sang info] The Sang transputer board info will come soon. I haven't found the time to type it in yet. DS. -- Leonard Norrgard, vinsci@ra.abo.fi, vinsci@finabo.bitnet, +358-21-6375762, EET.