G. D. Ramkumar

According to our database, G. D. Ramkumar authored at least 8 papers between 1996 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

Definitions of Managed Objects for iSNS (Internet Storage Name Service).

Kevin Gibbons, G. D. Ramkumar, Scott Kipp

RFC, July, 2007

2006

The Virtual Fabrics MIB.

Scott Kipp, G. D. Ramkumar, Keith McCloghrie

RFC, November, 2006

2003

Reporting Red - Blue Intersections between Two Sets of Connected Line Segments.

Julien Basch, Leonidas J. Guibas, G. D. Ramkumar

Algorithmica, 2003

1998

Tracings and their convolution: theory and applications.

G. D. Ramkumar

PhD thesis, 1998

Clustering Data Without Distance Functions.

G. D. Ramkumar, Arun N. Swami

IEEE Data Eng. Bull., 1998

1997

Algorithms for computing intersection and union of toleranced polygons with applications.

Frédéric Cazals, G. D. Ramkumar

Artif. Intell. Eng. Des. Anal. Manuf., 1997

Sweeping Lines and Line Segments with a Heap.

Julien Basch, Leonidas J. Guibas, G. D. Ramkumar

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

An Algorithm to Compute the Minkowski Sum Outer-face of Two Simple Polygons.

G. D. Ramkumar

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996