This textbook on computational geometry traces the field's evolution from algorithm design in the late 1970s to its establishment as a distinct discipline. It simplifies modern algorithmic solutions for various applications, making it suitable for both coursework and self-study, appealing to a broad audience interested in geometric algorithms.
This tutorial survey brings together two lines of research and development whose interaction promises to have significant practical impact on the area of spatial information processing in the near future: geographic information systems (GIS) and geometric computation or, more particularly, geometric algorithms and spatial data structures. In nine uniformly structured and coherent chapters, the authors present a unique survey ranging from the history and basic characteristics to current issues of precision and robustness of geometric computing. This textbook is ideally suited for advanced courses on GIS and applied geometric algorithms. Research and design professionals active in the area will find it valuable as a state-of-the-art survey.
This volume constitutes the refereed proceedings of the 19th International Symposium on Graph Drawing, GD 2010, held in Eindhoven, The Netherlands, during September 2011. The 34 revised full papers presented together with 3 revised short and 6 poster papers were carefully reviewed and selected from 88 submissions. Furthermore, the proceedings contain the abstracts of two invited talks and to commemorate Kozo Sugiyama and his pioneering research in graph drawing, the proceedings include an obituary. A unique and fun part of the symposium is the Graph Drawing Contest, which is part of the Graph Drawing Challenge. This year was the 18th edition. A report on the contest is included at the end of the proceedings.