Back to Results
First PageMeta Content
Viewing frustum / Frustum / Hidden surface determination / Collision detection / Minimum bounding box / Base / Octree / Scene graph / Clipping / Geometry / 3D computer graphics / Bounding volume


Optimized View Frustum Culling Algorithms for Bounding Boxes Ulf Assarsson and Tomas M¨oller
Add to Reading List

Document Date: 2006-12-05 05:43:09

Open Document

File Size: 318,49 KB

Share Result on Facebook

City

Springer-Verlag / Lausanne / /

Company

Hewlett Packard Company / Digital Plant Technologies AB / /

Country

Switzerland / /

Facility

Computer Engineering Chalmers University of Technology / Chalmers University of Technology / University College London / /

IndustryTerm

view frustum culling algorithms / graphics tools / car factory shop floor / existing view frustum culling algorithms / /

Organization

University College London / Department of Computer Science / Tomas M¨oller Department / Chalmers University of Technology / Department of Computer Engineering / /

Person

Mark Finch / Carolina Cruz-Neira / Norman Chin / Eric Haines / Eric A. Haines / Lars Bishop / Daniel J. Sandin / Michael Shantz / John R. Wallace / Thomas A. DeFanti / James H. Clark / Per Stenstr¨om / Tim van Hook / Don Hatch / Mel Slater / Lars Ostlund / Ned Greene / Dave Eberly / Ulf Assarsson / /

Position

manager of research and development / professor / Bishop / vp ni / vp positive / /

ProvinceOrState

New York / /

PublishedMedium

Computer Graphics / Communications of the ACM / /

Technology

main algorithm / RAM / Virtual Reality / caching / reviewing existing view frustum culling algorithms / 3 Frustum-AABB/OBB Intersection Our algorithms / VFC algorithms / /

URL

http /

SocialTag