W. Randolph Franklin

PDF version

Coordinates

ECSE Dept, 6026 JEC
Rensselaer Polytechnic Institute,
110 8th St,
Troy NY 12180
USA
+1 (518) 276-6077

Current position

Professor,
Electrical, Computer, and Systems Engineering Dept.
Rensselaer Polytechnic Institute
also affiliated with Computer Science Department
Citizenship: USA
Home page: http://wrfranklin.org

Contents

Contents (hide)

  1. 1. Education
  2. 2. Professional Career
  3. 3. Publications
  4. 4. Presentations
  5. 5. Synergistic Activities and Service
  6. 6. Grad Students
  7. 7. Teaching or Course Development
  8. 8. Hardware Used
  9. 9. Professional Memberships
  10. 10. Major Research Grants

1.  Education

  1. Passed first two Canadian Institute of Actuaries exams, scores: 10/10, 1973
  2. B.Sc. (Computer Science), University of Toronto, 1973
  3. A.M. (Applied Mathematics), Harvard University, 1975
  4. Ph.D. (Applied Mathematics), Harvard University, 1978, advisor: Harry R. Lewis, thesis: Combinatorics of Hidden Surface Algorithms
  5. 3 short courses from the Governmental Affairs Institute at Georgetown University, 2001-2.

2.  Professional Career

1978-now
Faculty member in the Electrical, Computer, and Systems Engineering Dept, RPI. Current rank: Professor.
2000-2002
Director, Numeric, Symbolic, and Geometric Computation Program, NSF/CISE/C-CR. Since renamed to the Graphics, Symbolic, and Geometric Computing Program, and then merged in the CISE reorg. Additional responsibility for some IGERT and ITR panels. Organized, with Ben Mann, MPS/DMS, two joint solicitations with DARPA/DSO (POC: Doug Cochran), called Computational Algorithms and Representations for Geometric Objects (CARGO), NSF 01-111 and NSF 02-155.
Sabbatical, 1992-1993
June-July 1993
Visiting scientist at the Institute of Systems Science, National University of Singapore.
April-June 1993
Visit to the Division of Information Technology, Commonwealth Scientific and Industrial Research Organization, Canberra, Australia.
Jan-Mar 1993
Visit to the Dept. de Science Géodésique, Université de Laval, Quebec City, Canada.
Oct-Dec 1992
Visit to the Dipartimento di Informatica e Scienze dell'Informazione, Università di Genova, Italy.
Aug 1991 and Aug 1992
Artificial Intelligence Division, US Army Topographic Engineering Center.
1986-present
joint appointment in the Computer Science Department, Rensselaer Polytechnic Institute.
1985-1986
Visiting Professor in the Computer Science Division, Electrical Engineering and Computer Science Department, University of California at Berkeley.
1973-1978
Research Asst, Lab for Computer Graphics and Analysis, Graduate School of Design, Harvard.
Summer 1973
Research Assistant in the Geography Department, Simon Fraser University (Canada).
Summers 1968-1972
Research Asst, Application Group, Computer Centre, U Ottawa (Canada).

3.  Publications

  1. 2008 Parallel ODETLAP for terrain compression and reconstruction. Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Randolph Franklin, Dan Tracy and Marcus V.A. Andrade. In Walid G. Aref et al, editor, 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2008), Irvine CA, 5--7 Nov 2008. (http://acmgis08.cs.umn.edu/). (paper, talk).
  2. Path Planning on a Compressed Terrain. Daniel M. Tracy, W. Randolph Franklin, Barbara Cutler , Franklin T. Luk, Marcus Andrade and Jared Stookey. In Walid G. Aref et al, editor, 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2008), Irvine CA, 5--7 Nov 2008. ((poster and fast forward presentation)http://acmgis08.cs.umn.edu/). (talk, poster).
  3. Evaluating Hydrology Preservation of Simplified Terrain Representations. Christopher Stuetzle, W. Randolph Franklin, Barbara Cutler, Jonathan Muckell, Marcus Andrade , Jared Stookey, Metin Inanc and Zhongyi Xie. In Walid G. Aref et al, editor, 16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS 2008), Irvine CA, 5--7 Nov 2008. ((PhD student poster and fast forward presentation)http://acmgis08.cs.umn.edu/). (talk, poster).
  4. Path Planning on Complex Terrain. Dan Tracy, W Randolph Franklin, Barb Cutler, Franklin Luk, Marcus Andrade and Jared Stookey. In 18th Fall Workshop on Computational Geometry (FWCG 2008), Rensselaer Polytechnic Institute, Troy NY USA, 31 Oct -- 1 Nov 2008. ((extended abstract, talk and poster)). (abstract, talk, poster).
  5. Operating on large geometric datasets. W. Randolph Franklin. In 18th Fall Workshop on Computational Geometry, Rensselaer Polytechnic Institute, Troy NY, 31 Oct -- 1 Nov 2008. (extended abstract). (abstract, talk).
  6. Progressive Transmission of Lossily Compressed Terrain. Zhongyi Xie, Marcus A. Andrade, W Randolph Franklin , Barbara Cutler, Metin Inanc, Jonathan Muckell and Daniel M. Tracy. In CLEI 2008 Conferencia Latinoamericana de Informática, Santa Fe, Argentina, 8--12 Sep 2008. (http://www.clei2008.org.ar/). (paper).
  7. Efficient viewshed computation on terrain in external memory. Marcus V. A. Andrade, Salles V. G. Magalh\~aes, Mirella A. Magalh\~aes, W. Randolph Franklin and Barbara M. Cutler. Geoinformatica, 2008. (paper). note = {(to appear)
  8. Slope Accuracy and Path Planning on Compressed Terrain. W. Randolph Franklin, Daniel M. Tracy , Marcus Andrade, Jonathan Muckell, Metin Inanc, Zhongyi Xie and Barbara Cutler. In Symposium on Spatial Data Handling, Montpelier FR, jun 2008. (paper).
  9. 2007 Approximating Terrain with Over-Determined Laplacian PDEs. Zhongyi Xie, Marcus A. Andrade, W. Randolph Franklin, Barbara Cutler, Metin Inanc, Daniel M. Tracy and Jonathan Muckell. In 17th Fall Workshop on Computational Geometry, IBM TJ Watson Research Center, Hawthorne NY, 2--3 Nov 2007. (poster session, no formal proceedings). (abstract, poster).
  10. Drainage Network and Watershed Reconstruction on Simplified Terrain. Jonathan Muckell, Marcus Andrade, W. Randolph Franklin, Barbara Cutler, Metin Inanc, Zhongyi Xie and Daniel M. Tracy. In 17th Fall Workshop on Computational Geometry, IBM TJ Watson Research Center, Hawthorne NY, 2--3 Nov 2007. (poster session, no formal proceedings). (abstract, poster).
  11. Smugglers and Border Guards -- The GeoStar Project at RPI. W Randolph Franklin, Metin Inanc, Zhongyi Xie, Daniel M Tracy, Barbara Cutler, Marcus V A Andrade and Franklin Luk. In 15th ACM International Symposium on Advances in Geographic Information Systems (ACM GIS 2007), Seattle, WA, USA, Nov 2007. (paper, talk).
  12. Multiple observer siting and path planning on lossily compressed terrain. Daniel M Tracy, W. Randolph Franklin, Barbara Cutler , Marcus A Andrade, Franklin T Luk, Metin Inanc and Zhongyi Xie. In Proceedings of SPIE Vol. 6697 Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, San Diego CA. International Society for Optical Engineering, 27 August 2007. (paper 6697-16). (paper).
  13. Surface compression using over-determined Laplacian approximation. Zhongyi Xie, W. Randolph Franklin, Barbara Cutler , Marcus A Andrade, Metin Inanc and Daniel M Tracy. In Proceedings of SPIE Vol. 6697 Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, San Diego CA. International Society for Optical Engineering, 27 August 2007. (paper 6697-15). (paper).
  14. 2006 Tradeoffs when multiple observer siting on large terrain cells. W. Randolph Franklin and Christian Vogt. In Progress in spatial data handling: 12th international symposium on spatial data handling, pages 845-861.Springer, , 2006. (ISBN 978-3-540-35588-5). (paper, talk).
  15. Two Novel Surface Representation Techniques. W. Randolph Franklin, Metin Inanc and Zhongyi Xie. In Autocarto 2006, Vancouver Washington. Cartography and Geographic Information Society, 25-28 June 2006. (paper).
  16. Connected Components on 1000x1000x1000 Datasets. W. Randolph Franklin and E. Landis (extended abstract). In 16th Fall Workshop in Computational Geometry, Smith College, Northampton, MA, 10-11 Nov 2006. (abstract, talk).
  17. Cracking, damage and fracture in four dimensions. E. N. Landis, T. Zhang, E. N. Nagy, G. Nagy and W. R. Franklin. Materials and Structures, online date: 13 July 2006. (URL)
  18. Terrain Representation Using Tessellation of Irregular Planar Tiles (extended abstract). Metin Inanc and W Randolph Franklin. In 16th Fall Workshop on Computational Geometry, Smith College, Northampton MA, 10-11 Nov 2006. (abstract, poster).
  19. Multiple Observer Siting on a Compressed Terrain (extended abstract). Daniel Tracy, W Randolph Franklin and Franklin Luk. In 16th Fall Workshop on Computational Geometry, Smith College, Northampton MA, 10-11 Nov 2006. (abstract, poster).
  20. Compressing terrain datasets using segmentation. W. Randolph Franklin and Metin Inanc. In Proceedings of SPIE Vol. 6313 Advanced Architectures, and Implementations XVI, San Diego CA. International Society for Optical Engineering, 15-16 August 2006. (6313-17, Session 4). (paper).
  21. 2005 Augmenting Grid-based Contours to Improve Thin Plate DEM Generation. Michael B. Gousie and Wm. Randolph Franklin. Photogrammetric Engineering \& Remote Sensing, 71(1):69-79, 2005. (paper). ]
  22. Nearpt3 --- Nearest Point Query on 184M Points in $E^3$ with a Uniform Grid. W. Randolph Franklin. In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG'05), pages 239-242, Windsor, Ontario, {10-12 August} 2005. (paper (current version), paper, talk).
  23. Mass Properties of the Union of Millions of Identical Cubes. Wm. Randolph Franklin. In Geometric and Algorithmic Aspects of Computer Aided Design and Manufacturing, {DIMACS} Series in Discrete Mathematics and Theoretical Computer Science, pages 329-345.American Mathematical Society, , 2005. (paper, talk).
  24. 2004 Efficient Observer Siting on Large Terrain Cells (extended abstract). W. Randolph Franklin and Christian Vogt. In GIScience 2004: Third International Conference on Geographic Information Science, U Maryland College Park, 20--23 Oct 2004. (paper, talk).
  25. Nearpt3 --- Nearest Point Query in $E^3$ with a Uniform Grid. W. Randolph Franklin. In 14th Annual Fall Workshop on Computational Geometry, {MIT}, 20 {Nov} 2004.
  26. Analysis of Mass Properties of the Union of Millions of Polygedra. W. Randolph Franklin. In Geometric Modeling and Computing: Seattle 2003, pages 189-202.Nashboro Press, Brentwood TN, , 2004. (paper).
  27. Multiple Observer Siting on Terrain with Intervisibility or Lo-Res Data. W. Randolph Franklin and Christian Vogt. In XXth Congress, International Society for Photogrammetry and Remote Sensing, Istanbul, 12-23 July 2004. (paper, poster).
  28. 2003 Constructing a DEM from Grid-based Data by Computing Intermediate Contours. Michael Gousie and W. Randolph Franklin. In Erik Hoel and Phillippe Rigaux, editor, GIS 2003: Proceedings of the Eleventh ACM International Symposium on Advances in Geographic Information Systems, pages 71-77, New Orleans, 2003. (paper).
  29. 3D Analysis of Tomographic Images. Edwin Nagy, Tong Zhang, Wm Randolph Franklin, George Nagy and E Landis. In 16th ASCE Engineering Mechanics Conference, U Washington, Seattle, 16-18 July 2003. (electronic proceedings). (paper).
  30. 2002 Siting Observers on Terrain. W. Randolph Franklin. In Dianne Richardson and Peter van Oosterom, editor, Advances in Spatial Data Handling: 10th International Symposium on Spatial Data Handling, pages 109-120, 2002. (paper).
  31. 2001 Automatic Extraction of Topographic Features UsingAdaptive Triangular Meshes. H Pedrini, WR Schwartz and WR Franklin. In 2001 International Conference on Image Processing (ICIP-2001), Thessaloniki, Greece, 7-10 October 2001. (http://icip01.ics.forth.gr/).
  32. Volume and Surface Area Distributions of Cracks in Concrete. G Nagy, T Zhang, WR Franklin, E Landis, E Nagy and D Keane. In Visual Form 2001: 4th International Workshop on Visual Form {IWVF4}Springer-Verlag Heidelberg, , 28-30 May 2001. (paper, poster).
  33. 2000 Applications of Analytical Cartography. W. Randolph Franklin. Cartography and Geographic Information Systems, 27(3):225-237, 2000. (paper).
  34. Applications of Geometry. W. Randolph Franklin. In Handbook of Discrete and Combinatorial Mathematics, pages 867-888.{CRC} Press, , 2000.
  35. Analytical Cartography. Harold Moellering, Keith Clarke, Robert Cromley, Wm Randolph Franklin, Alan Saalfeld, Jon Kimerling and Marc Armstrong. UCGIS Emerging Research Themes in GIScience (white paper), Dec 2000. ((UCGIS = University Consortium for Geographic Information Science)).
  36. Approximating Visibility. W. Randolph Franklin. In GIScience 2000, Savannah, Georgia, USA, 30 Oct 2000. (paper).
  37. 1999 Terrain Elevation Data Structure Operations. W. Randolph Franklin and Michael Gousie. In International Cartographic Association Proceedings, Ottawa, Aug 1999. (URL) (paper).
  38. 1998 Converting Elevation Contours to a Grid. Michael Gousie and W. Randolph Franklin. In Eighth International Symposium on Spatial Data Handling, pages 647-656, Vancouver BC Canada, jul 1998. (paper, talk).
  39. 1996 Lossy Compression of Elevation Data. W. Randolph Franklin and Amir Said. In Seventh International Symposium on Spatial Data Handling, Delft, Aug 1996. (paper).
  40. 1995 Compressing Elevation Data. W. Randolph Franklin. In Fourth International Symposium on Large Spatial Databases --- SSD '95, 6--9 Aug 1995. (paper).
  41. Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel. Mohan Kankanhalli and Wm Randolph Franklin. J. Parallel Distrib. Comput., 27:107-117, 1995.
  42. 1994 Higher isn't Necessarily Better: Visibility Algorithms andExperiments. Wm Randolph Franklin and Clark Ray. In Thomas C. Waugh and Richard G. Healey, editor, Advances in GIS Research: Sixth International Symposium on Spatial Data Handling, pages 751-770, Edinburgh, 5--9 Sept 1994. (paper).
  43. 17) How do I find if a point lies within a polygon?. W. Randolph Franklin. In comp.graphics.algorithms Frequently Asked Questions ({FAQ})\url{http://www.cis.ohio-state.edu/hypertext/faq/usenet/graphics/algorithms-faq/faq.html}, , 1994.
  44. Calculating the Area of Overlaid Polygons Without Constructing the Overlay. Wm Randolph Franklin, Venkateshkumar Sivaswami, David Sun, Mohan Kankanhalli and Chandrasekhar Narayanaswami. Cartography and Geographic Information Systems, Apr 1994. (paper).
  45. 1993 Volumes From Overlaying 3-D Triangulations in Parallel. Wm Randolph Franklin and Mohan S. Kankanhalli. In Advances in Spatial Databases: Third Intl. Symp., SSD'93, pages 477-489.Springer-Verlag, , jun 1993. (paper).
  46. On the Possible Role(s) of a ``University Consortium for Geographic Information and Analysis (UCGIA)''. UCGIA Steering Committee. In Proceedings, American Congress on Surveying and Mapping / American Society for Photogrammetry and Remote Sensing '93, New Orleans, 1993.
  47. 1992 Map Overlay Area Animation and Parallel Simulation. Wm Randolph Franklin. In David H. Douglas, editor, Proceedings, SORSA'92 Symposium and Workshop, pages 200-203, July 28--August 2 1992.
  48. Tutorial on Curve Fitting for GIS. Wm Randolph Franklin. In David H. Douglas, editor, Proceedings, SORSA'92 Symposium and Workshop, July 28--August 2 1992. (paper).
  49. Boolean Combinations of Polygons in Parallel. Chandrasekhar Narayanaswami and Wm Randolph Franklin. In Proceedings of the 1992 International Conference on Parallel Processing, aug 1992. (paper).
  50. Edge Intersection on the Hypercube Computer. Chandrasekhar Narayanaswami and Wm Randolph Franklin. Information Processing Letters, 41(5):257-262, 3 April 1992. (paper).
  51. 1991 Computer Systems and Low Level Data Structures for GIS. Wm Randolph Franklin. In GIS: Principles and Practice, pages 215-225.Longman Higher Education and Reference, , 1991. (paper).
  52. Determination of Mass Properties of Polygonal CSG Objects in Parallel. Chandrasekhar Narayanaswami and Wm Randolph Franklin. In Proc. Symposium on Solid Modeling Foundations and CAD/CAM Applications, pages 279-288.ACM/SIGGRAPH, , 5--7 June 1991. (paper).
  53. Sensitivity Analysis of Expert Systems. W. Randolph Franklin, Rahul Bansal and Elissa Gilbert. In Validating and Verifying Knowledge-Based Systems, pages 347-355.IEEE Computer Society Press, , 1991.
  54. Implementing a Topological Picturebook. Varol Akman, A. Arslan, W. Randolph Franklin and P. J. W. ten {H}agen. In Proc. 13th IMACS World Congress on Computation and Applied Maths, Dublin, 1991.
  55. 1990 Calculating Map Overlay Polygon' Areas Without Explicitly Calculating the Polygons --- Implementation. Wm Randolph Franklin. In 4th International Symposium on Spatial Data Handling, pages 151-160, Z{\"u}rich, 23-27 July 1990.
  56. Efficient Geometric Operations for CAD. Wm Randolph Franklin, Narayanaswami Chandrasekhar, Mohan Kankanhalli, Varol Akman and Peter YF Wu. In Geometric Modeling for Product Engineering, pages 485-498.Elsevier Science Publishers B.V. (North-Holland), , 1990. (paper).
  57. Parallel Object-Space Hidden Surface Removal. Wm Randolph Franklin and Mohan Kankanhalli. In Proceedings of SIGGRAPH'90, pages 87-94, aug 1990. (paper).
  58. OVERPROP --- Calculating Areas of Map Overlay Polygons without Calculating the Overlay. Wm Randolph Franklin and Venkatesh Sivaswami. In Second National Conference on Geographic Information Systems, pages 1646-1654, Ottawa, 5-8 March 1990.
  59. A Logic Programming Approach to Cartographic Map Overlay. Peter YF Wu and Wm Randolph Franklin. Canadian Computational Intelligence Journal, 6(2):61-70, 1990. (paper).
  60. Mental Models of Force and Motion. Varol Akman, D. Ede, W. Randolph Franklin and P. J. W. ten {H}agen. In Okyay Kaynak, editor, Proc. IEEE International Workshop on Intelligent Motion Control, pages 153-158, Bogazici University, Istanbul, 20-22 August 1990.
  61. 1989 Representing Objects as Rays, or How to Pile up an Octree?. Varol Akman and Wm Randolph Franklin. Computers and Graphics, 13(3):373-379, 1989. (paper).
  62. Ray Representation for K-d Trees. Varol Akman and Wm Randolph Franklin. Pattern Recognition Letters, nov 1989. (paper).
  63. Geometric Computing and the Uniform Grid Data Technique. Varol Akman, Wm Randolph Franklin, Mohan Kankanhalli and Chandrasekhar Narayanaswami. Computer Aided Design, 21(7):410-420, 1989. (paper).
  64. Efficient Intersection Calculations in Large Databases. Wm Randolph Franklin, Mohan Kankanhalli, Chandrasekhar Narayanaswami and Varol Akman. In International Cartographic Association 14th World Conference, pages A-62 - A-63, Budapest, aug 1989. (paper).
  65. Efficient Primitive Geometric Operations on Large Databases. Wm Randolph Franklin, Mohan Kankanhalli and Chandrasekhar Narayanaswami. In Proceedings National Conference Challenge for the 1990s GIS Geographic Information Systems, pages 1247-1256, Ottawa. Canadian Institute of Surveying and Mapping, 27 February - 3 March 1989.
  66. Uniform Grids: A Technique for Intersection Detection on Serial and Parallel Machines. Wm Randolph Franklin, Chandrasekhar Narayanaswami, Mohan Kankanhalli, David Sun, Meng-Chu Zhou and Peter YF Wu. In Proceedings of Auto Carto 9: Ninth International Symposium on Computer-Assisted Cartography, pages 100-109, Baltimore, Maryland, 2-7 April 1989. (paper).
  67. Parallel Algorithms for Geometric Computing. W. Randolph Franklin, Narayanaswami Chandrasekhar and Mohan Kankanhalli. In Final Program, SIAM Conference on Geometric Design, page A17, 6--10 Nov 1989. ((abstract only)).
  68. Design Systems with Common Sense. Varol Akman, W. Randolph Franklin and B. Veth. In PJW ten Hagen and P. Veerkamp, editor, Proceedings of the Third Eurographics Workshop on Intelligent CAD Systems: Practical Experience and Evaluation, pages 317-322, Texel, the Netherlands, {3-7} # apr 1989.
  69. 1988 A linear time exact hidden surface algorithm. Wm Randolph Franklin. In Tutorial: Computer Graphics: Image Synthesis, pages 218-224., 1988.
  70. Adaptive Grid for polyhedral visibility in object space, an implementation. Wm Randolph Franklin and Varol Akman. Computer Journal, 31(1):56-60, feb 1988. (paper).
  71. Efficiency of uniform grids for intersection detection on serial and parallel machines. Wm Randolph Franklin , Narayanaswami Chandrasekhar., Mohan Kankanhalli, Manoj Seshan and Varol Akman. In New Trends in Computer Graphics (Proc. Computer Graphics International'88), pages 288-297.Springer-Verlag, , 1988. (paper).
  72. Debugging and Tracing Expert Systems. W. Randolph Franklin, Rahul Bansal, Elissa Gilbert and Gautam Shroff. In Benn R. Konsynski, editor, Proceeding of the 21st International Hawaii International Conference on System Sciences, pages 159-167, Kona, Hawaii, Jan 1988. (paper).
  73. 1987 Polygon properties calculated from the vertex neighborhoods. Wm Randolph Franklin. In Proc. 3rd Annu. ACM Sympos. Comput. Geom., pages 110-118, 1987. (paper).
  74. A simple and efficient haloed line algorithm for hidden line elimination. Wm Randolph Franklin and Varol Akman. Computer Graphics Forum, 6(2):103-109, may 1987. (paper).
  75. A Polygon Overlay System in Prolog. Wm Randolph Franklin and Peter YF Wu. In Autocarto 8: Proceedings of the Eighth International Symposium on Computer-Assisted Cartography, pages 97-106, Baltimore, Maryland, 29 March -- 3 April 1987.
  76. A workbench to compute unobstructed shortest paths in three-space. Wm Randolph Franklin and V. Akman. In Proc. 1st Internat. Conf. Indust. Applied Math., pages 1-38, Paris, France, 1987.
  77. 1986 On the Question `Is $\sum_1^n \sqrta_i\le L ?$'. Varol Akman and Wm Randolph Franklin. EATCS Bulletin, feb 1986. (paper).
  78. Reconstructing Visible Regions From Visible Segments. Wm Randolph Franklin and Varol Akman. BIT, 26:430-441, 1986. (paper).
  79. Experiences with Using Prolog for Geometry. Wm Randolph Franklin, Margaret Nichols, Sumitro Samaddar and Peter YF Wu. In Proceedings of Graphics Interface'86, Vision Interface'86, pages 26-31, Vancouver, BC, 26--30 May 1986.
  80. Geometry in Prolog. Wm Randolph Franklin, Peter Y.F. Wu, Sumitro Samaddar and Margaret Nichols. In Tosiyasu Kunii, editor, Advanced Computer Graphics, Proceedings of Computer Graphics Tokyo 86, pages 71-78, apr 1986.
  81. Prolog and Geometry Projects. Wm Randolph Franklin, Peter Y.F. Wu, Sumitro Samaddar and Margaret Nichols. IEEE Computer Graphics and Applications, nov 1986. (paper).
  82. Problems with Raster Graphics Algorithms. Wm Randolph Franklin. In Data Structures for Raster Graphics, proceedings of a Workshop held at Steensel, The Netherlands, June 24--28, 1985Springer-Verlag EurographicSeminars, , 1986. (paper).
  83. Locus Techniques for Shortest Path Problems in Robotics. Varol Akman and W. Randolph Franklin. In IFAC Symposium on Robot Control (SYSROCO'85), 1986.
  84. 1985 Problems with Raster Graphics Algorithms. Wm Randolph Franklin. In Data Structures for Raster Graphics, proceedings of a Workshop held at Steensel, The Netherlands, June 24--28, 1985Springer-Verlag EurographicSeminars, , 1986. (paper).
  85. Computational Geometry in Prolog. Wm Randolph Franklin. In Proceedings of the {NATO} Advanced Study Institute on Fundamental Algorithms for Computer Graphics, pages 737-749.Springer-Verlag, , 30 March -- 12 April 1985.
  86. Building an Octree from a Set of Parallelepipeds. Wm Randolph Franklin and Varol Akman. IEEE Computer Graphics and Applications, 5(10):58-64, oct 1985. (paper).
  87. Octree Data Structures and Creation by Stacking. Wm Randolph Franklin and Varol Akman. In Computer Generated Images, State of the ArtSpringer-Verlag, , 1985.
  88. Shortest Paths in 3-Space, Voronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues. Wm Randolph Franklin and Varol Akman. In Proceedings of the {NATO} Advanced Study Institute on Fundamental Algorithms for Computer Graphics, pages 895-917.Springer-Verlag, , 30 March -- 12 April 1985. (paper).
  89. Voronoi diagrams with barriers and on polyhedra for minimal path planning. Wm Randolph Franklin, Varol Akman and Colin Verrilli. Visual Comput., 1(2):133-150, oct 1985. (paper).
  90. Building an Octree from a Set of Parallelepipeds. Wm Randolph Franklin and Varol Akman. In Graphics Interface, 1985. (paper).
  91. Partitioning the Space to Calculate Shortest Paths to any Goal Around Polyhedral Obstacles. Varol Akman and W. Randolph Franklin. In Proceedings of ROBEXS'85, the First Annual Workshop on Robotics and Expert Systems, NASA/Johnson Space Center, 27--28 June 1985. (paper).
  92. 1984 Adaptive Grids for geometric operations. Wm Randolph Franklin. Cartographica, 21(2--3):161-167, Summer -- Autumn 1984. (monograph 32--33).
  93. Cartographic Errors Symptomatic of Underlying Algebra Problems. Wm Randolph Franklin. In Proc. International Symposium on Spatial Data Handling, pages 190-208, Z{\"u}rich, 20--24 August 1984. (paper).
  94. A Simpler Iterative Solution to the Towers of Hanoi Problem. W. Randolph Franklin. SIGPLAN Notices, 19(8):87-88, aug 1984. (paper).
  95. Shortest Paths Between Source and Goal Points Located On/Around a Convex Polyhedron. Wm Randolph Franklin and Varol Akman. In 22nd Annual Allerton Conference on Communication, Control, and Computing, Urbana, Illinois, USA, 3--5 October 1984. (paper).
  96. 1983 Efficient Rotation of an Object. Wm Randolph Franklin. IEEE Trans. Comput., C-32(11):1064-1067, nov 1983. (paper).
  97. RAYS -- New Representation for Polygons and Polyhedra. Wm Randolph Franklin. Computer Graphics and Image Processing, 22:327-338, 1983.
  98. A Simplified Map Overlay Algorithm. Wm Randolph Franklin. In Harvard Computer Graphics Conference, Cambridge, Mass, USA, 31 July -- 4 August 1983.
  99. Software Aspects of Business Graphics. W. Randolph Franklin. Computers and Graphics, 7(1), 1983. ((invited paper)). (paper).
  100. Adaptive Grids for geometric operations. Wm Randolph Franklin. In Proc. Sixth International Symposium on Automated Cartography (Auto-Carto Six), pages 230-239, Ottawa, 1983.
  101. Software Aspects of Business Graphics. W. Randolph Franklin. Computers and Graphics, 7(1), 1983. ((invited paper)). (paper).
  102. 1982 Efficient polyhedron intersection and union. Wm Randolph Franklin. In Proc. Graphics Interface, pages 73-80, Toronto, 1982. (paper).
  103. On an Improved Algorithm for Decentralized Extrema Finding. W. Randolph Franklin. Comm. ACM, 25(5):336-337, may 1982. (paper).
  104. Simulation of Buried Power Transmission Systems: Some Computer Graphics Options. G. Wazzan, W. Randolph Franklin, W. R. Spillers, A. Greenwood, T. F. Gantry and H. Chu. Computers and Graphics, 6(1):7-14, 1982.
  105. Program Translates Statistics into 3-D Color Map of Europe. W. Randolph Franklin. IEEE Computer and Applications, 2(5):front cover and p. 4, July 1982. ((invited)).
  106. Software Engineering Reasons for VLSI Design Methodology. W. Randolph Franklin. In IEEE Computer Society Workshop Report: VLSI and Software Engineering Workshop, pages 86-89., 4--6 October 1982. (paper).
  107. 1981 3-D Geometric Databases Using Hierarchies of Inscribing Boxes. Wm Randolph Franklin. In Proceedings of the 7th Canadian Man-Computer Conference, pages 173-180, Waterloo, Ontario, Canada, 10--12 June 1981. (paper).
  108. An exact hidden sphere algorithm that operates in linear time. Wm Randolph Franklin. Comput. Graph. Image Process., 15:364-379, 1981.
  109. Faster Calculation of Superquadric Shapes. W. Randolph Franklin and Alan H. Barr. IEEE Computer Graphics and Applications, 1(3):41-47, jul 1981. (paper).
  110. 1980 A linear time exact hidden surface algorithm. Wm Randolph Franklin. Comput. Graph., 14(3):117-123, 1980.
  111. 1979 Evaluation of Algorithms to Display Vector Plots on Raster Devices. Wm Randolph Franklin. Computer Graphics and Image Processing, 11(4):377-397, dec 1979.
  112. Padded Lists---Set Operations in $O(log log N)$ Time. W. Randolph Franklin. Information Processing Letters, 9(4):161-166, nov 1979. (paper).
  113. Prism --- A Prism Plotting Program. W. Randolph Franklin. In Mapping Software and Cartographic Data Bases, pages 75-79., 1979.
  114. 1978 Combinatorics of hidden surface algorithms. Wm Randolph Franklin. PhD thesis, Center for Research in Computing Technology, Harvard Univ., Jun 1978. (parts: 1, 2, 3, 4).
  115. 3-D Graphic Display of Discrete Spatial Data By Prism Maps. Wm Randolph Franklin and Harry R. Lewis. In Proc. SIGGRAPH'78, pages 70-75, aug 1978. (paper).
  116. The Maturation of Computer Graphics. William G. Nisen and W. Randolph Franklin. ICP Interface Manufacturing and Engineering, 3(4):5-11, 1978. (paper).

4.  Presentations

(This sample demonstrates where I've lectured.)

  1. "Operating on large geometric datasets", 18th Fall Workshop in Computational Geometry, RPI, Oct 31 2008.
  2. "GeoStar at RPI", DARPA Geo* program review meeting, Arlington VA, Aug 11 2008.
  3. "Smugglers and border guards - Geo* at RPI", DARPA Geo* program review meeting, Arlington VA, Oct 2007.
  4. "Smugglers and border guards - Geo* at RPI", National Geospatial-Intelligence Agency (NGA) Geo* Industry Day, Arlington VA, Oct 2007.
  5. "Compact visibility and path preserving terrain representations", DARPA Geo* program review meeting, Coeur d'Alene, April 4 2007.
  6. Invited speaker at the last annual seminar in the UniGIS online program, Simon Fraser University, Vancouver BC, May 2006.
  7. "Geometric operations on millions of objects", Middle Eastern Technical University, Ankara, 27 July 2004.
  8. "Geometric operations on millions of objects", Bilkent University, Ankara, 26 July 2004,
  9. "Geometric operations on millions of objects", Sabanci University, Istanbul, 20 July 2004,
  10. "Geometric operations on millions of objects", Koc University, Istanbul, 16 July 2004,
  11. "Siting observers on terrain", US Army Topographic Engineering Center, 28 Jan 2004.
  12. "Computational and geometric cartography", Boston University, 30 Apr 2003.
  13. "Computational and geometric cartography", Siena College, 22 April 2003.
  14. "Mass properties of the union of many squares (Geometric operations on hundreds of millions of objects)", DIMACS Workshop on Implementation of Geometric Algorithms, 4-6 Dec 2002, Rutgers University.
  15. "Observations in support of automation with GPR, (invited talk)" The Use of Ground Penetrating Radar in Assessing the Condition of Transportation Infrastructure (Workshop) CenSSIS, RPI, 29-30 Oct, 2002.
  16. "Computational and geometric cartography", GIScience 2002, Boulder, Colorado, 26 Sept 2002 (keynote talk).
  17. "Elevation data operations", DARPA Defense Science Office, June 1999.
  18. "Elevation data operations", Florida Atlantic University, June 1999.
  19. "Computational cartography elevation data operations", Bell Labs, Murray Hill, January 30, 1998.
  20. "Lossy compression of gridded elevation data", IBM TJ Watson Research Center, November 10, 1995.
  21. Panel speaker on Computational Geometry and Applications, Canadian Conference on Computational Geometry, Quebec City, August 1995.
  22. Panel speaker on the future of GIS, Fourth International Symposium on Large Spatial Databases - SSD '95, August 6-9, 1995, Portland, Maine, USA.
  23. "Higher isn't much better", Fourth MSI Workshop on Computational Geometry, Cornell University, October 15, 1994.
  24. "Higher isn't much better", Dept. de Science Géodésique, Université Laval, Quebec, January 13, 1994.
  25. "Calculating map overlay polygons' areas", Institute of Systems Science, National University of Singapore, August 2, 1993.
  26. "Higher isn't (much) better", University of Tasmania, June 1993.
  27. "Parallel geometry implementations", the Commonwealth Scientific and Industrial Research Organization, Canberra, April 13, 1993.
  28. "Calculating map overlay polygons' areas", University of Auckland, New Zealand, April 6, 1993.
  29. "Parallel geometry implementations", Canterbury University, Christchurch, New Zealand, March 31, 1993.
  30. "Computational geometry - why?" Dept. de Science Géodésique, Universite Laval, Quebec, February 1, 1993.
  31. "Parallel geometry implementations", Karlsruhe, November 1992.
  32. "Higher isn't (much) better - visibility experiments and algorithms for terrain databases", University of Milan, November 15, 1992.
  33. "Parallel geometry implementations", National Research Council, Pisa, Italy, November 13, 1992.
  34. "Local topological properties of polyhedra", Universita La Sapienza, Rome, November 11, 1992.
  35. "Differences between 2D and 3D in geometry", Dipartimento di Informatica e Scienze dell'Informazione, Universita di Genova, October 28, 1992.
  36. "Efficient polygon overlay", US Geologic Survey, August 1991.
  37. "Efficient geometric operations for computer aided design", McGill University, April 6, 1990.
  38. "Efficient geometric operations for computer aided design", Worcester Polytechnic Institute, February 1, 1990.
  39. "Efficient intersection calculation in large databases", CAIP Center, Rutgers University, November 1989.
  40. "Efficient intersection calculation in large databases", GE CR\&D, November 1989.
  41. "Efficient intersection calculation in large databases", University of New Brunswick, Computer Science Dept., October 1989.
  42. "Efficient intersection calculation in large databases", National Center for Cartographic Information and Analysis, University of Maine at Orono, October 1989.
  43. "Polygon properties calculated from the vertex neighborhoods", Eindhoven University, the Netherlands, July 1, 1987.
  44. "Polygon properties calculated from the vertex neighborhoods", Philips Research Labs, Eindhoven, the Netherlands, July 1, 1987.
  45. "Polygon properties calculated from the vertex neighborhoods", University of Utrecht, the Netherlands, June 29, 1987.
  46. "Polygon properties calculated from the vertex neighborhoods", Istituto per la Mathematica Applicata, Consiglio Nazionale delle Ricercha, Genova, Italy, June 22, 1987.
  47. "Polygon properties calculated from the vertex neighborhoods", University of Maryland, April 1987.
  48. "Computational geometry in prolog", IBM Japan Scientific Institute, April 1986.
  49. "Computational geometry in prolog", Lawrence Livermore National Labs, March 1986.
  50. "Linear time object space hidden surface algorithm", University of California, Berkeley, October 1985.

5.  Synergistic Activities and Service

  1. Software is freely available on my website. Still receive, and respond to, questions about PNPOLY, which I wrote around 1970.
  2. Helped develop courses from freshman to graduate, in both the traditional lecture, and the newer studio, formats. A significant contributor to the National Electrical Engineering Department Heads Association (NEEDHA) Innovative Program Award to RPI's ECSE Dept.
  3. Five ABET/CAC site visits and two NY State Science & Tech Foundation site visits.
  4. Member of the Union College (Schenectady) Computer Engineering Program Advisory Committee.
  5. An incorporator of, and board member of, the Institute for Infrastructure Asset Management, Sept 1998-present. This is a nonprofit NYS corporation to provide research, development, consulting, and educational services to maximize the efficient utilization of infrastructure investments.
  6. Have applied specialized expertise in short-term work for US Army Topographic Engineering Center, NY State Dept of Health & Dept of Motor Vehicles, Chemical Bank, Bearing Sciences, Lockheed-Martin, et al.
  7. Public lectures to RPI Women's Club about the internet.
  8. Two Army SBIRs, A07-126 Optimal Intervisibility Site Selection and A07-123 Novel Representations of Elevation Data appear to be based on my work (one cites me four times).
  9. External reader for doctoral theses at U. Tasmania, National University of Singapore, SUNY Buffalo,
  10. External visiting member of doctoral thesis at Eindhoven.
  11. Proposal reviewing for NSF, ARO, Dutch NWO.
  12. Paper reviewing and/or program committeeïng for IJGIS, Geoinformatica, Geographical Analysis, SIGGRAPH, SDH, IEEE, PE&RS, GIScience, etc.
  13. Inside RPI: several terms on each of Faculty Council, Faculty Senate, Planning and Resources Committee, Provost's Computer Committee, President's and Provost's Panel on Strategic Initiatives, Registrar's BANNER Implementation Committee, Y2K Planning Committee, Residence Life Opening Doors program.

6.  Grad Students

Graduated: 65 masters students and 13 PhD students. PhD students:

  1. Varol Akman, Shortest paths avoiding polyhedral obstacles in 3-dimensional Euclidean space, 1985.
  2. William S. Yerazunis,DIS - An Architecture for fast Lisp execution, 1987.
  3. Peter Yick-Fai Wu, Polygon overlay in Prolog 1987.
  4. Ernesto Guerrieri, A Methodology for software transportability, 1989.
  5. Mohan Kankanhalli, Techniques for parallel geometric computations, 1990.
  6. Chandrasekhar Narayanaswami, Parallel processing for geometric applications, 1991.
  7. Clark K. Ray, Representing visibility for siting problems, 1994.
  8. Victor Skowronski, Synthesizing tolerances for optimal design using the Taguchi quality loss function, 1996.
  9. Michael Gousie, Contours to digital elevation models: grid-based surface reconstruction methods, 1998.
  10. Helio Pedrini, ''An Adaptive method for terrain surface \ approximation based on triangular meshes'', 2000.
  11. Linda Lim, Haptic and multi-modal interaction for teaching and designing basic controls, 2004.
  12. Metin Inanc, Compressing terrain elevation datasets, 2008.
  13. Dan Tracy, 2009.

7.  Teaching or Course Development

Computing Fundamentals for Engineers (freshmen), Computer Organization and Logic Design (sophomore), Computer Components and Operations (sophomore studio), Computer Graphics (senior), Data Structures (senior), Programming Languages (senior/grad), Interactive Computer Aided Design (senior), Computational Geometry (grad), Advanced Computer Graphics (grad), Software Engineering (grad).

8.  Hardware Used

DEC PDP 1, 8, 10, 11, Vax 11/780, IBM 1620, 7094, 360, 370, 5100, Prime, Lisp Machine, Sun Sparc, Motorola 6811, 68000, 68010, 68020, Sequent Balance, Thinking Machines CM-2, Intel 8051, 8086, Pentium, Xeon, AMD Opteron. Wordlengths (bits): 8, 12, 16, 32, 36.

9.  Professional Memberships

ACM, IEEE, SIAM, ACSM, Computer Graphics Pioneers.

10.  Major Research Grants

  1. CDI-Type I: Fundamental Terrain Representations and Operations, Barb Cutler, Tom Zimmie and me, NSF/ENG/CDI, 2008-2011, $670,000.
  2. Fall Workshop on Computational Geometry 2008, Barb Cutler and me, NSF/CISE/NSG, 2008, $12,335.
  3. Geospatial Representation and Analysis (Geo*): Geologically Correct Terrain Data Structures & Radar Siting, DARPA/DSO, Phase I and Phase II, sole PI, $1.3M, 2005-2008.
  4. CMG Research: Adaptation of Microlocal and Time-reversal Techniques to Tomographic Analysis of Locally Recorded Earthquake Seismograms, Steve Roecker, Margaret Cheney, me, and Joyce McLaughlin, NSF, 2003-2006, $582,965.
  5. Simulation and Analysis of Large Scale Complex Systems, Malik Magdon-Ismail, me, Selmer Bringsjord, Mark Goldberg, Boleslaw Szymanski, NSF, 2003, $155,969.
  6. CG Techniques for Terrain Representation, NSF/CISE/C-CR/GSG, 2003-2006, $192,000 including REU supplements.
  7. RPI Research Revitalization award, 2002, $50,000.
  8. Parallel Computational Geometry Algorithms and Implementations, NSF/CCF, 1992, $99,993.
  9. Logic Programming for Computational Geometry and Computer Aided Design Algorithms, NSF Presidential Young Investigator Award, 1984-1989, $500,000 including cost-sharing from IBM, Schlumberger-Doll and Sun Microsystems.
  10. Efficient Computer Aided Design Algorithms, 1981 - 1983, $69,000.
  11. Fundamentals of Hidden Surface Algorithms, NSF/ENG, 1979 - 1981, $32,000.