BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR92-185
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Algorithms for Closest Point Problems: Practice and Theory
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Su, Peter
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1992
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR92-185.pdf
ABSTRACT::
	This paper describes and evaluates know sequential algorithms
for constructing planar Voronoi diagrams and Delaunay triangulations.
In addition, it describes a new incremental algorithm which is simple
to understand and implement, but whose performance is competitive with
all known methods.  The experiments in this paper are more than just
simple benchmarks, they evaluate the expected performance of the
algorithms in a precise and machine independent fashion.  Thus, the
paper also illustrates how to use experimental tools to both
understand the behaviour of different algorithms and to guide the
algorithm design process.
END:: ncstrl.dartmouthcs//TR92-185