Tool for drawing Voronoi diagrams of points and segments
(requires Java 5.0)
Office: 248 Sudikoff
Phone: (603) 646-2101
email: scot *at* cs *dot* dartmouth *dot* edu
Research Interests:
My main research area is algorithms, primarily
computational geometry. Much of my work has dealt with
computing a structure called the Voronoi diagram and its
geometric dual, the Delaunay Triangulation.
I have also worked on Numerical Control (NC) machining.
Recently I have been working on approximating polygonal chains by arcs and biarcs and finding properties of and algorithms to compute the farthest-segment Voronoi diagram.
Tool for drawing Voronoi diagrams of points and segments
(requires Java 5.0)
Slides for a Grad Student Seminar talk Giving Technical Talks
Back to Dartmouth CS Home Page