An Efficient Central Path Algorithm For Virtual Navigation Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra Vision and Graphics Group, Department of Computer Science and Engineering, Indian Institute of Technology Delhi. Computer Graphics International 2004 Crete, Greece. 18 th June, 2004.
25
Embed
An Efficient Central Path Algorithm For Virtual Navigation
An Efficient Central Path Algorithm For Virtual Navigation. Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra Vision and Graphics Group, Department of Computer Science and Engineering, Indian Institute of Technology Delhi. Computer Graphics International 2004 Crete, Greece. - PowerPoint PPT Presentation
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
An Efficient Central Path Algorithm For Virtual Navigation
Vision and Graphics Group,Department of Computer Science and Engineering,
Indian Institute of Technology Delhi.
Computer Graphics International 2004Crete, Greece.
18th June, 2004.
Slide Slide 22Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in
Motivation
Navigation in virtual environments is needed in many applications such asVirtual SurgeryAutomatic flight planningComputer games
Slide Slide 33Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in
The Problem
Given a three dimensional closed object and two points in the interior, find a path connecting those two points thatLies completely inside the objectStays away from the boundaryHas short length
Slide Slide 44Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in