| 2005 |
|---|
| 24 | EE | Wm. Randolph Franklin:
Nearest Point Query on 184M Points in E3 with a Uniform Grid.
CCCG 2005: 239-242 |
| 2003 |
|---|
| 23 | EE | Michael B. Gousie,
Wm. Randolph Franklin:
Constructing a dem from grid-based data by computing intermediate contours.
GIS 2003: 71-77 |
| 1995 |
|---|
| 22 | EE | Wm. Randolph Franklin:
Compressing Elevation Data.
SSD 1995: 385-404 |
| 21 | | 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) |
| 1993 |
|---|
| 20 | EE | Wm. Randolph Franklin,
Mohan S. Kankanhalli:
Volumes From Overlaying 3-D Triangulations in Parallel.
SSD 1993: 477-489 |
| 1992 |
|---|
| 19 | | Chandrasekhar Narayanaswami,
Wm. Randolph Franklin:
Boolean Combinations of Polygons in Parallel.
ICPP (3) 1992: 131-135 |
| 18 | | Chandrasekhar Narayanaswami,
Wm. Randolph Franklin:
Edge Intersection on the Hypercube Computer.
Inf. Process. Lett. 41(5): 257-262 (1992) |
| 1991 |
|---|
| 17 | EE | Chandrasekhar Narayanaswami,
Wm. Randolph Franklin:
Determination of mass properties of polygonal CSG objects in parallel.
Symposium on Solid Modeling and Applications 1991: 279-288 |
| 16 | | 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) |
| 1990 |
|---|
| 15 | EE | Wm. Randolph Franklin,
Mohan S. Kankanhalli:
Parallel object-space hidden surface removal.
SIGGRAPH 1990: 87-94 |
| 14 | | Peter Y. F. Wu,
Wm. Randolph Franklin:
A logic programming approach to cartographic map overlay.
Computational Intelligence 6: 61-70 (1990) |
| 1989 |
|---|
| 13 | EE | Varol Akman,
Wm. Randolph Franklin:
Representing objects as rays, or how to pile up an octree?
Computers & Graphics 13(3): 373-379 (1989) |
| 12 | EE | Varol Akman,
Wm. Randolph Franklin:
Ray representation for k-trees.
Pattern Recognition Letters 10(5): 315-320 (1989) |
| 1988 |
|---|
| 11 | | Wm. Randolph Franklin,
Varol Akman:
Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation.
Comput. J. 31(1): 56-60 (1988) |
| 1987 |
|---|
| 10 | EE | Wm. Randolph Franklin:
Polygon Properties Calculated from the Vertex Neighborhoods.
Symposium on Computational Geometry 1987: 110-118 |
| 9 | EE | Wm. Randolph Franklin,
Varol Akman:
A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination.
Comput. Graph. Forum 6(2): 103-109 (1987) |
| 1986 |
|---|
| 8 | | Wm. Randolph Franklin,
Varol Akman:
Reconstructing Visible Regions from Visible Segments.
BIT 26(4): 430-441 (1986) |
| 7 | | 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) |
| 1985 |
|---|
| 6 | | 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) |
| 1983 |
|---|
| 5 | EE | Wm. Randolph Franklin:
Software aspects of business graphics.
Computers & Graphics 7(1): 5-12 (1983) |
| 4 | | Wm. Randolph Franklin:
Efficient Iterated Rotation of an Object.
IEEE Trans. Computers 32(11): 1064-1067 (1983) |
| 1982 |
|---|
| 3 | | Wm. Randolph Franklin:
On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors.
Commun. ACM 25(5): 336-337 (1982) |
| 2 | EE | 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.
Computers & Graphics 6(1): 7-14 (1982) |
| 1979 |
|---|
| 1 | | Wm. Randolph Franklin:
Padded Lists: Set Operations in Expected Theta(log log N) Time.
Inf. Process. Lett. 9(4): 161-166 (1979) |
