Fundamental Algorithms for Computer Graphics

1. Front Matter

   Pages I-16

   PDF

2. Line and Area Algorithms

   1. Front Matter

      Pages 17-17

      PDF

   2. Invited Papers

      1. Theoretical and Linguistic Methods for Describing Straight Lines

         • Reyer Brons

         Pages 19-57

      2. Run Length Slice Algorithm for Incremental Lines

         • Jack E. Bresenham

         Pages 59-104

      3. The Relationship between Euclid’s Algorithms and Run-Length Encoding

         • M. L. V. Pitteway

         Pages 105-112

      4. Antialiasing in Practice

         • A. R. Forrest

         Pages 113-134

   3. Submitted Papers

      1. An Application of Euclid’s Algorithm to Drawing Straight Lines

         • C. M. A. Castle, M. L. V. Pitteway

         Pages 135-139

      2. The Accuracy of the Digital Representation of a Straight Line

         • Leo Dorst

         Pages 141-152

      3. Experience in Practical Implementation of Boundary-Defined Area Fill

         • A. C. Gay

         Pages 153-160

      4. The implementation of fill area for GKS

         • C. J. Cartledge, G. H. Weeks

         Pages 161-185

      5. A Simple Algorithm for Determining Whether a Point Resides within an Arbitrarily Shaped Polygon

         • Andrew P. Surany

         Pages 187-193

3. Arcs, Circles and Conics

   1. Front Matter

      Pages 195-195

      PDF

   2. Invited Papers

      1. Algorithms for Circular Arc Generation

         • Jack E. Bresenham

         Pages 197-217

      2. Algorithms of Conic Generation

         • M. L. V. Pitteway

         Pages 219-237

   3. Submitted Papers

      1. A High Precision Digital Differential Analyzer for Circle Generation

         • Tao Hong

         Pages 239-256

      2. An Ellipse-Drawing Algorithm for Raster Displays

         • Michael R. Kappel

         Pages 257-280

      3. An Algorithm for Determining the Draw Start Point of a Hyperbola given the System Direction of Draw and the Coordinates of the Video Window

         • Andrew P. Surany

         Pages 281-285

4. Curves and Curve Drawing

   1. Front Matter

      Pages 287-287

      PDF

   2. Invited Papers

      1. A Review of Curve Drawing Algorithms

         • R. A. Earnshaw

         Pages 289-301

      2. Methods for Drawing Curves

         • K. W. Brodlie

         Pages 303-323

Algorithms provide the basic foundation for all computational processes. This volume presents algorithms at the foundational level and also at the various levels between this level and the user application. Some of these algorithms are classical and have become well established in the field. This material is therefore a rich source of information and is still relevant and up to date. The basic primitives of computer graphics have remained unchanged: lines, circles, conics, curves and characters. This volume contains reference material in all these areas. The higher levelsof contouring and surface drawing are also well covered. Developments in hardware architectures have continued since the first printing, but the basic principles of hardware/software trade-offs remain valid. This reprint is being published as a Study Edition to make the material more accessible to students and researchers in the field of computer graphics andits applications. The continuing popularity of the original book demonstrates the value and timeliness of its contents.

• Algorithmen
• CAD
• Computer-Animation
• Software
• algorithms
• animation
• architecture
• computational geometry
• computer animation
• computer graphics
• geometrische Algorithmen
• algorithm analysis and problem complexity
• Engineering Economics

• University Computing Service, University of Leeds, Leeds, UK

  Rae A. Earnshaw

Policies and ethics