Fundamental Algorithms for Computer Graphics -

Fundamental Algorithms for Computer Graphics

NATO Advanced Study Institute directed by J.E. Bresenham, R.A. Earnshaw, M.L.V. Pitteway

Rae Earnshaw (Herausgeber)

Buch | Softcover
XVI, 1042 Seiten
1991 | 1991
Springer Berlin (Verlag)
978-3-540-54397-8 (ISBN)
53,49 inkl. MwSt
Proceedings of the NATO Advanced Study Institute on "Fundamental Algorithms for Computer Graphics" held at Ilkley, Yorkshire, England, March 30 - April 12, 1985
Algorithms provide the basic foundation for allcomputational processes. This volume presents algorithms atthe foundational level and also at the various levelsbetween this level and the user application. Some of thesealgorithms are classical and have become well established inthe field. This material is therefore a rich source ofinformation and is still relevant and up to date. The basicprimitives of computer graphics have remained unchanged:lines, circles, conics, curves and characters. This volumecontains reference material in all these areas. The higherlevelsof contouring and surface drawing are also wellcovered. Developments in hardware architectures havecontinued since the first printing, but the basic principlesof hardware/software trade-offs remain valid. This reprintis being published as a Study Edition to make the materialmore accessible to students and researchers in the field ofcomputer graphics andits applications. The continuingpopularity of the original book demonstrates the value andtimeliness of its contents.

Section 1. Line and Area Algorithms.- Invited Papers.- "Theoretical and Linguistic Methods for Describing Straight Lines".- "Run Length Slice Algorithm for Incremental Lines".- "The Relationship between Euclid's Algorithm and Run-Length Encoding".- "Antialiasing in Practice".- Submitted Papers.- "An Application of Euclid's Algorithm to Drawing Straight Lines".- "The Accuracy of the Digital Representation of a Straight Line".- "Experience in Practical Implementation of Boundary-Defined Area Fill".- "The Implementation of Fill Area for GKS".- "A Simple Algorithm for Determining whether a Point Resides within an Arbitrarily Shaped Polygon".- Section 2. Arcs, Circles and Conics.- Invited Papers.- "Algorithms for Circular Arc Generation".- "Algorithms of Conic Generation".- Submitted Papers.- "A High-Precision Digital Differential Analyzer for Circle Generation".- "An Ellipse-Drawing Algorithm for Raster Displays".- "An Algorithm for Determining the Draw Start Point of a Hyperbola given the System Direction of Draw and the Coordinates of the Video Window".- Section 3. Curves and Curve Drawing.- Invited Papers.- "A Review of Curve Drawing Algorithms".- "Methods for Drawing Curves".- Submitted Paper.- "Generation of ?-Spline Curves using a Recurrence Relation".- Section 4. Character Generation and Display.- Invited Papers.- "Character Generation and Display".- "Font Information and Device-Independent Output".- Section 5. Contouring and Surface Drawing.- Invited Papers.- "Contouring - the State of the Art".- "A Review of Geostatistical Techniques for Contouring".- "Algorithms for Three-Dimensional Interpolation between Planar Slices".- Submitted Papers.- "GENSURF: A System forGeneral Surface Definition and Manipulation".- "An Interesting Modification to the Bresenham Algorithm for Hidden-Line Solution".- "Efficient Hidden Line Removal for Surface Plots Utilising Raster Graphics".- Section 6. Hardware Architectures and Algorithms.- Invited papers.- "Graphics Software Standards and their Evolution with Hardware Algorithms".- "Hardware Enhancements for Raster Graphics".- "Systolic Array Architectures for High Performance CAD/CAM Workstations".- "Parallel Architectures for High Performance Graphics Systems".- Section 7. Computational Geometry and CAD.- Invited Paper.- "Computational Geometry in Practice".- Submitted Papers.- "An Algorithm for Direct Display of CSG Objects by Spatial Subdivision".- "Computational Geometry and Prolog".- "Subdivision Techniques for Processing Geometric Objects".- Section 8. Theoretical Aspects and Models.- Invited Papers.- "Random Fractal Forgeries".- "The Algebra of Algorithms".- "Theoretical Considerations in Algorithm Design".- "Technology for the Protection of Graphics Algorithms".- "Spatial Concepts in 3D".- Submitted Papers.- "Shortest Paths in 3-Space, Voronoi Diagrams with Barriers, and Related Complexity and Algebraic Issues".- "Geometric Data Structures for Computer Graphics".- "A Model for Raster Graphics Language Primitives".- "Theoretical Framework for Shape Representation and Analysis".- Section 9. Human-Computer Interface Issues.- Invited Papers.- "Aspects of Human Machine Interface".- "Visual Perception and Computer Graphics".- Section 10. Computer Animation.- Invited Paper.- "Object and Movement Description Techniques for Animation - An Informal Review".- Scientific Organising Committee.- Lecturers.-Participants.

Erscheint lt. Verlag 18.11.1991
Reihe/Serie Springer Study Edition
Mitarbeit Sonstige Mitarbeit: J.E. Bresenham, R.A. Earnshaw, M.L.V. Pitteway
Zusatzinfo XVI, 1042 p. 13 illus.
Verlagsort Berlin
Sprache englisch
Maße 170 x 244 mm
Gewicht 1785 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Mathematik / Informatik Informatik Theorie / Studium
Informatik Weitere Themen CAD-Programme
Mathematik / Informatik Mathematik Analysis
Schlagworte Algorithm analysis and problem complexity • Algorithmen • algorithms • Animation • Architecture • CAD • Computational Geometry • Computer Animation • Computer-Animation • Computer Graphics • Engineering Economics • Geometrische Algorithmen • Software
ISBN-10 3-540-54397-X / 354054397X
ISBN-13 978-3-540-54397-8 / 9783540543978
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Einführung in die Geometrische Produktspezifikation

von Daniel Brabec; Ludwig Reißler; Andreas Stenzel

Buch | Softcover (2023)
Europa-Lehrmittel (Verlag)
20,70