Robert L. Scot Drysdale

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.

[BibT_eX]

[DOI]

Kim B. Bruce

Robert D. Cupper

ACM Trans. Comput. Educ., 2010

2009

An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions.

[BibT_eX]

[DOI]

David P. Wagner

Clifford Stein

Comput. Geom., 2009

2008

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

[BibT_eX]

[DOI]

Asish Mukhopadhyay

Inf. Process. Lett., 2008

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

[BibT_eX]

[DOI]

Günter Rote

Astrid Sturm

Comput. Geom., 2008

2006

Farthest line segment Voronoi diagrams.

[BibT_eX]

[DOI]

Franz Aurenhammer

Hannes Krasser

Inf. Process. Lett., 2006

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

[BibT_eX]

[DOI]

Asish Mukhopadhyay

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

Discrete mathematics for computer science.

[BibT_eX]

Kenneth P. Bogart

Clifford Stein

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.

[BibT_eX]

[DOI]

Judith Hromcik

David Reed

Reg Hahne

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

An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem.

[BibT_eX]

[DOI]

Clifford Stein

David P. Wagner

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

2003

Why math?

[BibT_eX]

[DOI]

Kim B. Bruce

Charles Kelemen

Allen B. Tucker

Commun. ACM, 2003

Java in the morning...Java in the evening...Java in 2004.

[BibT_eX]

[DOI]

Judith Hromcik

Mark Allen Weiss

Reg Hahne

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

2002

2-Point site Voronoi diagrams.

[BibT_eX]

[DOI]

Gill Barequet

Matthew T. Dickerson

Discret. Appl. Math., 2002

2001

On exclusion regions for optimal triangulations.

[BibT_eX]

[DOI]

Scott A. McElfresh

Jack Snoeyink

Discret. Appl. Math., 2001

Phenotypic Data in FlyBase.

[BibT_eX]

[DOI]

Briefings Bioinform., 2001

2-point site Voronoi diagrams.

[BibT_eX]

[DOI]

Gill Barequet

David S. Guertin

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

1997

A Comparison of Sequential Delaunay Triangulation Algorithms.

[BibT_eX]

[DOI]

Peter Su

Comput. Geom., 1997

Fast Greedy Triangulation Algorithms.

[BibT_eX]

[DOI]

Scott A. McElfresh

Emo Welzl

Comput. Geom., 1997

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

[BibT_eX]

[DOI]

Shawn P. Austin

Comput. Aided Des., 1997

1996

What Should We Teach?

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

1992

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

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

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

1991

Multiplicatively Weighted Crystal Growth Voronoi Diagrams (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Enumerating k Distances for n Points in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Fixed-Radius Near Neighbors Search Algorithms for Points and Segments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

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

[BibT_eX]

[DOI]

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

1989

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

[BibT_eX]

[DOI]

S. Z. Hussaini

Vis. Comput., 1989

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

[BibT_eX]

[DOI]

Jerzy W. Jaromczyk

Inf. Process. Lett., 1989

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

[BibT_eX]

[DOI]

Kenneth E. Hauck

John Magewick

IEEE Computer Graphics and Applications, 1989

Discrete Simulation of NC Machining.

[BibT_eX]

[DOI]

Kenneth E. Hauck

Algorithmica, 1989

1988

Teaching Software Engineering in a Workstation Environment.

[BibT_eX]

[DOI]

Mark Sherman

IEEE Softw., 1988

Computer Science in Liberal Arts Colleges.

[BibT_eX]

[DOI]

Henry F. Korth

Allen B. Tucker

Comput. Sci. Educ., 1988

1987

Discrete Simulation of NC Machining.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Computing the Largest Empty Rectangle.

[BibT_eX]

[DOI]

Bernard Chazelle

D. T. Lee

SIAM J. Comput., 1986

1985

Finding Extremal Polygons.

[BibT_eX]

[DOI]

James E. Boyce

David P. Dobkin

Leonidas J. Guibas

SIAM J. Comput., 1985

Voronoi diagrams based on convex distance functions.

[BibT_eX]

[DOI]

L. Paul Chew

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1981

Generalization of Voronoi Diagrams in the Plane.

[BibT_eX]

[DOI]

D. T. Lee

SIAM J. Comput., 1981

1979

Generalized Voronoi diagrams and geometric searching.

[BibT_eX]

[DOI]

PhD thesis, 1979

1975

Improved Divide/Sort/Merge Sorting Networks.

[BibT_eX]

[DOI]