Robert L. (Scot) Drysdale III
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| c16 |      | |
| 2010 | ||
| j22 | | 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 | ||
| j21 | | 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 | ||
| j20 | | 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) |
| j19 | | 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 | ||
| j18 | | 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 | ||
| j17 | | 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 | ||
| j16 | | 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 | ||
| j15 | | |
| j14 | | 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) |
| c11 | | Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin: 2-point site Voronoi diagrams. Symposium on Computational Geometry 2001: 323-324 |
| 1999 | ||
| c10 | | Gill Barequet, Matthew Dickerson, Robert L. (Scot) Drysdale III: 2-Point Site Voronoi Diagrams. WADS 1999: 219-230 |
| 1997 | ||
| j13 | | 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) |
| j12 | | Emo Welzl, Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. Comput. Geom. 7: 361-385 (1997) |
| j11 | | Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997) |
| 1996 | ||
| j10 | | |
| 1995 | ||
| c9 | | Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. Symposium on Computational Geometry 1995: 61-70 |
| 1994 | ||
| c8 | | Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 1994: 211-220 |
| 1992 | ||
| j9 | | 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 | ||
| c7 | | Barry Schaudt, Robert L. (Scot) Drysdale III: Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract). Symposium on Computational Geometry 1991: 214-223 |
| c6 | | Matthew Dickerson, Robert L. (Scot) Drysdale III: Enumerating k Distances for n Points in the Plane. Symposium on Computational Geometry 1991: 234-238 |
| 1990 | ||
| j8 | | 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 |
| 1989 | ||
| j7 | | Robert L. (Scot) Drysdale III, Robert B. Jerard, Barry Schaudt, Ken Hauck: Discrete Simulation of NC Machining. Algorithmica 4(1): 33-60 (1989) |
| j6 | | 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) |
| j5 | | 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 | ||
| c4 | | Robert L. (Scot) Drysdale III, Robert B. Jerard: Discrete Simulation of NC Machining. Symposium on Computational Geometry 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. Symposium on Computational Geometry 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) |
| 1975 | ||
| j1 | | Robert L. (Scot) Drysdale III, Frank H. Young: Improved Divide/Sort/Merge Sorting Networks. SIAM J. Comput. 4(3): 264-270 (1975) |
Colors in the list of coauthors
Last update Tue May 21 10:09:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page