Back to Results
First PageMeta Content
Hidden surface determination / Portal rendering / Computing / Frustum / Bounding volume / Z-buffering / Portals in fiction / Solid geometry / Clipping / 3D computer graphics / Potentially visible set / Viewing frustum


Portholes and Planes: Faster Dynamic Evaluation of Potentially Visible Sets Timothy Roden, Ian Parberry Department of Computer Science & Engineering, University of North Texas, P.O. Box, Denton, Texashttp:/
Add to Reading List

Document Date: 2011-05-12 16:09:31

Open Document

File Size: 172,75 KB

Share Result on Facebook

Facility

Building Walkthrough System / University of North Texas / /

IndustryTerm

visibility algorithms / dynamic occlusion culling algorithm / cross product / successive portal / store portals / portal systems / real-time applications / polygonal portal / architectural applications / computing the cross product / /

Organization

UC Berkeley CS Department / University of North Texas / Ian Parberry Department of Computer Science & Engineering / /

Person

Mark Finch / Chris Georges / Tim Round / Claudio Silva / Ian Parberry / Eric Lengyel / Eric Haines / John Airey / Tomas Moller / Lars Bishop / Jim Winget / Seth Teller / Ulf Assarsson / Michael Shantz / Jack Ritter / David Luebke / Ned Greene / Daniel Cohen-Or / Dave Eberly / /

Position

author / Bishop / /

ProgrammingLanguage

C++ / /

PublishedMedium

The Computer Journal / Computer Graphics / /

Region

North Texas / /

Technology

dynamic algorithm / artificial intelligence / 2 EXAMPLE EXECUTION Algorithm / dynamic occlusion culling algorithm / visibility algorithms / 3D Graphics / /

URL

http /

SocialTag