Overview
Access this book
Other ways to access
About this book
The aim of this book is to provide a mathematical background to techniques in computer graphics, to develop a graphics program in C implementing these techniques, and to illustrate the use of C stressing portability and speed. As a result, many students and professionals will find this presentation will give them a thorough understanding of the most fundamental algorithms in graphics programming as well as to provide with them a usable graphics package. Readers are assumed to be moderately familiar with programming though all type definitions, global variables, and macros are described thoroughly before their first applications. Whilst ray-tracing is not covered, the book does cover: hidden surfaces, shadows, reflections, patterns, and modelling curves and surfaces.
Similar content being viewed by others
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
Accessibility Information
PDF accessibility summary
This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
Bibliographic Information
Book Title: Fast Algorithms for 3D-Graphics
Authors: Georg Glaeser
DOI: https://doi.org/10.1007/978-1-4612-2664-2
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag New York, Inc. 1994
eBook ISBN: 978-1-4612-2664-2Published: 06 December 2012
Edition Number: 1
Number of Pages: 306
Number of Illustrations: 26 b/w illustrations
Topics: Computer Graphics, Algorithm Analysis and Problem Complexity