My Account
Log in Registration
All
Cart
Highlights
Fiction Books
Non-Fiction Books
Children's Books
Rare Books
Music
DVD & Blu-Ray
Video Games
Category
Wishlists
Cart
All
Free US shipping over $10
Trustpilot
Proud to be B-Corp

Computational Geometry and Computer Graphics in C++ Michael Laszlo

Computational Geometry and Computer Graphics in C++ By Michael Laszlo

Computational Geometry and Computer Graphics in C++ by Michael Laszlo

Reviews:
$9.55
Condition - Good
Only 1 left
GoodWell Read

Summary

Appropriate for undergraduate courses in Computational Geometry and/or Computer Graphics. This book describes basic problems in computer graphics and computational geometry, and presents methods for solving them, using these problems and solutions as an introduction to the fields of Computational Geometry and Computer Graphics.

Faster Shipping

Get this product faster from our US warehouse

Computational Geometry and Computer Graphics in C++ Summary

Computational Geometry and Computer Graphics in C++ by Michael Laszlo

Appropriate for undergraduate courses in Computational Geometry and/or Computer Graphics.

This book describes some basic problems in computer graphics and computational geometry, and presents some practical methods for solving them, using these problems and solutions as an introduction to the fields of Computational Geometry and Computer Graphics. Introducting the reader to the design and analysis of algorithms provides the framework for studying the algorithms covered in the text.

Table of Contents

I. BASICS.

1. Introduction.

Framework. Our Use of the C++ Language. Robustness.

2. Analysis of Algorithms.

Models of Computation. Complexity Measures. Asymptotic Analysis. Analysis of Recursive Algorithms. Problem Complexity. Chapter Notes. Exercises.

3. Data Structures.

What are Data Structures? Linked Lists. Lists. Stacks. Binary Search Trees. Braided Binary Search Trees. Randomized Search Trees. Chapter Notes. Exercises.

4. Geometric Data Structures.

Vectors. Points. Polygons. Edges. Geometric Objects in Space. Finding the Intersection of a Line and a Triangle. Chapter Notes. Exercises.

II. APPLICATIONS.

5. Incremental Insertion.

Insertion Sort. Finding Star-Shaped Polygons. Finding Convex Hulls: Insertion Hull. Point Enclosure: The Ray-Shooting Method. Point Enclosure: The Signed Angle Method. Line Clipping: The Cyrus-Beck Algorithm. Polygon Clipping: The Sutherland-Hodgman Algorithm. Triangulating Monotone Polygons. Chapter Notes. Exercises.

6. Incremental Selection.

Selection Sort. Finding Convex Hulls: Gift-Wrapping. Finding Complex Hulls: Graham Scan. Removing Hidden Surfaces: The Depth-Sort Algorithm. Intersection of Convex Polygons. Finding Delaunay Triangulations. Chapter Notes. Exercises.

7. Plane-Sweep Algorithms.

Finding the Intersections of Line Segments. Finding Convex Hulls: Insertion Hull Revisited. Contour of the Union of Rectangles. Decomposing Polygons into Monotone Pieces. Chapter Notes. Exercises.

8. Divide-and-Conquer Algorithms.

Merge Sort. Computing the Intersection of Half-Planes. Finding the Kernel of a Polygon. Finding Voronoi Regions. Merge Hull. Closest Points. Polygon Triangulation. Chapter Notes. Exercises.

9. Spatial Subdivision Methods.

The Range Searching Problem. The Grid Method. Quadtrees. Two-Dimensional Search Trees. Removing Hidden Surfaces: Binary Space Partition Trees. Chapter Notes. Exercises.

Bibliography.
Index.

Additional information

CIN0132908425G
9780132908429
0132908425
Computational Geometry and Computer Graphics in C++ by Michael Laszlo
Michael Laszlo
Used - Good
Paperback
Pearson Education (US)
19951205
266
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a used book - there is no escaping the fact it has been read by someone else and it will show signs of wear and previous use. Overall we expect it to be in good condition, but if you are not entirely satisfied please get in touch with us

Customer Reviews - Computational Geometry and Computer Graphics in C++