We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

The ever increasing size of data sets for scientific and medical visualization demands new isosurface volume rendering techniques to provide interactivity for the large datasets. The main obstacle to achieving interactivity is the computational bottleneck due to the dataset traversal and the corresponding amount of data transfer. We propose a novel GPU based dataset traversal technique that use...

We propose bi-directional face traversal algorithm 2FACE to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practicality of the best singledirection traversal algorithms with the worst case message complexity of O(|E|), where E is the number of network edges. We apply 2FACE to a variety of geometric routing algorithms. Our simulation ...

Strategic programming is a generic programming idiom for processing compound data such as terms or object structures. At the heart of the approach is the separation of two concerns: basic data-processing computations vs. traversal schemes. Actual traversals can be composed by passing the former as arguments to the latter. Traversal schemes can be defined by the strategic programmer using a comb...

We propose a high performance, GPU integrated, hardware ray tracing system. We present and make use of a new analysis of ray traversal in axis aligned bounding volume hierarchies. This analysis enables compact traversal hardware through the use of reduced precision arithmetic. We also propose a new cache based technique for scheduling ray traversal. With the addition of our compact fixed functi...

Traversal through object graphs is needed for many programming tasks. We show how this task may be specified declaratively at a high level of abstraction, and we give a simple and intuitive semantics for such specifications. The semantics, while intuitive, requires existential quantification over all object graphs to represent the fact that during traversal we have only local knowledge of the g...