An Efficient Central Path Algorithm for Virtual Navigation



Abstract

We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less pre-processing and produces paths of high visual fidelity. The algorithm enables computing paths at multiple resolutions. The algorithm is based on a distance from boundary field computed on a hierarchical subdivision of the free space inside the closed 3D object. We also present a progressive version of our algorithm based on a local search strategy thus giving navigable paths in a localized region of interest.

Results

Click on the thumbnails for larger images.

Path in the Ogre Path in the Ogre Path in the Heart Path in the Heart
Path inside the Ogre Mesh Flythrough Snapshot at the red arrow Path inside the Heart Mesh Flythrough Snapshot at the red arrow

Path in the 3-Holes Mesh Path in the 3-Holes Mesh Path in the Heart Path in the Heart
Path inside the 3-Holes Mesh Path inside the 3-Holes Mesh GUI snapshot: Cross-Section Selection Mode GUI snapshot: Flythrough Mode


Paper

An Efficient Central Path Algorithm for Virtual Navigation
Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra
Computer Graphics International 2004

Presentation

CGI 2004 Powerpoint Presentation

Videos

All videos are encoded using libavcodec (ISO standard MPEG4 - DivX, XVID compatible). Get the latest DivX codec here.
Human Heart Flythrough
Human Colon Flythrough (Visual Human Male Data)


Page last updated on Thursday, 27-Oct-2005 19:57:41 IST. pialpharhoalphagammaAT cse.iitd.ernet.in © Vision and Graphics Lab, Department of Computer Science & Engg., IIT Delhi, 2007
DCSE, IIT Delhi Valid HTML 4.0! Valid CSS!