Wm. Randolph Franklin

Publication Activity (10 Years)

Years Active: 1979-2005
Publications (10 Years): 0

Publications

Wm. Randolph Franklin
Nearest Point Query on 184M Points in E3 with a Uniform Grid. CCCG (2005)
Michael B. Gousie, Wm. Randolph Franklin
Constructing a dem from grid-based data by computing intermediate contours. GIS (2003)
Wm. Randolph Franklin
Compressing Elevation Data. SSD (1995)
Mohan S. Kankanhalli, Wm. Randolph Franklin
Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel. J. Parallel Distributed Comput. 27 (2) (1995)
Wm. Randolph Franklin, Mohan S. Kankanhalli
Volumes From Overlaying 3-D Triangulations in Parallel. SSD (1993)
Chandrasekhar Narayanaswami, Wm. Randolph Franklin
Boolean Combinations of Polygons in Parallel. ICPP (3) (1992)
Chandrasekhar Narayanaswami, Wm. Randolph Franklin
Edge Intersection on the Hypercube Computer. Inf. Process. Lett. 41 (5) (1992)
Chandrasekhar Narayanaswami, Wm. Randolph Franklin
Determination of mass properties of polygonal CSG objects in parallel. Symposium on Solid Modeling and Applications (1991)
Chandrasekhar Narayanaswami, Wm. Randolph Franklin
Determination of mass properties of polygonal CSG objects in parallel. Int. J. Comput. Geom. Appl. 1 (4) (1991)
Peter Y. F. Wu, Wm. Randolph Franklin
A logic programming approach to cartographic map overlay. Comput. Intell. 6 (1990)
Wm. Randolph Franklin, Mohan S. Kankanhalli
Parallel object-space hidden surface removal. SIGGRAPH (1990)
Varol Akman, Wm. Randolph Franklin
Representing objects as rays, or how to pile up an octree? Comput. Graph. 13 (3) (1989)
Varol Akman, Wm. Randolph Franklin
-trees. Pattern Recognit. Lett. 10 (5) (1989)
Wm. Randolph Franklin
Art Gallery Theorems and Algorithms (Joseph O'Rourke). SIAM Rev. 31 (2) (1989)
Wm. Randolph Franklin, Varol Akman
Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation. Comput. J. 31 (1) (1988)
Wm. Randolph Franklin, Varol Akman
A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination. Comput. Graph. Forum 6 (2) (1987)
Wm. Randolph Franklin
Polygon Properties Calculated from the Vertex Neighborhoods. SCG (1987)
Varol Akman, Wm. Randolph Franklin
On the question "Is Sigma (between 1 and n) root a1 =< L?". Bull. EATCS 28 (1986)
Wm. Randolph Franklin, Varol Akman
Reconstructing Visible Regions from Visible Segments. BIT 26 (4) (1986)
Wm. Randolph Franklin, Varol Akman, Colin Verrilli
Voronoi diagrams with barriers and on polyhedra for minimal path planning. Vis. Comput. 1 (2) (1985)
Wm. Randolph Franklin
A simpler iterative solution to the Towers of Hanoi problem. ACM SIGPLAN Notices 19 (8) (1984)
Wm. Randolph Franklin
Software aspects of business graphics. Comput. Graph. 7 (1) (1983)
Wm. Randolph Franklin
Efficient Iterated Rotation of an Object. IEEE Trans. Computers 32 (11) (1983)
Wm. Randolph Franklin
On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors. Commun. ACM 25 (5) (1982)
Ghaleb Wazzan, Wm. Randolph Franklin, William R. Spillers, Allan Greenwood, Henry Chu, Thomas F. Garrity
Simulation of buried power transmission systems: Some computer graphics options. Comput. Graph. 6 (1) (1982)
Wm. Randolph Franklin
A linear time exact hidden surface algorithm. SIGGRAPH (1980)
Wm. Randolph Franklin
Padded Lists: Set Operations in Expected Theta(log log N) Time. Inf. Process. Lett. 9 (4) (1979)