Recent Publications

• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs, (with H. Ramesh), SIAM Journal of Computing, vol 24, No. 3. 1995.
• New techniques for exact and approximate dynamic closest-point problems, (with M. Smid), SIAM Journal of Computing, August 1996. Also in 10th ACM Symposium on Computational Geometry, 1994.
• On the Complexity of approximating travelling salesman tours and minimum spanning trees, (with G. Das and M. Smid), Algorithmica, 1997. Also in Proc. of FST & TCS, India, LNCS Springer-Verlag, 1996.
• An Efficient Algorithm for Euclidean Shortest Paths amongst Polygonal Obstacles, (with S.N. Maheshwari and J.S.B. Mitchell). Discrete & Computational Geometry, 1997.  Also in 4th Annual A.C.M. Symposium on Computational Geometry, 1988,pp.172-182.  Some Improvements.
• Algorithms for Enumerating All Spanning Trees of Directed Graphs, (with H. Ramesh), to appear in Algorithmica. See also Proc. Workshop on Algorithms and Data Structures, Carleton University, Canada, Springer Verlag, August 1991.
• Efficiently constructing the visibility graph of a Simple Polygon with Obstacles, (with S.N.Maheshwari), (under revision) accepted for publication in SIAM Journal of Computing.
• Algorithms for Relative Neighborhood Graphs and Vornoi Diagrams in Simple Polygons, (With V. Sarin), 4th Canadian Conference on Computational Geometry, 1992.
• Dynamically Maintaining Maxima in 2-dimensions, To appear in SIAM Journal of Computing,   Preliminary version in 10th ACM Symposium on Computational Geometry, 1994.
• On Minmum 3-cuts and Approximating Graph Partitioning using Cut Trees, Proc. of 5th International IPCO Conference , LNCS Springer-Verlag, 1996.
• Dynamically maintaining shortest path trees in simple polygons, (with Tripurari Singh), Proc. of FST & TCS, India, LNCS, Springer-Verlag, 1996.
• Dynamic Binary Space Partitioning for hidden surface removal, (with A. Kumar, V. Kwatra, B. Singh), Proc. of ICGVIP 1998 (part B), New Delhi.
• Using Separating Planes between Objects for Dynamic Binary Space Partitioning, (with A. Kumar, V. Kwatra, B. Singh), Proc of International Conference on Visual Computing, Goa, India, Feb. 1999.
• Efficiently computing Geodesic Shortest Paths, in ACM Symposium on Theory of Computing, 1999.

 

 
 
 

3/6/1999