Wm. Randolph Franklin - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2005

Nearest Point Query on 184M Points in E3 with a Uniform GridWm. Randolph Franklin. cccg 2005: 239-242 [doi]

2003

Constructing a dem from grid-based data by computing intermediate contoursMichael B. Gousie, Wm. Randolph Franklin. gis 2003: 71-77 [doi]

1995

Compressing Elevation DataWm. Randolph Franklin. ssd 1995: 385-404 [doi]

Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in ParallelMohan S. Kankanhalli, Wm. Randolph Franklin. jpdc, 27(2):107-117, 1995.

1993

Volumes From Overlaying 3-D Triangulations in ParallelWm. Randolph Franklin, Mohan S. Kankanhalli. ssd 1993: 477-489 [doi]

1992

Boolean Combinations of Polygons in ParallelChandrasekhar Narayanaswami, Wm. Randolph Franklin. icpp 1992: 131-135

Edge Intersection on the Hypercube ComputerChandrasekhar Narayanaswami, Wm. Randolph Franklin. ipl, 41(5):257-262, 1992.

1991

Determination of mass properties of polygonal CSG objects in parallelChandrasekhar Narayanaswami, Wm. Randolph Franklin. ijcga, 1(4):381-403, 1991.

Determination of mass properties of polygonal CSG objects in parallelChandrasekhar Narayanaswami, Wm. Randolph Franklin. wm 1991: 279-288 [doi]

1990

Parallel object-space hidden surface removalWm. Randolph Franklin, Mohan S. Kankanhalli. siggraph 1990: 87-94 [doi]

A logic programming approach to cartographic map overlayPeter Y. F. Wu, Wm. Randolph Franklin. ci, 6:61-70, 1990.

1989

Representing objects as rays, or how to pile up an octree?Varol Akman, Wm. Randolph Franklin. cg, 13(3):373-379, 1989. [doi]

Ray representation for ::::k::::-treesVarol Akman, Wm. Randolph Franklin. prl, 10(5):315-320, 1989. [doi]

Art Gallery Theorems and Algorithms (Joseph O'Rourke)Wm. Randolph Franklin. siamrev, 31(2):342-343, 1989. [doi]

1988

Adaptive Grid for Polyhedral Visibility in Object Space: An ImplementationWm. Randolph Franklin, Varol Akman. cj, 31(1):56-60, 1988.

1987

A Simple and Efficient Haloed Line Algorithm for Hidden Line EliminationWm. Randolph Franklin, Varol Akman. cgf, 6(2):103-109, 1987. [doi]

Polygon Properties Calculated from the Vertex NeighborhoodsWm. Randolph Franklin. compgeom 1987: 110-118 [doi]

1986

On the question Is Sigma (between 1 and n) root a1 =< L? Varol Akman, Wm. Randolph Franklin. eatcs, 28:16-19, 1986.

Reconstructing Visible Regions from Visible SegmentsWm. Randolph Franklin, Varol Akman. bit, 26(4):430-441, 1986.

1985

Voronoi diagrams with barriers and on polyhedra for minimal path planningWm. Randolph Franklin, Varol Akman, Colin Verrilli. vc, 1(2):133-150, 1985.

1984

A simpler iterative solution to the Towers of Hanoi problemWm. Randolph Franklin. SIGPLAN, 19(8):87-88, 1984. [doi]

1983

Efficient Iterated Rotation of an ObjectWm. Randolph Franklin. TC, 32(11):1064-1067, 1983.

Software aspects of business graphicsWm. Randolph Franklin. cg, 7(1):5-12, 1983. [doi]

1982

On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of ProcessorsWm. Randolph Franklin. CACM, 25(5):336-337, 1982.

Simulation of buried power transmission systems: Some computer graphics optionsGhaleb Wazzan, Wm. Randolph Franklin, William R. Spillers, Allan Greenwood, Henry Chu, Thomas F. Garrity. cg, 6(1):7-14, 1982. [doi]

1980

A linear time exact hidden surface algorithmWm. Randolph Franklin. siggraph 1980: 117-123 [doi]

1979

Padded Lists: Set Operations in Expected Theta(log log N) TimeWm. Randolph Franklin. ipl, 9(4):161-166, 1979.

Sign in or sign up to see more results.

runs on WebDSL