# Robert L. Scot Drysdale

Affiliations:- Dartmouth College, Hanover, USA

According to our database

Collaborative distances:

^{1}, Robert L. Scot Drysdale authored at least 38 papers between 1975 and 2011.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2011

Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

2010

A History of the Liberal Arts Computer Science Consortium and its Model Curricula.

ACM Trans. Comput. Educ., 2010

2009

An O(n<sup>5/2</sup>logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions.

Comput. Geom., 2009

2008

An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points.

Inf. Process. Lett., 2008

Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs.

Comput. Geom., 2008

2006

Inf. Process. Lett., 2006

An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points.

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Discrete mathematics for computer science.

Mathematics accross the curriculum, Key College Publishing, ISBN: 978-1-930190-86-3, 2006

2005

The year in review: changes and lessons learned in the design and implementation of the AP CS exam in Java.

Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

An O(n<sup>5/2</sup>log n) Algorithm for the Rectilinear Minimum Link-Distance Problem.

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2003

Commun. ACM, 2003

Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

2002

Discret. Appl. Math., 2002

2001

Discret. Appl. Math., 2001

Briefings Bioinform., 2001

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

1997

Comput. Geom., 1997

Comput. Geom., 1997

Comparison of discretization algorithms for surfaces with application to numerically controlled machining.

Comput. Aided Des., 1997

1996

ACM Comput. Surv., 1996

1992

Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors.

Int. J. Comput. Geom. Appl., 1992

1991

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Inf. Process. Lett., 1990

A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions.

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

Approximate methods for simulation and verification of numerically controlled machining programs.

Vis. Comput., 1989

A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems.

Inf. Process. Lett., 1989

Methods for detecting errors in numerically controlled machining of sculptured surfaces.

IEEE Computer Graphics and Applications, 1989

Algorithmica, 1989

1988

IEEE Softw., 1988

Comput. Sci. Educ., 1988

1987

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

SIAM J. Comput., 1986

1985

SIAM J. Comput., 1985

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1981

SIAM J. Comput., 1981

1979

PhD thesis, 1979

1975

SIAM J. Comput., 1975