NOTICE: This version of the NSF Unidata web site (archive.unidata.ucar.edu) is no longer being updated.
Current content can be found at unidata.ucar.edu.
To learn about what's going on, see About the Archive Site.
NOTICE: This version of the NSF Unidata web site (archive.unidata.ucar.edu) is no longer being updated.
Current content can be found at unidata.ucar.edu.
To learn about what's going on, see About the Archive Site.
> > I'm happy to do the legwork, but am having trouble finding where the > > relevant areas of code are. I'd really appreciate an overview of the > > contour labelling algorithm and event structure, and also a description > > of how the current contour fitting algorithm works. > > Actually, contours are composed of straight lines across > each grid box. Say it is drawing the "10" contour. It finds > two adjacent grid points above and below the value 10, then > find the point on the connecting edge where the grid point > values interpolate to 10. There must be 2 (or 4) edges with > such interpolated 10 points in a grid box, and a straight > line is drawn between them (2 straight lines for 4 points). No worries. I had done some Googling, and this grid method for finding contour edges seems to be fairly common. I suppose improvements would come from finer grids, and more complex line-drawing. I'll do this as a data renderer for now, and if I'm successful I'll post back. Thanks for the pointers, -Tennessee
visad archives: