Skip to content

    Read more about Algorithms and Data Structures With Applications to Graphics and Geometry

    Algorithms and Data Structures With Applications to Graphics and Geometry

    (1 review)

    Jurg Nievergelt, ETH Zurich

    Klaus Hinrichs, University of Muenster

    Copyright Year:

    Publisher: Global Text Project

    Language: English

    Formats Available

    Conditions of Use

    Attribution Attribution
    CC BY


    Learn more about reviews.

    Reviewed by Stephan Olariu, Professor, Old Dominion University on 6/20/17

    This book is not intended to be a comprehensive introduction to algorithms and data structures. For this, there are other books. Instead, the authors have focused on a smattering of fundamental topics that provide the student with tools for the... read more

    Table of Contents

    Part I: Programming environments for motion, graphics, and geometry

    • 1. Reducing a task to given primitives: programming motion
    • 2. Graphics primitives and environments
    • 3. Algorithm animation

    Part II: Programming concepts: beyond notation

    • 4. Algorithms and programs as literature: substance and form
    • 5. Divide-and-conquer and recursion.
    • 6. Syntax
    • 7. Syntax analysis

    Part III: Objects, algorithms, programs.

    • 8. Truth values, the data type 'set', and bit acrobatics
    • 9. Ordered sets
    • 10. Strings
    • 11. Matrices and graphs: transitive closure
    • 12. Integers
    • 13. Reals
    • 14. Straight lines and circles

    Part IV: Complexity of problems and algorithms

    • 15. Computability and complexity
    • 16. The mathematics of algorithm analysis
    • 17. Sorting and its complexity

    Part V: Data structures

    • 18. What is a data structure?
    • 19. Abstract data types
    • 20. Implicit data structures
    • 21. List structures
    • 22. Address computation
    • 23. Metric data structures

    Part VI: Interaction between algorithms and data structures: case studies in geometric computation

    • 24. Sample problems and algorithms
    • 25. Plane-sweep: a general-purpose algorithm for two-dimensional problems illustrated using line segment intersection
    • 26. The closest pair

    Ancillary Material

    Submit ancillary resource

    About the Book

    An introductory coverage of algorithms and data structures with application to graphics and geometry.

    About the Contributors


    Jürg Nievergelt has been full Professor of Computer Science at the ETH Zurich from 1975 until his retirement in 2003. J. Nievergelt received a degree in mathematics from the ETH in 1962, and a Ph.D. in mathematics from the University of Illinois in 1965. From 1965-77 he was on the faculty of Computer Science at the University of Illinois at Urbana-Champaign, from assistant professor to full professor. Since 1975 professor of computer science at ETH Zurich. On leave from ETH 1985-89 he was Kenan Professor and chairman of the Computer Science Dept. at the Univ. of North Carolina at Chapel Hill. Visiting appointments include NTT's Yokosuka Electrical Communications Lab, Visiting IBM Professor at Keio University, and Visiting Professor at the National University of Singapore. He is a Fellow of ACM, IEEE and AAAS. Research Interests: Algorithms and data structures; interactive systems; user interfaces; heuristic and exhaustive search, parallel computation.

    Klaus Hinrichs, Professor at University of Muenster.

    Contribute to this Page

    Suggest an edit to this book record