Calculating the Number of Tunnels

This report1 considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given.

• Type: Conference
• Year: 2008
• Where: CIARP
• Authors: Fajie Li, Reinhard Klette
• Keywords: Algorithm Proceeds Layer, CIARP 2008, Grid Cubes, Pattern Recognition, Report1 Considers 2-regions