I/O-Efficient Construction of Constrained Delaunay Triangulations

  • Pankaj K. Agarwal
  • Lars Arge
  • Ke Yi
Conference paper

DOI: 10.1007/11561071_33

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)
Cite this paper as:
Agarwal P.K., Arge L., Yi K. (2005) I/O-Efficient Construction of Constrained Delaunay Triangulations. In: Brodal G.S., Leonardi S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg

Abstract

In this paper, we designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations. If the number of constraining segments is smaller than the memory size, our algorithm runs in expected \(O(\frac{N}{B}{\rm log}_{M/B}\frac{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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pankaj K. Agarwal
    • 1
  • Lars Arge
    • 1
    • 2
  • Ke Yi
    • 1
  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA
  2. 2.Department of Computer ScienceUniversity of AarhusAarhusDenmark

Personalised recommendations