Laxmi Gewali received his Ph.D. from the University of Texas at Dallas in 1989. His research activities are in the design and analysis of efficient algorithms, exploring the visibility properties of polygons, and planning of collision-free paths. His papers have been published in (a) IEEE Journal on Robotics and Automation, (b) Computational Geometry: Theory and Applications, (c) ORSA Journal on Computing, (d) Information Sciences, (e) Pattern Recognition, (f) Parallel Processing Letters, (g) The Visual Computer, and (h) The Journal of Combinatorial Mathematics and Combinatorial Computing. His research projects have been funded by grants from NSF, Cray Research, Inc., US Department of Energy, Applied Research Initiative, and DoD. He served on the editorial board of IEEE Transactions on Computers. He has supervised (as committee Chair) more than 15 graduate students at UNLV. He is developing hands-on modules in JAVA/Python for exploring the proximity properties geometric network.