678 search results - page 43 / 136 » Interactive ray tracing |
EGH
2010
Springer
13 years 5 months 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...
EGH
2009
Springer
13 years 5 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
: Fully abstract trace semantics for a core Java language. Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, ...
ICSE
2009
IEEE-ACM
13 years 5 months ago
2009
IEEE-ACM
traceMaintainer is a tool that supports an approach for maintaining post-requirements traceability relations after changes have been made to traced model elements. The update of t...
APLAS
2007
ACM
13 years 11 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...