![]() | ![]() |
Robert L. (Scot) Drysdale III
List of publications from the DBLP Bibliography Server - FAQ
| 2011 | ||
|---|---|---|
| 38 | Robert L. Scot Drysdale: Mathematical induction is a recursive technique. SIGCSE 2011: 269-274 | |
| 2010 | ||
| 37 | Kim B. Bruce, Robert D. Cupper, Robert L. Scot Drysdale: A History of the Liberal Arts Computer Science Consortium and its Model Curricula. TOCE 10(1): (2010) | |
| 2009 | ||
| 36 | 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 | ||
| 35 | 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) | |
| 34 | 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 | ||
| 33 | 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 | |
| 32 | Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser: Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100(6): 220-225 (2006) | |
| 2005 | ||
| 31 | 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 | |
| 30 | 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 | ||
| 29 | 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 | |
| 28 | Kim B. Bruce, Robert L. Scot Drysdale, Charles Kelemen, Allen B. Tucker: Why math? Commun. ACM 46(9): 40-44 (2003) | |
| 2002 | ||
| 27 | Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III: 2-Point site Voronoi diagrams. Discrete Applied Mathematics 122(1-3): 37-54 (2002) | |
| 2001 | ||
| 26 | Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin: 2-point site Voronoi diagrams. Symposium on Computational Geometry 2001: 323-324 | |
| 25 | Robert L. Scot Drysdale: Phenotypic Data in FlyBase. Briefings in Bioinformatics 2(1): 68-80 (2001) | |
| 24 | Robert L. (Scot) Drysdale III, Scott A. McElfresh, Jack Snoeyink: On exclusion regions for optimal triangulations. Discrete Applied Mathematics 109(1-2): 49-65 (2001) | |
| 1999 | ||
| 23 | Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III: 2-Point Site Voronoi Diagrams. WADS 1999: 219-230 | |
| 1997 | ||
| 22 | Emo Welzl, Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. Comput. Geom. 7: 361-385 (1997) | |
| 21 | Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997) | |
| 20 | Shawn P. Austin, Robert B. Jerard, Robert L. Scot Drysdale: Comparison of discretization algorithms for surfaces with application to numerically controlled machining. Computer-Aided Design 29(1): 71-83 (1997) | |
| 1996 | ||
| 19 | Robert L. Scot Drysdale: What Should We Teach? ACM Comput. Surv. 28(4es): 96 (1996) | |
| 1995 | ||
| 18 | Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. Symposium on Computational Geometry 1995: 61-70 | |
| 1994 | ||
| 17 | Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 1994: 211-220 | |
| 1992 | ||
| 16 | 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. Geometry Appl. 2(3): 221-239 (1992) | |
| 1991 | ||
| 15 | Barry Schaudt, Robert L. (Scot) Drysdale III: Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract). Symposium on Computational Geometry 1991: 214-223 | |
| 14 | Matthew Dickerson, Robert L. (Scot) Drysdale III: Enumerating k Distances for n Points in the Plane. Symposium on Computational Geometry 1991: 234-238 | |
| 1990 | ||
| 13 | Robert L. (Scot) Drysdale III: A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions. SODA 1990: 159-168 | |
| 12 | 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) | |
| 1989 | ||
| 11 | Robert L. (Scot) Drysdale III, Robert B. Jerard, Barry Schaudt, Ken Hauck: Discrete Simulation of NC Machining. Algorithmica 4(1): 33-60 (1989) | |
| 10 | 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) | |
| 9 | Robert B. Jerard, S. Z. Hussaini, Robert L. (Scot) Drysdale III, Barry Schaudt: Approximate methods for simulation and verification of numerically controlled machining programs. The Visual Computer 5(6): 329-348 (1989) | |
| 1987 | ||
| 8 | Robert L. (Scot) Drysdale III, Robert B. Jerard: Discrete Simulation of NC Machining. Symposium on Computational Geometry 1987: 126-135 | |
| 1986 | ||
| 7 | Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986) | |
| 1985 | ||
| 6 | L. Paul Chew, Robert L. (Scot) Drysdale III: Voronoi diagrams based on convex distance functions. Symposium on Computational Geometry 1985: 235-244 | |
| 5 | 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) | |
| 1984 | ||
| 4 | Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. STACS 1984: 43-54 | |
| 1982 | ||
| 3 | James E. Boyce, David P. Dobkin, Robert L. (Scot) Drysdale III, Leonidas J. Guibas: Finding Extremal Polygons STOC 1982: 282-289 | |
| 1981 | ||
| 2 | D. T. Lee, Robert L. (Scot) Drysdale III: Generalization of Voronoi Diagrams in the Plane. SIAM J. Comput. 10(1): 73-87 (1981) | |
| 1975 | ||
| 1 | Robert L. (Scot) Drysdale III, Frank H. Young: Improved Divide/Sort/Merge Sorting Networks. SIAM J. Comput. 4(3): 264-270 (1975) | |
| 1 | Franz Aurenhammer | [32] |
| 2 | Shawn P. Austin | [20] |
| 3 | Gill Barequet | [23] [26] [27] |
| 4 | James E. Boyce | [3] [5] |
| 5 | Kim B. Bruce | [28] [37] |
| 6 | Bernard Chazelle | [4] [7] |
| 7 | L. Paul Chew | [6] |
| 8 | Robert D. Cupper | [37] |
| 9 | Matthew Dickerson (Matthew T. Dickerson) | [12] [14] [16] [17] [21] [23] [26] [27] |
| 10 | David P. Dobkin | [3] [5] |
| 11 | David S. Guertin | [26] |
| 12 | Leonidas J. Guibas | [3] [5] |
| 13 | Reg Hahne | [29] [30] |
| 14 | Ken Hauck | [11] |
| 15 | Judith Hromcik | [29] [30] |
| 16 | S. Z. Hussaini | [9] |
| 17 | Jerzy W. Jaromczyk | [10] |
| 18 | Robert B. Jerard | [8] [9] [11] [20] |
| 19 | Charles Kelemen | [28] |
| 20 | Hannes Krasser | [32] |
| 21 | D. T. Lee (Der-Tsai Lee) | [2] [4] [7] |
| 22 | Scott A. McElfresh | [17] [21] [24] |
| 23 | Asish Mukhopadhyay | [33] [34] |
| 24 | David Reed | [30] |
| 25 | Günter Rote | [35] |
| 26 | Jörg-Rüdiger Sack | [16] |
| 27 | Barry Schaudt | [9] [11] [15] |
| 28 | Jack Snoeyink | [24] |
| 29 | Clifford Stein | [31] [36] |
| 30 | Astrid Sturm | [35] |
| 31 | Peter Su | [18] [22] |
| 32 | Allen B. Tucker | [28] |
| 33 | David P. Wagner | [31] [36] |
| 34 | Mark Allen Weiss | [29] |
| 35 | Emo Welzl | [17] [21] [22] |
| 36 | Frank H. Young | [1] |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page