Wm. Randolph Franklin

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