• Title Algorithms and Data Structures With Applications to Graphics and Geometry
• Author(s) Jurg Nievergelt, Klaus Hinrichs
• Publisher: Prentice Hall (August 1992); eBook (Creative Commons Licensed, 2011)
• License(s): CC BY 3.0
• Paperback 336 pages
• eBook PDF (371 Pages)
• Language: English
• ISBN-10: 0134894286
• ISBN-13: 978-0134894287
• Share This:  

Book Description

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

Based on the authors' extensive teaching of algorithms and data structures, this text aims to show a sample of the intellectual demands required by a computer science curriculum, and to present issues and results of lasting value, ideas that will outlive the current generation of computers. Sample exercises, many with solutions, are included throughout the book.

• N/A

• Amazon

• Data Structures and Algorithms
• Graph Theory
• Geometry and Topology
• Computational Complexity
• Operations Research (OR), Linear Programming, Optimization, and Approximation

• Algorithms and Data Structures With Applications to Graphics and Geometry
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• The Mirror Site (3) - PDF

• Graph Theory - Advanced Algorithms and Applications

  Not only will the methods and explanations help you to understand more about graph theory, but you will find it joyful to discover ways that you can apply graph theory in your applications or scientific research.

• Algorithmic Graph Theory (David Joyner, et al)

  This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. It's especially suitable for computer scientists and mathematicians interested in computational complexity.

• Graph Algorithms: Practical Examples in Apache Spark and Neo4j

  This book is a practical guide to getting started with graph algorithms for developers and data scientists who have experience using Apache Spark or Neo4j. You'll walk through hands-on examples that show you how to use graph algorithms in Apache Spark/Neo4j.

• Digraphs: Theory, Algorithms and Applications (J. Bang-Jensen)

  This book is an essential, comprehensive reference of Digraphs covering the theoretical aspects of the subject, focus on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem.

• Lists, Decisions and Graphs - With an Introduction to Probability

  In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT).

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne

  It surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the book. We motivate each algorithm that we address by examining its impact on specific applications.