Logo

Algorithms and Data Structures: With Applications to Graphics and Geometry

Large book cover: Algorithms and Data Structures: With Applications to Graphics and Geometry

Algorithms and Data Structures: With Applications to Graphics and Geometry
by

Publisher: Prentice Hall
ISBN/ASIN: 0134894286
Number of pages: 299

Description:
Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures - case studies in geometric computation.

Download or read it online for free here:
Download link
(3.3MB, PDF)

Similar books

Book cover: A=BA=B
by - AK Peters, Ltd.
The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.
(26702 views)
Book cover: Algorithms: Fundamental TechniquesAlgorithms: Fundamental Techniques
by - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(17093 views)
Book cover: Introduction to Design Analysis of AlgorithmsIntroduction to Design Analysis of Algorithms
by - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.
(12892 views)
Book cover: Knapsack Problems: Algorithms and Computer ImplementationsKnapsack Problems: Algorithms and Computer Implementations
by - John Wiley & Sons
The book on exact and approximate algorithms for a number of important problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes knapsack problems such as binary, bounded, unbounded or binary multiple.
(18276 views)