## Image Synthesis: Elementary AlgorithmsImage Synthesis brings together all the basic techniques needed for the production of computer images. Specifically designed to be a practical tool for the user of computer graphics systems, it provides a library of correct algorithms and offers an original set of methodological procedures that will enable a user to solve problems from the particular to the most general level.The book examines the three major classes of image synthesis - curve generation, zone filling, and geometric processing - providing the fundamentals for any image synthesis system. It presents a systematic review of the algorithms needed for each class of problem, highlighting the advantages and disadvantages of each; the algorithms have been written in a descriptive language, allowing the user to program them in whatever language he or she desires.Despite the wide variety of algorithms presented, Hégron draws them together into two unifying procedures, which he discusses in great detail: curve generation based on Bresenham's methods, and contour following. Because these two techniques can be applied to such a diversity of problems, they provide the user with a systematic basis for a software package.Gerard Hégron is a research scientist in the National Institut of Research in Computer Science and Automatic Control (INRIA, France). |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

Curve generation on a surface of dots | 11 |

Zone filling | 73 |

Copyright | |

3 other sections not shown

### Other editions - View all

### Common terms and phrases

abscissa algor angle axial movement Bresenham's algorithm Bresenham's method circle circular arc colour complexity conic sections contour scan convex contour convex polygons coordinates current point curve cutout cutting data structures decomposition defined DELTAY diagonal movement Display point drawing edges beginning edges crossing elementary movements ellipses end endif enddo end endif end endwhile equation filling algorithm filling or hatching GOTO gradient hatching line Hegron horizontal segments hyperbola image synthesis Imax int2 integer line by line line of writing list of edges LIST1 LIST2 LIST3 matrix non-convex polygons non-polygonal contour number of edges obtain octant ootour Pavlidis's algorithm PLOT-QUADRANT pnext points of intersection polygonal contour polygonal window polygonal zones problem processing quadrant scan direction scan line Shamos's singularities starting step straight line segment tangents techniques update user space vertex vertices writing intervals Xinc xmax xmin Yinc ymax ymin zone filling