3 Review(s)

This book provides students and programmers with practical and relatively simple methods for solving basic problems from the fields of computational geometry and computer graphics. By covering a number of key problems and solutions, the author provides an introduction to these fields that is both interesting and accessible to the reader. Key Features Fully functioning, object-oriented C++ implementations of practical data structures and algorithms. Coverage of the fundamentals of the design and analysis of algorithms, data structures, and geometric data structures as they relate to computational geometry and computer graphics methods. Intuitive discussions, complemented by numerous examples and figures. Table of Contents Preface. PART I: Basics Introduction. Analysis of Algorithms. Data Structures. Geometric Data Structures. PART II: Applications Incremental Insertion. Incremental Selection. Plane-Sweep Algo-rithms. Divide-And-Conquer Algorithms. Spatial Subdivision Methods. Bibliography. Index.