In my research, I focus on problems in computational geometry, especially those motivated by applications in computer graphics, robotics, and geographic information systems. In my Ph.D. thesis, I studied the problem of hidden-surface removal. Here is a list of my publications, all of which you can download. All of them are available in gzipped PostScript format. If you would like a hard copy of any of these papers, please send me email.
- Sweeping Simple Polygons with a Chain of Guards
Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, and T. M. Murali.
In Proceedings of the 11th Annual ACMSIAM Symposium on Discrete Algorithms, 2000.
- Planning Robot Motion Strategies for Efficient Model Construction
Hector Hugo Gonzalez-Banos, Alon Efrat, Jean-Claude Latombe, Eric Mao, and T. M. Murali.
In Proceedings of the 9th International Symposium of Robotics Research.
- Efficient Hidden-Surface Removal in Theory and in Practice
Ph. D. Thesis, Department of Computer Science, Brown University, June 1998.
- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice
T. M. Murali, Pankaj K. Agarwal, and Jeffrey Scott Vitter.
In Proceedings of the 6th Annual European Symposium on Algorithms, August 1998.
- I/O-Efficient Algorithms for Contour Line Extraction and Planar Graph Blocking (the file is a little over 6MB in size when uncompressed)
Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, and Jeffrey Scott Vitter.
In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 1998.
- Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles
Pankaj K. Agarwal, T. M. Murali, and Jeffrey Scott Vitter.
Communication in Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, France, June 1997.
- Cylindrical Static and Kinetic Binary Space Partitions
Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, and Jeffrey Scott Vitter.
To appear in Computational Geometry: Theory and Applications.
A preliminary version appeared in the Proceedings of the 13th Annual ACM Symposium on Computational Geometry, Nice, France, June 1997.
- Consistent Solid and Boundary Representations from Arbitrary Polygonal Data
T. M. Murali and Thomas A. Funkhouser.
In Proceedings of the 1997 Symposium on Interactive 3D Graphics, Providence, Rhode Island, April 1997.
Since the size of this paper is more than 21MB when uncompressed, you can download it in three forms:
- The full paper (a little more than 21Mb when uncompressed),
- The paper without the colour page (200 Kb when uncompressed), or
- The colour page (nearly 21Mb when uncompressed).
- Binary Space Partitions for Fat Rectangles
Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, and Jeffrey Scott Vitter.
SIAM Journal on Computing, 29 (2000), 1422-1448.
Also available as Duke University Technical Report TR-CS-97-09, Department of Computer Science, Duke University. A preliminary version appeared in Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science, Burlington, Vermont, October 1996.
- The Object Complexity Model for Hidden-Surface Removal
Edward F. Grove, T. M. Murali. and Jeffrey Scott Vitter.
International Journal of Computational Geometry and Applications, 9 (1999), 207-217.
An old (but complete) version is available as Duke University Technical Report TR-CS-95-09, Department of Computer Science, Duke University. A preliminary version appeared in Proceedings of the Seventh Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995.