default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDW. Randolph Franklin
Person information
- affiliation: Rensselaer Polytechnic Institute, Troy, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j33]Marcelo de Matos Menezes
, Salles Viana Gomes de Magalhães, Matheus Aguilar de Oliveira, W. Randolph Franklin, Rodrigo Eduardo de Oliveira Bauer Chichorro:
Fast Parallel Evaluation of Exact Geometric Predicates on GPUs. Comput. Aided Des. 150: 103285 (2022)- [p2]W. Randolph Franklin, Salles Viana Gomes de Magalhães:
Minimal Representations of Polygons and Polyhedra. Spatial Gems (1) (1) 2022: 33-48 - [p1]Marcelo M. Menezes, Salles Viana Gomes de Magalhães, Matheus Aguilar de Oliveira, W. Randolph Franklin, Bruno F. Coelho:
Employing GPUs to Accelerate Exact Geometric Predicates for 3D Geospatial Processing. Spatial Gems (1) (1) 2022: 97-110 - [i1]W. Randolph Franklin, Salles Viana Gomes de Magalhães:
Implementing Simulation of Simplicity for geometric degeneracies. CoRR abs/2212.08226 (2022) - 2020
- [j32]Salles Viana Gomes de Magalhães, W. Randolph Franklin, Marcus Vinícius Alvim Andrade:
An Efficient and Exact Parallel Algorithm for Intersecting Large 3-D Triangular Meshes Using Arithmetic Filters. Comput. Aided Des. 120: 102801 (2020)
2010 – 2019
- 2018
- [c38]W. Randolph Franklin, Salles Viana Gomes de Magalhães, Marcus Vinícius Alvim Andrade:
Data Structures for Parallel Spatial Algorithms on Large Datasets (Vision paper). BigSpatial@SIGSPATIAL 2018: 16-19 - [c37]Salles Viana Gomes Magalhães, W. Randolph Franklin, Ricardo dos Santos Ferreira:
Fast analysis of upstream features on spatial networks (GIS cup). SIGSPATIAL/GIS 2018: 622-625 - [c36]Salles Viana Gomes de Magalhães, W. Randolph Franklin, Marcus Vinícius Alvim Andrade:
Exact Fast Parallel Intersection of Large 3-D Triangular Meshes. IMR 2018: 365-383 - 2017
- [c35]W. Randolph Franklin, Salles V. G. Magalhães:
Parallel intersection detection in massive sets of cubes. BigSpatial@SIGSPATIAL 2017: 20-26 - [c34]Salles V. G. Magalhães, W. Randolph Franklin, Marcus V. A. Andrade:
Fast exact parallel 3D mesh intersection algorithm using only orientation predicates. SIGSPATIAL/GIS 2017: 44:1-44:10 - 2016
- [j31]Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Wenli Li:
PinMesh - Fast and exact 3D point location queries using a uniform grid. Comput. Graph. 58: 1-11 (2016) - [j30]Cháulio R. Ferreira, Marcus V. A. Andrade, Salles V. G. Magalhães, W. Randolph Franklin:
An Efficient External Memory Algorithm for Terrain Viewshed Computation. ACM Trans. Spatial Algorithms Syst. 2(2): 6:1-6:17 (2016) - [c33]David Hedin, W. Randolph Franklin:
NearptD: A Parallel Implementation of Exact Nearest Neighbor Search using a Uniform Grid. CCCG 2016: 42-47 - [c32]Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Wenli Li, Mauricio G. Gruppi:
Exact intersection of 3D geometric models. GEOINFO 2016: 44-55 - 2015
- [j29]Thiago L. Gomes, Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Guilherme C. Pena:
Efficiently computing the drainage network on massive terrains using external memory flooding process. GeoInformatica 19(4): 671-692 (2015) - [c31]Mauricio G. Gruppi, Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Wenli Li:
Using Rational Numbers and Parallel Computing to Efficiently Avoid Round-off Errors on Map Simplification. GEOINFO 2015: 162-173 - [c30]Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Wenli Li:
Fast exact parallel map overlay using a two-level uniform grid. BigSpatial@SIGSPATIAL 2015: 45-54 - [c29]Mauricio G. Gruppi, Salles V. G. Magalhães, Marcus Vinícius Alvim Andrade, W. Randolph Franklin, Wenli Li:
An Efficient and Topologically Correct Map Generalization Heuristic. ICEIS (1) 2015: 516-525 - 2014
- [j28]Cháulio R. Ferreira, Marcus Vinícius Alvim Andrade, Salles V. G. Magalhães, W. Randolph Franklin, Guilherme C. Pena:
A Parallel Algorithm for Viewshed Computation on Grid Terrains. J. Inf. Data Manag. 5(2): 171-180 (2014) - [c28]Guilherme C. Pena, Salles V. G. Magalhães, Marcus Vinícius Alvim Andrade, W. Randolph Franklin, Cháulio R. Ferreira, Wenli Li:
An efficient GPU multiple-observer siting method based on sparse-matrix multiplication. BigSpatial@SIGSPATIAL 2014: 54-63 - [c27]Wenli Li, W. Randolph Franklin, Daniel N. Benedetti, Salles V. G. Magalhães:
Parallel multiple observer siting on terrain. SIGSPATIAL/GIS 2014: 489-492 - [c26]Salles V. G. Magalhães, W. Randolph Franklin, Wenli Li, Marcus V. A. Andrade:
Fast map generalization heuristic with a uniform grid. SIGSPATIAL/GIS 2014: 613-616 - [c25]Guilherme C. Pena, Marcus V. A. Andrade, Salles V. G. Magalhães, W. Randolph Franklin, Cháulio R. Ferreira:
An Improved Parallel Algorithm Using GPU for Siting Observers on Terrain. ICEIS (1) 2014: 367-375 - 2013
- [c24]Cháulio Ferreira, Marcus V. A. Andrade, Salles V. G. Magalhães, W. Randolph Franklin, Guilherme C. Pena:
A Parallel Sweep Line Algorithm for Visibility Computation. GEOINFO 2013: 85-96 - 2012
- [j27]Tsz-Yam Lau, W. Randolph Franklin:
Automated artifact-free seafloor surface reconstruction with two-step ODETLAP. ACM SIGSPATIAL Special 4(3): 8-13 (2012) - [c23]Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Guilherme C. Pena:
A New Method for Computing the Drainage Network Based on Raising the Level of an Ocean Surrounding the Terrain. AGILE Conf. 2012: 391-407 - [c22]Thiago L. Gomes, Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, Guilherme C. Pena:
Computing the drainage network on huge grid terrains. BigSpatial@SIGSPATIAL 2012: 53-60 - [c21]Cháulio Ferreira, Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin, André M. Pompermayer:
More efficient terrain viewshed computation on massive datasets using external memory. SIGSPATIAL/GIS 2012: 494-497 - 2011
- [j26]Marcus V. A. Andrade, Salles V. G. Magalhães, Mirella A. Magalhães, W. Randolph Franklin, Barbara Cutler:
Efficient viewshed computation on terrain in external memory. GeoInformatica 15(2): 381-397 (2011) - [j25]Christopher Stuetzle, W. Randolph Franklin, Barbara Cutler, Mehrad Kamalzare, Zhongxian Chen, Thomas Zimmie:
Measuring terrain distances through extracted channel networks. ACM SIGSPATIAL Special 3(3): 21-26 (2011) - 2010
- [j24]You Li, Tsz-Yam Lau, Christopher Stuetzle, Peter Fox, W. Randolph Franklin:
3D oceanographic data compression using 3D-ODETLAP. ACM SIGSPATIAL Special 2(3): 7-12 (2010) - [j23]Zhongyi Xie, W. Randolph Franklin, Daniel M. Tracy:
Slope preserving lossy terrain compression. ACM SIGSPATIAL Special 2(3): 19-24 (2010) - [c20]Zhongxian Chen, Christopher Stuetzle, Barbara Cutler, Jared Gross, W. Randolph Franklin, Thomas Zimmie:
Quantitative analysis of simulated erosion for different soils. GIS 2010: 482-485 - [c19]Salles V. G. Magalhães, Marcus V. A. Andrade, W. Randolph Franklin:
An optimization heuristic for siting observers in huge terrains stored in external memory. HIS 2010: 135-140
2000 – 2009
- 2009
- [j22]Christopher Stuetzle, W. Randolph Franklin, Barbara Cutler:
Evaluating hydrology preservation of simplified terrain representations. ACM SIGSPATIAL Special 1(1): 51-56 (2009) - [c18]Tsz-Yam Lau, You Li, Zhongyi Xie, W. Randolph Franklin:
Sea floor bathymetry trackline surface fitting without visible artifacts using ODETLAP. GIS 2009: 508-511 - 2008
- [c17]Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Randolph Franklin, Daniel M. Tracy, Marcus V. A. Andrade:
Parallel ODETLAP for terrain compression and reconstruction. GIS 2008: 17 - [c16]Daniel M. Tracy, W. Randolph Franklin, Barbara Cutler, Franklin T. Luk, Marcus V. A. Andrade:
Path planning on a compressed terrain. GIS 2008: 56 - [c15]W. Randolph Franklin, Daniel M. Tracy, Marcus V. A. Andrade, Jonathan Muckell, Metin Inanc, Zhongyi Xie, Barbara Cutler:
Slope Accuracy and Path Planning on Compressed Terrain. SDH 2008: 335-349 - 2007
- [c14]W. Randolph Franklin, Metin Inanc, Zhongyi Xie, Daniel M. Tracy, Barbara Cutler, Marcus V. A. Andrade:
Smugglers and border guards: the GeoStar project at RPI. GIS 2007: 30 - 2005
- [c13]Wm. Randolph Franklin:
Nearest Point Query on 184M Points in E3 with a Uniform Grid. CCCG 2005: 239-242 - 2003
- [c12]W. Randolph Franklin:
Mass Properties of the Union of Millions of Identical Cubes. Geometric and Algorithmic Aspects of Computer-Aided Design and Manufacturing 2003: 329-345 - [c11]Michael B. Gousie, Wm. Randolph Franklin:
Constructing a dem from grid-based data by computing intermediate contours. GIS 2003: 71-77 - 2001
- [c10]Hélio Pedrini, William Robson Schwartz, W. Randolph Franklin:
Automatic extraction of topographic features using adaptive triangular meshes. ICIP (3) 2001: 732-735 - [c9]George Nagy, Tong Zhang, W. Randolph Franklin, Eric Landis, Edwin Nagy, Denis T. Keane:
Volume and Surface Area Distributions of Cracks in Concrete. IWVF 2001: 759-768
1990 – 1999
- 1999
- [r1]Ileana Streinu, Károly Bezdek, János Pach, Tamal K. Dey, Jianer Chen, Dina Kravets, Nancy M. Amato, W. Randolph Franklin:
Discrete And Computational Geometry. Handbook of Discrete and Combinatorial Mathematics 1999 - 1995
- [j21]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): 107-117 (1995) - [c8]Wm. Randolph Franklin:
Compressing Elevation Data. SSD 1995: 385-404 - 1993
- [c7]Wm. Randolph Franklin, Mohan S. Kankanhalli:
Volumes From Overlaying 3-D Triangulations in Parallel. SSD 1993: 477-489 - 1992
- [j20]Chandrasekhar Narayanaswami, Wm. Randolph Franklin:
Edge Intersection on the Hypercube Computer. Inf. Process. Lett. 41(5): 257-262 (1992) - [c6]Chandrasekhar Narayanaswami, Wm. Randolph Franklin:
Boolean Combinations of Polygons in Parallel. ICPP (3) 1992: 131-135 - 1991
- [j19]Chandrasekhar Narayanaswami, Wm. Randolph Franklin:
Determination of mass properties of polygonal CSG objects in parallel. Int. J. Comput. Geom. Appl. 1(4): 381-403 (1991) - [c5]Chandrasekhar Narayanaswami, Wm. Randolph Franklin:
Determination of mass properties of polygonal CSG objects in parallel. Symposium on Solid Modeling and Applications 1991: 279-288 - 1990
- [j18]Peter Y. F. Wu, Wm. Randolph Franklin:
A logic programming approach to cartographic map overlay. Comput. Intell. 6: 61-70 (1990) - [c4]Wm. Randolph Franklin, Mohan S. Kankanhalli:
Parallel object-space hidden surface removal. SIGGRAPH 1990: 87-94
1980 – 1989
- 1989
- [j17]Varol Akman, Wm. Randolph Franklin:
Representing objects as rays, or how to pile up an octree? Comput. Graph. 13(3): 373-379 (1989) - [j16]Varol Akman, Wm. Randolph Franklin:
Ray representation for k-trees. Pattern Recognit. Lett. 10(5): 315-320 (1989) - [j15]Wm. Randolph Franklin:
Art Gallery Theorems and Algorithms (Joseph O'Rourke). SIAM Rev. 31(2): 342-343 (1989) - 1988
- [j14]Wm. Randolph Franklin, Varol Akman:
Adaptive Grid for Polyhedral Visibility in Object Space: An Implementation. Comput. J. 31(1): 56-60 (1988) - 1987
- [j13]Wm. Randolph Franklin, Varol Akman:
A Simple and Efficient Haloed Line Algorithm for Hidden Line Elimination. Comput. Graph. Forum 6(2): 103-109 (1987) - [c3]Wm. Randolph Franklin:
Polygon Properties Calculated from the Vertex Neighborhoods. SCG 1987: 110-118 - 1986
- [j12]Wm. Randolph Franklin, Varol Akman:
Reconstructing Visible Regions from Visible Segments. BIT 26(4): 430-441 (1986) - [j11]W. Randolph Franklin, Peter Y. F. Wu, Sumitro Samaddar, Margaret Nichols:
Prolog and Geometry Projects. IEEE Computer Graphics and Applications 6(11): 46-55 (1986) - [j10]Varol Akman, Wm. Randolph Franklin:
On the question "Is Sigma (between 1 and n) root a1 =< L?". Bull. EATCS 28: 16-19 (1986) - 1985
- [j9]W. Randolph Franklin, Varol Akman:
Building an Octree from a Set of Parallelepipeds. IEEE Computer Graphics and Applications 5(10): 58-64 (1985) - [j8]Wm. Randolph Franklin, Varol Akman, Colin Verrilli:
Voronoi diagrams with barriers and on polyhedra for minimal path planning. Vis. Comput. 1(2): 133-150 (1985) - 1984
- [j7]Wm. Randolph Franklin:
A simpler iterative solution to the Towers of Hanoi problem. ACM SIGPLAN Notices 19(8): 87-88 (1984) - 1983
- [j6]Wm. Randolph Franklin:
Software aspects of business graphics. Comput. Graph. 7(1): 5-12 (1983) - [j5]W. Randolph Franklin:
Rays - New representation for polygons and polyhedra. Comput. Vis. Graph. Image Process. 22(3): 327-338 (1983) - [j4]Wm. Randolph Franklin:
Efficient Iterated Rotation of an Object. IEEE Trans. Computers 32(11): 1064-1067 (1983) - 1982
- [j3]Wm. Randolph Franklin:
On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors. Commun. ACM 25(5): 336-337 (1982) - [j2]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): 7-14 (1982) - 1980
- [c2]Wm. Randolph Franklin:
A linear time exact hidden surface algorithm. SIGGRAPH 1980: 117-123
1970 – 1979
- 1979
- [j1]Wm. Randolph Franklin:
Padded Lists: Set Operations in Expected Theta(log log N) Time. Inf. Process. Lett. 9(4): 161-166 (1979) - 1978
- [c1]W. Randolph Franklin, Harry R. Lewis:
3-D graphic display of discrete spatial data by prism maps. SIGGRAPH 1978: 70-75
Coauthor Index
aka: Marcus V. A. Andrade
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
