W. Randolph Franklin

Affiliations:
  • Rensselaer Polytechnic Institute, Troy, USA


According to our database1, W. Randolph Franklin authored at least 74 papers between 1978 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Implementing Simulation of Simplicity for geometric degeneracies.
CoRR, 2022

Fast Parallel Evaluation of Exact Geometric Predicates on GPUs.
Comput. Aided Des., 2022

Employing GPUs to Accelerate Exact Geometric Predicates for 3D Geospatial Processing.
Proceedings of the Spatial Gems, Volume 1, 2022

Minimal Representations of Polygons and Polyhedra.
Proceedings of the Spatial Gems, Volume 1, 2022

2020
An Efficient and Exact Parallel Algorithm for Intersecting Large 3-D Triangular Meshes Using Arithmetic Filters.
Comput. Aided Des., 2020

2018
Exact Fast Parallel Intersection of Large 3-D Triangular Meshes.
Proceedings of the 27th International Meshing Roundtable, 2018

Fast analysis of upstream features on spatial networks (GIS cup).
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

Data Structures for Parallel Spatial Algorithms on Large Datasets (Vision paper).
Proceedings of the 7th ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, 2018

2017
Fast exact parallel 3D mesh intersection algorithm using only orientation predicates.
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

Parallel intersection detection in massive sets of cubes.
Proceedings of the 6th ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data, 2017

2016
An Efficient External Memory Algorithm for Terrain Viewshed Computation.
ACM Trans. Spatial Algorithms Syst., 2016

PinMesh - Fast and exact 3D point location queries using a uniform grid.
Comput. Graph., 2016

Exact intersection of 3D geometric models.
Proceedings of the XVII Brazilian Symposium on Geoinformatics, 2016

NearptD: A Parallel Implementation of Exact Nearest Neighbor Search using a Uniform Grid.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Efficiently computing the drainage network on massive terrains using external memory flooding process.
GeoInformatica, 2015

An Efficient and Topologically Correct Map Generalization Heuristic.
Proceedings of the ICEIS 2015, 2015

Fast exact parallel map overlay using a two-level uniform grid.
Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data, 2015

Using Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification.
Proceedings of the XVI Brazilian Symposium on GeoInformatics, Campos do Jordão, São Paulo, Brazil, November 29, 2015

2014
A Parallel Algorithm for Viewshed Computation on Grid Terrains.
J. Inf. Data Manag., 2014

An Improved Parallel Algorithm Using GPU for Siting Observers on Terrain.
Proceedings of the ICEIS 2014, 2014

An efficient GPU multiple-observer siting method based on sparse-matrix multiplication.
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, 2014

Fast map generalization heuristic with a uniform grid.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

Parallel multiple observer siting on terrain.
Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2014

2013
A Parallel Sweep Line Algorithm for Visibility Computation.
Proceedings of the XIV Brazilian Symposium on Geoinformatics, 2013

2012
Automated artifact-free seafloor surface reconstruction with two-step ODETLAP.
ACM SIGSPATIAL Special, 2012

Computing the drainage network on huge grid terrains.
Proceedings of the 1st ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data, 2012

More efficient terrain viewshed computation on massive datasets using external memory.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

A New Method for Computing the Drainage Network Based on Raising the Level of an Ocean Surrounding the Terrain.
Proceedings of the Bridging the Geographic Information Sciences, 2012

2011
Measuring terrain distances through extracted channel networks.
ACM SIGSPATIAL Special, 2011

Efficient viewshed computation on terrain in external memory.
GeoInformatica, 2011

2010
Slope preserving lossy terrain compression.
ACM SIGSPATIAL Special, 2010

3D oceanographic data compression using 3D-ODETLAP.
ACM SIGSPATIAL Special, 2010

An optimization heuristic for siting observers in huge terrains stored in external memory.
Proceedings of the 10th International Conference on Hybrid Intelligent Systems (HIS 2010), 2010

Quantitative analysis of simulated erosion for different soils.
Proceedings of the 18th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2010

2009
Evaluating hydrology preservation of simplified terrain representations.
ACM SIGSPATIAL Special, 2009

Sea floor bathymetry trackline surface fitting without visible artifacts using ODETLAP.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009

2008
Slope Accuracy and Path Planning on Compressed Terrain.
Proceedings of the Headway in Spatial Data Handling, 2008

Path planning on a compressed terrain.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

Parallel ODETLAP for terrain compression and reconstruction.
Proceedings of the 16th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2008

2007
Smugglers and border guards: the GeoStar project at RPI.
Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

2005
Nearest Point Query on 184M Points in E3 with a Uniform Grid.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003
Constructing a dem from grid-based data by computing intermediate contours.
Proceedings of the ACM-GIS 2003, 2003

Mass Properties of the Union of Millions of Identical Cubes.
Proceedings of the Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing, 2003

2001
Volume and Surface Area Distributions of Cracks in Concrete.
Proceedings of the Visual Form 2001, 4th International Workshop on Visual Form, 2001

Automatic extraction of topographic features using adaptive triangular meshes.
Proceedings of the 2001 International Conference on Image Processing, 2001

1999
Discrete And Computational Geometry.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1995
Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel.
J. Parallel Distributed Comput., 1995

Compressing Elevation Data.
Proceedings of the Advances in Spatial Databases, 1995

1993
Volumes From Overlaying 3-D Triangulations in Parallel.
Proceedings of the Advances in Spatial Databases, 1993

1992
Edge Intersection on the Hypercube Computer.
Inf. Process. Lett., 1992

Boolean Combinations of Polygons in Parallel.
Proceedings of the 1992 International Conference on Parallel Processing, 1992

1991
Determination of mass properties of polygonal CSG objects in parallel.
Int. J. Comput. Geom. Appl., 1991

1990
A logic programming approach to cartographic map overlay.
Comput. Intell., 1990

Parallel object-space hidden surface removal.
Proceedings of the 17th Annual Conference on Computer Graphics and Interactive Techniques, 1990

1989
Art Gallery Theorems and Algorithms (Joseph O'Rourke).
SIAM Rev., 1989

Ray representation for <i>k</i>-trees.
Pattern Recognit. Lett., 1989

Representing objects as rays, or how to pile up an octree?
Comput. Graph., 1989

1988
Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation.
Comput. J., 1988

1987
A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination.
Comput. Graph. Forum, 1987

Polygon Properties Calculated from the Vertex Neighborhoods.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
On the question "Is Sigma (between 1 and n) root a1 =< L?".
Bull. EATCS, 1986

Prolog and Geometry Projects.
IEEE Computer Graphics and Applications, 1986

Reconstructing Visible Regions from Visible Segments.
BIT, 1986

1985
Voronoi diagrams with barriers and on polyhedra for minimal path planning.
Vis. Comput., 1985

Building an Octree from a Set of Parallelepipeds.
IEEE Computer Graphics and Applications, 1985

1984
A simpler iterative solution to the Towers of Hanoi problem.
ACM SIGPLAN Notices, 1984

1983
Efficient Iterated Rotation of an Object.
IEEE Trans. Computers, 1983

Rays - New representation for polygons and polyhedra.
Comput. Vis. Graph. Image Process., 1983

Software aspects of business graphics.
Comput. Graph., 1983

1982
Simulation of buried power transmission systems: Some computer graphics options.
Comput. Graph., 1982

On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors.
Commun. ACM, 1982

1980
A linear time exact hidden surface algorithm.
Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, 1980

1979
Padded Lists: Set Operations in Expected Theta(log log N) Time.
Inf. Process. Lett., 1979

1978
3-D graphic display of discrete spatial data by prism maps.
Proceedings of the 5th Annual Conference on Computer Graphics and Interactive Techniques, 1978


  Loading...