Mohan Kankanhalli

1995

  • Mohan Kankanhalli and Wm Randolph Franklin. Area and perimeter computation of the union of a set of iso-rectangles in parallel. J. Parallel Distrib. Comput., 27(2):107–117, June 1995. doi:https://doi.org/10.1006/jpdc.1995.1076.
    [abstract▼] [details] [full text] [BibTeX▼]

1994

  • Wm Randolph Franklin, Venkateshkumar Sivaswami, David Sun, Mohan Kankanhalli, and Chandrasekhar Narayanaswami. Calculating the area of overlaid polygons without constructing the overlay. Cartography and Geographic Information Systems, pages 81–89, April 1994.
    [details] [full text] [BibTeX▼]

1993

  • Wm Randolph Franklin and Mohan S. Kankanhalli. Volumes from overlaying 3-D triangulations in parallel. In D. Abel and B.C. Ooi, editors, Advances in Spatial Databases: Third Intl. Symp., SSD'93, volume 692 of Lecture Notes in Computer Science, pages 477–489. Springer-Verlag, June 1993.
    [details] [full text] [BibTeX▼]

1990

  • Wm Randolph Franklin, Narayanaswami Chandrasekhar, Mohan Kankanhalli, Varol Akman, and Peter YF Wu. Efficient geometric operations for CAD. In Michael J. Wozny, Joshua U. Turner, and K. Preiss, editors, Geometric Modeling for Product Engineering, pages 485–498. Elsevier Science Publishers B.V. (North-Holland), 1990.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin and Mohan Kankanhalli. Parallel object-space hidden surface removal. In Proceedings of SIGGRAPH'90, volume 24, 87–94. August 1990.
    [details] [full text] [BibTeX▼]
  • Mohan Kankanhalli. Techniques for Parallel Geometric Computations. PhD thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, October 1990.
    [details] [full text] [BibTeX▼]

1989

  • W. Randolph Franklin, Narayanaswami Chandrasekhar, and Mohan Kankanhalli. Parallel algorithms for geometric computing. In Final Program, SIAM Conference on Geometric Design, A17. 6–10 Nov 1989. (abstract only).
    [details] [BibTeX▼]
  • Wm Randolph Franklin, Mohan Kankanhalli, Chandrasekhar Narayanaswami, and Varol Akman. Efficient intersection calculations in large databases. In International Cartographic Association 14th World Conference, A–62 – A–63. Budapest, August 1989.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin, Mohan Kankanhalli, and Chandrasekhar Narayanaswami. Efficient primitive geometric operations on large databases. In Proceedings National Conference Challenge for the 1990s GIS Geographic Information Systems, 1247–1256. Ottawa, 27 February - 3 Mar 1989. Canadian Institute of Surveying and Mapping.
    [details] [full text] [BibTeX▼]
  • Varol Akman, Wm Randolph Franklin, Mohan Kankanhalli, and Chandrasekhar Narayanaswami. Geometric computing and the uniform grid data technique. Computer Aided Design, 21(7):410–420, 1989.
    [details] [full text] [BibTeX▼]
  • Wm Randolph Franklin, Chandrasekhar Narayanaswami, Mohan Kankanhalli, David Sun, Meng-Chu Zhou, and Peter YF Wu. Uniform grids: a technique for intersection detection on serial and parallel machines. In Proceedings of Auto Carto 9: Ninth International Symposium on Computer-Assisted Cartography, 100–109. Baltimore, Maryland, 2-7 April 1989.
    [details] [full text] [BibTeX▼]

1988

  • Wm Randolph Franklin, Narayanaswami Chandrasekhar., Mohan Kankanhalli, Manoj Seshan, and Varol Akman. Efficiency of uniform grids for intersection detection on serial and parallel machines. In Nadia Magnenat-Thalmann and D. Thalmann, editors, New Trends in Computer Graphics (Proc. Computer Graphics International'88), pages 288–297. Springer-Verlag, 1988.
    [details] [full text] [BibTeX▼]
  • WR Franklin, N. Chandrasekhar, M. Kankanhalli, and V. Akman. Fast intersection detection on serial and parallel machines using the uniform grid technique. 1988.
    [details] [full text] [BibTeX▼]
  • Mohan Kankanhalli. The uniform grid technique for fast line intersection on parallel machines. Master's thesis, Electrical,Computer, and Systems Eng. Dept., Rensselaer Polytechnic Institute, April 1988.
    [details] [BibTeX▼]