Users will learn how to solve problems in computer graphics recognize geometric problems and select the most suitable data structure for developing computer graphics algorithms c tappert choice magazine november 2006 data structures are an indispensable tool in computer graphics they help to make complex tasks easy and lead to . Ment animation etc and students from both computer graphics and computational geometry possibly working on a master or phd thesis syllabus our goal is to familiarize practitioners and researchers in computer graphics with some very versatile and ubiquitous geometric data structures enable them to readily recognize geometric problems . In recent years geometric data structures from computational geometry have been widely adopted by computer graphics designers in computational geometry it is often necessary to process geometric objects into simple structures so that operations on the objects can be performed easily and efficiently. In computational geometry many sophisticated data structures have been designed for storing geometric objects many of these structures might be very useful for solving a number of problems in computer graphics and hence it is important that people in computer graphics know these data structures. The goal of this tutorial is to present a wide range of geometric data structures algorithms and techniques from computational geometry to computer graphics practitioners to achieve this goal we introduce several data structures discuss their complexity point out construction schemes and the corresponding performance and present standard applications in two and three dimensions
How it works:
1. Register Trial Account.
2. Download The Books as you like ( Personal use )