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...
Byn Choi, Rakesh Komuravelli, Victor Lu, Hyojin Su...
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
Avneesh Sud, Erik Andersen, Sean Curtis, Ming C. L...
This video presents the working of a new algorithm/software called DelPSC that meshes piecewise smooth complexes in three dimensions with Delaunay simplices. Piecewise smooth comp...
A review of the facts about human stereo vision leads to the conclusion that the human stereo processing mechanism is very flexible in the presence of other depth cues. Stereopsis ...
People often recognize 3D objects by their boundary shape. Designing an algorithm for such a task is interesting and useful for retrieving objects from a shape database. In this pa...