| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Wm. Randolph Franklin Michael B. Gousie , Wm. Randolph Franklin: Constructing a dem from grid-based data by computing intermediate contours. GIS 2003 : 71-77 Wm. Randolph Franklin: Compressing Elevation Data. SSD 1995 : 385-404 Mohan S. Kankanhalli , 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 (1995) Wm. Randolph Franklin, Mohan S. Kankanhalli : Volumes From Overlaying 3-D Triangulations in Parallel. SSD 1993 : 477-489 Chandrasekhar Narayanaswami , Wm. Randolph Franklin: Boolean Combinations of Polygons in Parallel. ICPP (3) 1992 : 131-135 Chandrasekhar Narayanaswami , Wm. Randolph Franklin: Edge Intersection on the Hypercube Computer. Inf. Process. Lett. 41 (5): 257-262 (1992) Chandrasekhar Narayanaswami , Wm. Randolph Franklin: Determination of mass properties of polygonal CSG objects in parallel. Symposium on Solid Modeling and Applications 1991 : 279-288 Chandrasekhar Narayanaswami , Wm. Randolph Franklin: Determination of mass properties of polygonal CSG objects in parallel. Int. J. Comput. Geometry Appl. 1 (4): 381-403 (1991) Wm. Randolph Franklin, Mohan S. Kankanhalli : Parallel object-space hidden surface removal. SIGGRAPH 1990 : 87-94 Peter Y. F. Wu , Wm. Randolph Franklin: A logic programming approach to cartographic map overlay. Computational Intelligence 6 : 61-70 (1990) Varol Akman , Wm. Randolph Franklin: Representing objects as rays, or how to pile up an octree? Computers & Graphics 13 (3): 373-379 (1989) Wm. Randolph Franklin, Varol Akman : Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation. Comput. J. 31 (1): 56-60 (1988) Wm. Randolph Franklin: Polygon Properties Calculated from the Vertex Neighborhoods. Symposium on Computational Geometry 1987 : 110-118 Wm. Randolph Franklin, Varol Akman : Reconstructing Visible Regions from Visible Segments. BIT 26 (4): 430-441 (1986) Varol Akman , Wm. Randolph Franklin: On the question "Is Sigma (between 1 and n) root a1 =< L?". Bulletin of the EATCS 28 : 16-19 (1986) Wm. Randolph Franklin, Varol Akman , Colin Verrilli : Voronoi diagrams with barriers and on polyhedra for minimal path planning. The Visual Computer 1 (2): 133-150 (1985) Wm. Randolph Franklin: Efficient Iterated Rotation of an Object. IEEE Trans. Computers 32 (11): 1064-1067 (1983) Wm. Randolph Franklin: On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors. Commun. ACM 25 (5): 336-337 (1982) Wm. Randolph Franklin: Padded Lists: Set Operations in Expected Theta(log log N) Time. Inf. Process. Lett. 9 (4): 161-166 (1979) 1 [ 4 ] [ 5 ] [ 6 ] [ 8 ] [ 9 ] 2 [ 19 ] 3 [ 11 ] [ 16 ] [ 17 ] 4 [ 12 ] [ 13 ] [ 14 ] [ 15 ] 5 [ 4 ] 6 [ 10 ]  ©2004 Association for Computing Machinery |
