Summary: I/O­E#cient Construction of Constrained
Delaunay Triangulations
Pankaj K. Agarwal 1# , Lars Arge 2,1## , and Ke Yi 1# # #
1 Department of Computer Science, Duke University, Durham, NC 27708, USA.
{pankaj,large,yike}@cs.duke.edu
2 Department of Computer Science, University of Aarhus, Aarhus, Denmark.
large@daimi.au.dk
Abstract. In this paper, we designed and implemented an I/O­e#cient
algorithm for constructing constrained Delaunay triangulations. If the
number of constraining segments is smaller than the memory size, our
algorithm runs in expected O( N
B log M/B
N
B ) I/Os for triangulating N
points in the plane, where M is the memory size and B is the disk block
size. If there are more constraining segments, the theoretical bound does
not hold, but in practice the performance of our algorithm degrades
gracefully. Through an extensive set of experiments with both synthetic
and real data, we show that our algorithm is significantly faster than
existing implementations.

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

Collections: Computer Technologies and Information Sciences