Algorithms and Data Structures
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.
KeywordsVoronoi Diagram Delaunay Triangulation Priority Queue Interior Edge Convex Quadrilateral
Unable to display preview. Download preview PDF.