default search action
Robert L. Scot Drysdale
Person information
- affiliation: Dartmouth College, Hanover, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [c16]Robert L. Scot Drysdale:
Mathematical induction is a recursive technique. SIGCSE 2011: 269-274 - 2010
- [j25]Kim B. Bruce, Robert D. Cupper, Robert L. Scot Drysdale:
A History of the Liberal Arts Computer Science Consortium and its Model Curricula. ACM Trans. Comput. Educ. 10(1): 3:1-3:12 (2010)
2000 – 2009
- 2009
- [j24]David P. Wagner, Robert L. Scot Drysdale, Clifford Stein:
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. Comput. Geom. 42(5): 376-387 (2009) - 2008
- [j23]Robert L. Scot Drysdale, Günter Rote, Astrid Sturm
:
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. Comput. Geom. 41(1-2): 31-47 (2008) - [j22]Robert L. Scot Drysdale, Asish Mukhopadhyay:
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. Inf. Process. Lett. 105(2): 47-51 (2008) - 2006
- [b2]Kenneth P. Bogart, Clifford Stein, Robert L. Scot Drysdale:
Discrete mathematics for computer science. Mathematics accross the curriculum, Key College Publishing 2006, ISBN 978-1-930190-86-3, pp. I-XX, 1-425 - [j21]Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser:
Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100(6): 220-225 (2006) - [c15]Asish Mukhopadhyay, Robert L. Scot Drysdale:
An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. CCCG 2006 - 2005
- [c14]Robert L. Scot Drysdale, Clifford Stein, David P. Wagner:
An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. CCCG 2005: 97-100 - [c13]Robert L. Scot Drysdale, Judith Hromcik, David Reed, Reg Hahne:
The year in review: changes and lessons learned in the design and implementation of the AP CS exam in Java. SIGCSE 2005: 323-324 - 2003
- [j20]Kim B. Bruce, Robert L. Scot Drysdale, Charles Kelemen, Allen B. Tucker:
Why math? Commun. ACM 46(9): 40-44 (2003) - [c12]Robert L. Scot Drysdale, Judith Hromcik, Mark Allen Weiss, Reg Hahne:
Java in the morning...Java in the evening...Java in 2004. SIGCSE 2003: 271-272 - 2002
- [j19]Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III:
2-Point site Voronoi diagrams. Discret. Appl. Math. 122(1-3): 37-54 (2002) - 2001
- [j18]Robert L. Scot Drysdale:
Phenotypic Data in FlyBase. Briefings Bioinform. 2(1): 68-80 (2001) - [j17]Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink
On exclusion regions for optimal triangulations. Discret. Appl. Math. 109(1-2): 49-65 (2001) - [c11]Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin:
2-point site Voronoi diagrams. SCG 2001: 323-324
1990 – 1999
- 1999
- [c10]Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III:
2-Point Site Voronoi Diagrams. WADS 1999: 219-230 - 1997
- [j16]Shawn P. Austin, Robert B. Jerard, Robert L. Scot Drysdale:
Comparison of discretization algorithms for surfaces with application to numerically controlled machining. Comput. Aided Des. 29(1): 71-83 (1997) - [j15]Peter Su, Robert L. (Scot) Drysdale III:
A Comparison of Sequential Delaunay Triangulation Algorithms. Comput. Geom. 7: 361-385 (1997) - [j14]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997) - 1996
- [j13]Robert L. Scot Drysdale:
What Should We Teach? ACM Comput. Surv. 28(4es): 96 (1996) - 1995
- [c9]Peter Su, Robert L. (Scot) Drysdale III:
A Comparison of Sequential Delaunay Triangulation Algorithms. SCG 1995: 61-70 - 1994
- [c8]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. SCG 1994: 211-220 - 1992
- [j12]Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack:
Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. Int. J. Comput. Geom. Appl. 2(3): 221-239 (1992) - 1991
- [c7]Barry Schaudt, Robert L. (Scot) Drysdale III:
Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract). SCG 1991: 214-223 - [c6]Matthew Dickerson, Robert L. (Scot) Drysdale III:
Enumerating k Distances for n Points in the Plane. SCG 1991: 234-238 - [e1]Robert L. Scot Drysdale:
Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, NH, USA, , June 10-12, 1991. ACM 1991, ISBN 0-89791-426-0 [contents] - 1990
- [j11]Matthew Dickerson, Robert L. (Scot) Drysdale III:
Fixed-Radius Near Neighbors Search Algorithms for Points and Segments. Inf. Process. Lett. 35(5): 269-273 (1990) - [c5]Robert L. (Scot) Drysdale III:
A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions. SODA 1990: 159-168
1980 – 1989
- 1989
- [j10]Robert L. (Scot) Drysdale III, Robert B. Jerard, Barry Schaudt, Kenneth E. Hauck:
Discrete Simulation of NC Machining. Algorithmica 4(1): 33-60 (1989) - [j9]Robert B. Jerard, Robert L. (Scot) Drysdale III, Kenneth E. Hauck, Barry Schaudt, John Magewick:
Methods for detecting errors in numerically controlled machining of sculptured surfaces. IEEE Computer Graphics and Applications 9(1): 26-39 (1989) - [j8]Robert L. (Scot) Drysdale III, Jerzy W. Jaromczyk:
A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems. Inf. Process. Lett. 32(6): 301-303 (1989) - [j7]Robert B. Jerard, S. Z. Hussaini, Robert L. (Scot) Drysdale III, Barry Schaudt:
Approximate methods for simulation and verification of numerically controlled machining programs. Vis. Comput. 5(6): 329-348 (1989) - 1988
- [j6]Robert L. Scot Drysdale, Henry F. Korth, Allen B. Tucker:
Computer Science in Liberal Arts Colleges. Comput. Sci. Educ. 1(1): 11-35 (1988) - [j5]Mark Sherman, Robert L. Scot Drysdale:
Teaching Software Engineering in a Workstation Environment. IEEE Softw. 5(3): 68-76 (1988) - 1987
- [c4]Robert L. (Scot) Drysdale III, Robert B. Jerard:
Discrete Simulation of NC Machining. SCG 1987: 126-135 - 1986
- [j4]Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986) - 1985
- [j3]James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas:
Finding Extremal Polygons. SIAM J. Comput. 14(1): 134-147 (1985) - [c3]L. Paul Chew, Robert L. (Scot) Drysdale III:
Voronoi diagrams based on convex distance functions. SCG 1985: 235-244 - 1984
- [c2]Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. STACS 1984: 43-54 - 1982
- [c1]James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas:
Finding Extremal Polygons. STOC 1982: 282-289 - 1981
- [j2]D. T. Lee, Robert L. (Scot) Drysdale III:
Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput. 10(1): 73-87 (1981)
1970 – 1979
- 1979
- [b1]Robert L. Scot Drysdale:
Generalized Voronoi diagrams and geometric searching. Stanford University, USA, 1979 - 1975
- [j1]Robert L. (Scot) Drysdale III, Frank H. Young:
Improved Divide/Sort/Merge Sorting Networks. SIAM J. Comput. 4(3): 264-270 (1975)
Coauthor Index
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-09-09 00:18 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: