Algorithms and Data Structures

  • Armin Iske
Part of the Lecture Notes in Computational Science and Engineering book series (LNCSE, volume 37)


Much of the following discussion in this work relies on standard tools from computational geometry,approximationtheory,and computer programming. For the reader’s convenience, relevant material concerning required algorithms and data structures is composed in this chapter, which helps to keep this work widely self-contained. Moreover, notational preparations are done, and various useful auxiliary results are given.


Voronoi Diagram Delaunay Triangulation Priority Queue Interior Edge Convex Quadrilateral 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Armin Iske
    • 1
  1. 1.Lehrstuhl Numerische Mathematik und Wissenschaftliches RechnenTechnische Universität MünchenGarchingGermany

Personalised recommendations