155 search results - page 8 / 31 » Dynamic Succinct Ordered Trees |
110
click to vote
SI3D
1995
ACM
15 years 1 months ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
ISPDC
2006
IEEE
15 years 3 months ago
2006
IEEE
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
ATVA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
GRAPHICSINTERFACE
2000
14 years 11 months ago
2000
Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...