Skip to main content
  • Book
  • © 1994

Fast Algorithms for 3D-Graphics

Authors:

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xi
  2. Projections

    • Georg Glaeser
    Pages 25-56
  3. How to Describe Three-Dimensional Objects

    • Georg Glaeser
    Pages 57-94
  4. Graphics Output

    • Georg Glaeser
    Pages 95-124
  5. A Fast Hidden-Surface Algorithm

    • Georg Glaeser
    Pages 125-154
  6. Advanced Features

    • Georg Glaeser
    Pages 155-184
  7. Hidden-Line Removal

    • Georg Glaeser
    Pages 185-200
  8. Mathematical Curves and Surfaces

    • Georg Glaeser
    Pages 201-232
  9. Spline Curves and Spline Surfaces

    • Georg Glaeser
    Pages 233-254
  10. Computer-Generated Movies

    • Georg Glaeser
    Pages 255-266
  11. Back Matter

    Pages 267-306

About this book

In this book, a variety of algoritbms are described that may be of interest to everyone who writes software for 3D-graphics. It is a book that haB been written for programmers at an intermediate level as well aB for experienced software engineers who simply want to have some particular functions at their disposal, without having to think too much about details like special cases or optimization for speed. The programming language we use is C, and that has many advantages, because it makes the code both portable and efficient. Nevertheless, it should be possible to adapt the ideas to other high-level programming languages. The reader should have a reasonable knowledge of C, because sophisticated pro­ grams with economical storage household and fast sections cannot be written without the use of pointers. You will find that in the long run it is just aB easy to work with pointer variables as with multiple arrays . .Aß the title of the book implies, we will not deal with algorithms that are very computation-intensive such as ray tracing or the radiosity method. Furthermore, objects will always be (closed or not closed) polyhedra, which consist of a certain number of polygons.

Authors and Affiliations

  • Hochschule für Angewandte Kunst, Wien, Austria

    Georg Glaeser

Bibliographic Information

  • Book Title: Fast Algorithms for 3D-Graphics

  • Authors: Georg Glaeser

  • DOI: https://doi.org/10.1007/978-3-662-25798-2

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1994

  • Softcover ISBN: 978-3-540-94288-7Published: 01 January 1995

  • eBook ISBN: 978-3-662-25798-2Published: 10 December 2013

  • Edition Number: 2

  • Number of Pages: XI, 306

  • Number of Illustrations: 126 b/w illustrations

  • Topics: Computer Graphics

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access