© 1990 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Quadtree Algorithms for Contouring Functions of Two Variables
School of Computing Sciences, University of Technology, Sydney, P.O. Box 123, Broadway, NSW 2007, Australia
Two grid-based algorithms are presented for contouring functions of two variables over square plotting areas. The algorithms are simple to code, and achieve considerable efficiency through the use of quadtree techniques to produce non-uniform subdivisions of the plotting areas. One algorithm uses curvature properties of the functions being plotted to produce plotting cells of optimal size, and their relative speeds depend on the complexity of the functions. Both algorithms can be adapted for plotting over rectangular area.
Received February 1988. revised April 1989.
* School of Computing Sciences, University of Technology, Sydney, P.O. Box 123, Broadway, NSW 2007, Australia