Fundamental Algorithms for Computer Graphics: NATO Advanced Study Institute directed by J.E. Bresenham, R.A. Earnshaw, M.L.V. Pitteway: Springer Study Edition
J.E. Bresenham Editat de Rae Earnshaw R.A. Earnshaw, M.L.V. Pittewayen Limba Engleză Paperback – 18 noi 1991
Din seria Springer Study Edition
-
Preț: 356.75 lei -
Preț: 284.93 lei -
Preț: 388.04 lei -
Preț: 489.45 lei - 23%
Preț: 997.12 lei -
Preț: 384.68 lei -
Preț: 388.04 lei -
Preț: 374.91 lei - 15%
Preț: 483.42 lei -
Preț: 374.91 lei - 5%
Preț: 1079.33 lei - 5%
Preț: 356.31 lei -
Preț: 390.81 lei - 15%
Preț: 510.17 lei -
Preț: 383.23 lei - 5%
Preț: 354.73 lei - 15%
Preț: 608.59 lei -
Preț: 377.84 lei - 15%
Preț: 566.01 lei - 20%
Preț: 635.44 lei - 20%
Preț: 637.96 lei - 15%
Preț: 616.15 lei - 15%
Preț: 629.18 lei -
Preț: 375.65 lei - 15%
Preț: 627.62 lei -
Preț: 379.89 lei - 15%
Preț: 617.25 lei - 15%
Preț: 662.38 lei - 15%
Preț: 617.57 lei - 15%
Preț: 610.63 lei -
Preț: 381.55 lei - 18%
Preț: 858.56 lei -
Preț: 403.20 lei -
Preț: 407.24 lei - 18%
Preț: 714.21 lei - 15%
Preț: 629.98 lei - 20%
Preț: 323.23 lei -
Preț: 382.30 lei
Preț: 362.86 lei
Preț vechi: 453.58 lei
-20% Nou
Puncte Express: 544
Preț estimativ în valută:
64.20€ • 75.48$ • 56.23£
64.20€ • 75.48$ • 56.23£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540543978
ISBN-10: 354054397X
Pagini: 1060
Ilustrații: XVI, 1042 p. 13 illus.
Dimensiuni: 170 x 244 x 56 mm
Greutate: 1.65 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Springer Study Edition
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354054397X
Pagini: 1060
Ilustrații: XVI, 1042 p. 13 illus.
Dimensiuni: 170 x 244 x 56 mm
Greutate: 1.65 kg
Ediția:1991
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Springer Study Edition
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.