Error title
Some error text about your books and stuff.
Close

Computational Geometry and Computer Graphics in C++

by Michael J. Laszlo

  • ISBN: 9780132908429
  • ISBN10: 0132908425

Computational Geometry and Computer Graphics in C++

by Michael J. Laszlo

  • List Price: $125.40
  • Binding: Hardcover
  • Edition: 1
  • Publisher: Prentice Hall
  • Publish date: 06/01/1996
  • ISBN: 9780132908429
  • ISBN10: 0132908425
used Add to Cart $6.70
You save: 95%
Marketplace Item
new Add to Cart $88.52
You save: 29%
Marketplace Item
Description: 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.
Expand description
Seller Condition Comments Price  
Seller: DFTP
Location: DAYTON, OH
Condition: Good
Shipping Icon
0132908425 Choose Expedited Shipping for fastest delivery! Used Texts May
[...]
Price:
$6.70
Comments:
0132908425 Choose Expedited Shipping for fastest delivery! Used Texts May
[...]
Seller: HPB-Emerald
Location: Dallas, TX
Condition: Good
Shipping Icon
Connecting readers with great books since 1972. Used books may not include
[...]
Price:
$11.23
Comments:
Connecting readers with great books since 1972. Used books may not include
[...]
Seller: Ergodebooks
Location: Richmond, TX Ask seller a question
Condition: Good
Buy with confidence. Excellent Customer Service & Return policy.Ships Fast. 24*7 Customer Service.
Price:
$14.95
Comments:
Buy with confidence. Excellent Customer Service & Return policy.Ships Fast. 24*7 Customer Service.
Seller: One Stop Shop Bookstore
Location: Memphis, TN
Condition: Good
Shipping Icon
Price:
$28.35
Comments:
Seller: Ergodebooks
Location: Richmond, TX Ask seller a question
Condition: New
Buy with confidence. Excellent Customer Service & Return policy.Ships Fast. 24*7 Customer Service.
Price:
$88.52
Comments:
Buy with confidence. Excellent Customer Service & Return policy.Ships Fast. 24*7 Customer Service.
please wait
Please Wait

Notify Me When Available

Enter your email address below,
and we'll contact you when your school adds course materials for
.
Enter your email address below, and we'll contact you when is back in stock (ISBN: ).