Department of Mathematics Colloquium

University of Idaho

Fall 2011
Thursday,  October 20, 3:30-4:20pm, room TLC 030

Refreshments in Brink 305 at 3:00 p.m.

Finding Bottlenecks in Tunnels


Bala Krishnamoorthy 

Department of Mathematics

Washington State University


Sensor nodes are often used to guard 3D domains against intrusion by a foreign object. We have to compute the size of bottlenecks in any tunnels in the space being monitored. Coverage against intrusion is guaranteed if bottlenecks are not big enough to let the object go through. Similar calculations are employed in designing certain proteins, where access to the active site for the reacting small molecule is through tunnels. Other related applications arise in closing holes in cellphone coverage maps, and in computer aided design (CAD). This talk will present a low level introduction to the techniques from optimization and algebraic topology employed in solving such problems efficiently. Undergraduate students are encouraged to attend.