198 search results - page 22 / 40 » Dynamic spatial approximation trees |
153
Voted
SMI
2006
IEEE
15 years 8 months ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
144
Voted
EGH
2010
Springer
15 years 19 days ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
115
Voted
ACRI
2006
Springer
15 years 8 months ago
2006
Springer
Two-dimensional cellular automata (CA) systems are widely used for modeling spatio-temporal dynamics of evolving populations. Conversely, the logistic equation is a 1-D model descr...
112
Voted
SI3D
2005
ACM
15 years 8 months ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
136
Voted
SI3D
2012
ACM
13 years 10 months ago
2012
ACM
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...