Material Detail

Algorithms and Data Structures With Applications to Graphics and Geometry

Algorithms and Data Structures With Applications to Graphics and Geometry

An introductory coverage of algorithms and data structures with application to graphics and geometry. Table of Contents Part I: Programming environments for motion, graphics, and geometry Chapter 1: Reducing a task to given primitives: programming motion Chapter 2: Graphics primitives and environments Chapter 3: Algorithm animation Part II: Programming concepts: beyond notation Chapter 4: Algorithms and programs as literature: substance and form Chapter 5: Divide-and-conquer and recursion. Chapter 6: Syntax Chapter 7: Syntax analysis Part III: Objects, algorithms, programs. Chapter 8: Truth values, the data type 'set', and bit acrobatics Chapter 9: Ordered sets Chapter 10: Strings Chapter 11: Matrices and graphs: transitive closure Chapter 12: Integers Chapter 13: Reals Chapter 14: Straight... Show More

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.