vincent@ditsyda.oz (David A. Vincent) (02/15/89)
Jim Cathey replies to a request by Ross Yahnke for a fill algorithm that isn't too stack intensive. The discussion reminded me of another possibly useful reference, part of an old book that I learned a lot about graphics from. Here's the reference, pulled from the CSIRO Radiophysics library catalogue... AUTHOR: Foley, J.D. TITLE: Fundamentals of interactive computer graphics / James D. Foley [and] Andries Van Dam IMPRINT: Reading, Mass. : Addison-Wesley, 1982 PHYSICAL FEATURES: xx, 664 p., [12] p. of plates : ill. NOTES: Bibliography: p. 625-653. Index: p.655-644 OTHER AUTHORS, ETC: Van Dam, A. SUBJECTS: Computer graphics (U) * INTERACTIVE COMPUTING SYSTEMS (U) * Interactive computer systems (U) * UDC Subjects: 681.3 * UDC Subjects: 681.3.022 * UDC Subjects: 519.688C LC CARD: 80-24311 ISBN: 0201144689 CATALOGUING SOURCE NUMBER: MD06762 I seem to remember a chapter or section on fill algorithms, with discussion of the problems of recursion and a variety of algorithms that used recursion to various degrees. Perhaps this will help. David A. Vincent vacation student, CSIRO Division of IT ACSnet: vincent@ditsyda.oz Post: GPO Box 1710-T Phone (w): +61 2 887 9383 Hobart TAS 7001 FidoNet: 3:670/700 Australia ---------------------------------------------------------------- Irrationality is the square root of all evil. - D R Hofstadter