Robert L. (Scot) Drysdale III
List of publications from the
2008 |
34 | EE | 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) |
33 | EE | 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 |
32 | EE | 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 |
31 | EE | Franz Aurenhammer,
Robert L. Scot Drysdale,
Hannes Krasser:
Farthest line segment Voronoi diagrams.
Inf. Process. Lett. 100(6): 220-225 (2006) |
2005 |
30 | EE | 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 |
29 | EE | 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 |
28 | EE | 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 |
27 | EE | Kim B. Bruce,
Robert L. Scot Drysdale,
Charles Kelemen,
Allen B. Tucker:
Why math?
Commun. ACM 46(9): 40-44 (2003) |
2002 |
26 | | 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 |
25 | EE | Gill Barequet,
Robert L. Scot Drysdale,
Matthew Dickerson,
David S. Guertin:
2-point site Voronoi diagrams.
Symposium on Computational Geometry 2001: 323-324 |
24 | | Robert L. Scot Drysdale:
Phenotypic Data in FlyBase.
Briefings in Bioinformatics 2(1): 68-80 (2001) |
23 | | 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 |
22 | EE | Gill Barequet,
Matthew Dickerson,
Robert L. (Scot) Drysdale III:
2-Point Site Voronoi Diagrams.
WADS 1999: 219-230 |
1997 |
21 | | Emo Welzl,
Peter Su,
Robert L. (Scot) Drysdale III:
A Comparison of Sequential Delaunay Triangulation Algorithms.
Comput. Geom. 7: 361-385 (1997) |
20 | | Matthew Dickerson,
Robert L. (Scot) Drysdale III,
Scott A. McElfresh,
Emo Welzl:
Fast Greedy Triangulation Algorithms.
Comput. Geom. 8: 67-86 (1997) |
19 | EE | 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 |
18 | | Robert L. Scot Drysdale:
What Should We Teach?
ACM Comput. Surv. 28(4es): 96 (1996) |
1995 |
17 | EE | Peter Su,
Robert L. (Scot) Drysdale III:
A Comparison of Sequential Delaunay Triangulation Algorithms.
Symposium on Computational Geometry 1995: 61-70 |
1994 |
16 | EE | Matthew Dickerson,
Robert L. (Scot) Drysdale III,
Scott A. McElfresh,
Emo Welzl:
Fast Greedy Triangulation Algorithms.
Symposium on Computational Geometry 1994: 211-220 |
1992 |
15 | | 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 |
14 | EE | Barry Schaudt,
Robert L. (Scot) Drysdale III:
Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract).
Symposium on Computational Geometry 1991: 214-223 |
13 | EE | Matthew Dickerson,
Robert L. (Scot) Drysdale III:
Enumerating k Distances for n Points in the Plane.
Symposium on Computational Geometry 1991: 234-238 |
1990 |
12 | | Robert L. (Scot) Drysdale III:
A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions.
SODA 1990: 159-168 |
11 | | 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 |
10 | | Robert L. (Scot) Drysdale III,
Robert B. Jerard,
Barry Schaudt,
Ken Hauck:
Discrete Simulation of NC Machining.
Algorithmica 4(1): 33-60 (1989) |
9 | | 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) |
8 | | 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 |
7 | EE | Robert L. (Scot) Drysdale III,
Robert B. Jerard:
Discrete Simulation of NC Machining.
Symposium on Computational Geometry 1987: 126-135 |
1986 |
6 | | Bernard Chazelle,
Robert L. (Scot) Drysdale III,
D. T. Lee:
Computing the Largest Empty Rectangle.
SIAM J. Comput. 15(1): 300-315 (1986) |
1985 |
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) |