Presentation is loading. Please wait.

Presentation is loading. Please wait.

An Efficient Central Path Algorithm For Virtual Navigation Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra Vision and Graphics Group, Department.

Published byMilton Norris Modified over 9 years ago

Similar presentations

Presentation on theme: "An Efficient Central Path Algorithm For Virtual Navigation Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra Vision and Graphics Group, Department."— Presentation transcript:

1 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.

2 Slide 2 Vision 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 as Virtual Surgery Automatic flight planning Computer games

3 Slide 3 Vision 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 that Lies completely inside the object Stays away from the boundary Has short length

4 Slide 4 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Background  Topological thinning  Pavlidis 1980, Paik et. al. 1998, Ge et. al. 1999, Bouix et. al. 2003, Telea & Vilanova 2003  Potential field based methods  Hong 1995, Deschamps & Cohen 2001  Distance field based methods  Bitter et. al. 2001, Wan et. al. 2001

5 Slide 5 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Distance From Boundary (DFB)  Distance of a point from the nearest boundary.  Different measures of distance – Euclidean, City-block, Champher.  Find a path such that sum of DFB field at all points on the path is maximized.

6 Slide 6 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Our Approach  Compute DFB field for a hierarchical subdivision as opposed to computing DFB for the entire object at the finest resolution.

7 Slide 7 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Hierarchical Subdivision  Enclose the object in a bounding box

8 Slide 8 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in  Subdivide the box into four equal parts Hierarchical Subdivision

9 Slide 9 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in  Keep subdividing the smaller parts till they are intersecting with the boundary of the object. Hierarchical Subdivision

10 Slide 10 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in  The smallest size boxes are the voxels with size 1.  Size of a block b (size(b)) is the number of voxels on its side. Hierarchical Subdivision

11 Slide 11 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in DFB Field Computation 1 2 4 8

12 Slide 12 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in DFB Field Computation  We compute the DFB for the cells by running a shortest path algorithm from the boundary to all the cells.

13 Slide 13 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Path Computation  We can find the path between any two points by running a shortest path algorithm on the graph formed by the cells.  An edge between blocks b 1 and b 2 in the graph is now given a weight w as W(b 1,b 2 )=1/dfb(b 1 )+1/dfb(b 2 )

14 Slide 14 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Path Computation  The algorithm returns a path in terms of connected blocks.

15 Slide 15 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Path Computation  A path is obtained by joining the centres of the blocks.

16 Slide 16 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Path Smoothening Corner CuttingSplines

17 Slide 17 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Result - Flythrough

18 Slide 18 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Result – Computational Complexity  It is proved that the number of voxels formed in the final subdivision are O(n+hk)  n : number of voxels on the boundary.  h : number of holes in the object.  k : number of levels of subdivision.  The running time is O((n+hk)log(n+hk))

19 Slide 19 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Result – Computational Complexity

20 Slide 20 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in The Progressive Algorithm  We usually do not need to compute the DFB for the entire object.  The extraneous volume for which the DFB is computed becomes a bottleneck at times.

21 Slide 21 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in The Progressive Algorithm  Subdivide the region into coarse grid.  Choose a Region Of Interest (ROI) which contains the source and destination.  Compute the path for this ROI.

22 Slide 22 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in The Progressive Algorithm  Grow the ROI and recompute the path.  Continue growing until the change in path length falls below a threshold.

23 Slide 23 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Results - Flythrough

24 Slide 24 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Results – Running Time

25 Slide 25 Vision and Graphics Group, Department of Computer Science and Engineering, IIT Delhi http://vglab.cse.iitd.ac.in Conclusion  DFB/Path computation is fast.  Paths of multiple resolutions.  Scaling the input does not adversely affect the computation time.  The subdivision grid also aids in View Culling while rendering.  Progressive extension makes it more efficient.

Download ppt "An Efficient Central Path Algorithm For Virtual Navigation Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra Vision and Graphics Group, Department."

Similar presentations

GR2 Advanced Computer Graphics AGR

GR2 Advanced Computer Graphics AGR
Chapter 4 Partition I. Covering and Dominating.

Chapter 4 Partition I. Covering and Dominating.
Topological Reasoning between Complex Regions in Databases with Frequent Updates Arif Khan & Markus Schneider Department of Computer and Information Science.

Topological Reasoning between Complex Regions in Databases with Frequent Updates Arif Khan & Markus Schneider Department of Computer and Information Science.
Lower Bound for Sparse Euclidean Spanners Presented by- Deepak Kumar Gupta(Y6154), Nandan Kumar Dubey(Y6279), Vishal Agrawal(Y6541)

Lower Bound for Sparse Euclidean Spanners Presented by- Deepak Kumar Gupta(Y6154), Nandan Kumar Dubey(Y6279), Vishal Agrawal(Y6541)
PARTITIONAL CLUSTERING

PARTITIONAL CLUSTERING
Approximations of points and polygonal chains

Approximations of points and polygonal chains
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.

 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.

Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
The Voronoi Diagram David Johnson. Voronoi Diagram Creates a roadmap that maximizes clearance –Can be difficult to compute –We saw an approximation in.

The Voronoi Diagram David Johnson. Voronoi Diagram Creates a roadmap that maximizes clearance –Can be difficult to compute –We saw an approximation in.
Piecewise Convex Contouring of Implicit Functions Tao Ju Scott Schaefer Joe Warren Computer Science Department Rice University.

Piecewise Convex Contouring of Implicit Functions Tao Ju Scott Schaefer Joe Warren Computer Science Department Rice University.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.

Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.

Atomic Volumes for Mesh Completion Joshua Podolak Szymon Rusinkiewicz Princeton University.
High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.

High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.
Lecture 6 Image Segmentation

Lecture 6 Image Segmentation
Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology.

Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology.
Professor Department of Computer Science & Engineering Indian Institute of Technology Delhi April 26, 2007 Visiting Professor Dayalbagh Educational Institute.

Professor Department of Computer Science & Engineering Indian Institute of Technology Delhi April 26, 2007 Visiting Professor Dayalbagh Educational Institute.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.

© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.

Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.

Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Optimized Subdivisions for Preprocessed Visibility Oliver Mattausch, Jiří Bittner, Peter Wonka, Michael Wimmer Institute of Computer Graphics and Algorithms.

Optimized Subdivisions for Preprocessed Visibility Oliver Mattausch, Jiří Bittner, Peter Wonka, Michael Wimmer Institute of Computer Graphics and Algorithms.

Similar presentations

Ads by Google