TweetFollow Us on Twitter

Contour Plotting in Java

Volume Number: 13 (1997)
Issue Number: 9
Column Tag: Javatech

Contour Plotting In Java

by David Rand

Developing a simple, useful applet using Metrowerks CodeWarrior Java


This article discusses a Java applet which plots contours based on a given matrix of floating-point values. The idea is to present an algorithm which is simple enough to be implemented in a few hundred lines of code yet which performs a useful, non-trivial operation. Java is of course multi-platform, but this article focuses on development of the applet on the Macintosh, using Metrowerks CodeWarrior Java (specifically, CW11, which includes version 1.0.2 of the JDK). It is assumed that the reader is at least somewhat familiar with the Java language and the CodeWarrior environment. See, for example, Dave Mark's series of "Getting Started" articles [1] in MacTech magazine.

A contour plot is a convenient way of representing three-dimensional data on a two-dimensional surface such as a map or a computer screen. If you have ever gone hiking and took with you a topographical map indicating the lay of the land, you have used a contour plot. The lines of constant elevation are the contours. If the lines are close together then we have a region of steep slope, whereas widely spaced lines indicate more gradual slope. A closed contour looping back on itself indicates the existence of an extremum - a peak or a depression - somewhere inside the loop. If the extremum is pronounced, i.e. a sharp peak or a deep depression, then several such loops will be nested together concentrically.

The Plotting Algorithm

The algorithm used for contour plotting is taken from a 1978 article by W. V. Snyder [2]. The Java implementation was created by first translating Snyder's Fortran source code manually into C, then reworking the C code to remove the many convoluted goto constructs, and finally manually translating this "unravelled" C code into Java. The second step, necessary because Java does not support goto statements, proved to be the most laborious. This incompatibility should not be considered a limitation of Java; on the contrary, it is a result of the lack of appropriate block structures in old versions of Fortran.

The plotting algorithm can be summarized thus:

a) Given a matrix of floating point values which are the values of a function z = f(x,y) given at the nodes of a grid of x and y values (the grid values are assumed equally spaced, although the horizontal and vertical spacing may differ), the program determines the minimum and maximum values of z and then computes a number of contour values (in this implementation, 10 values) by linear or logarithmic interpolation between the extrema.

b) The program "walks" about the grid of points looking for any segment (i.e. a line joining two adjacent nodes in the grid) which must be crossed by one of the contours because some contour value lies between the values of z at the nodes.

c) Having found such a segment, it finds the intersection point of the contour and the segment by linear interpolation between the nodes. It also stores the information that the current contour value has been located on the current segment, so that this operation will not be repeated.

d) The program then attempts to locate a neighbouring segment having a similar property - that is, crossed by the same contour. If it finds one, it determines the intersection point as in step c) and then draws a straight line segment joining the previous intersection point with the current one. This step is repeated until no such neighbour can be found, taking care to exclude any segment which has already been dealt with.

e) Steps b), c) and d) are repeated until no segment can be found whose intersection with any contour value has not already been processed.

For a more detailed description of steps b) through e) of the algorithm, consult Snyder's article. Note that, as stated in step d), the path of each contour is constructed of linear segments, the simplest method possible. A more sophisticated algorithm, based on bicubic Hermite polynomials, may be found in [3].

The CodeWarrior Project

The Java applet discussed in this article was developed using Metrowerks CodeWarrior Java on a Power Macintosh. Figure 1 shows the window corresponding to the project file named ContourPlotApplet.µ. Figure 2 illustrates the project settings.

Figure 1. The CodeWarrior Project.

Figure 2. The Project Settings.

The project includes an html file, four java files (one for each new class) and the file The settings indicate that the project will generate an applet which will be run using the Metrowerks Java interpreter, and the classes (the applet as well as the three classes which it uses) will have their object code stored in class files in a folder called Classes inside the same folder as the project file. When the project is run, the interpreter will look in the html file for an <APPLET> tag from which it will read the dimensions and parameters of the applet. The html file can also be opened by a Java-enabled web browser to run the applet from within the browser; this will display the entire contents of the html file which may include instructions for using the applet or any related documentation.

Figure 3. The ContourPlotApplet running in the Metrowerks Java interpreter.

Figure 4. The ContourPlotApplet running in Netscape Navigator 3.0 Gold on a Macintosh.

Figure 3 shows the applet running in the Metrowerks Java interpreter. Figure 4 shows the same applet (although using different data) running as part of a page at the web site of the CRM, Université de Montreal; the web server is a unix platform and the web client, as shown in the figure, is Netscape Navigator running on a Power Macintosh. To serve the applet in this way, all that is required in the unix file system is to create a directory called Classes in the same directory as that containing the html file and then to ftp (as raw data) the four class files from the Classes directory on the Macintosh where they were developed to the Classes directory on the unix machine.

Figure 5. The ContourPlotApplet running in Netscape Navigator 3.01 on a unix platform.

As an illustration of platform independence, Figure 5 also shows the applet running in Netscape Navigator on a unix platform. The data here are the same as in Figure 3 except that logarithmic interpolation has been chosen. In addition, the eagle-eyed reader will notice that the character strings - such as the prompt in the upper left corner of the applet, the button, etc. - are in French. This is easily accomplished without modifying the applet, simply by changing the parameters in the <APPLET> tag in the html file. This requires, of course, that any language-dependent elements not be hard-coded in the Java source code. This approach is familiar to Macintosh programmers, who know that strings and such should be stored in an application's resource fork and not hard-coded in the application.

As shown in Figures 3, 4 and 5, there are six user-interface elements in the applet, each implemented as a Java object of some type derived from the Component class. The contour plot is the largest component and is located in the right-hand part of the applet's rectangle. The other five components, all located in the left-hand part, are

  1. The prompt "Matrix of z values:".
  2. The data area in which the user enters the matrix of z values. Each row of the matrix is a list of floating-point values separated by commas and enclosed in brace brackets. Such as {0.5, 1.1, 1.5}. The rows also are separated by commas and the list of rows is enclosed in brace brackets. This format is similar to Mathematica syntax, for example. The rows need not all be of the same length; the program will complete any short rows with the appropriate number of zeroes.
  3. The check box for choosing logarithmic instead of linear interpolation for the computation of the contour values. Logarithmic interpolation is possible only if all the z values are positive. In particular, logarithmic interpolation is unavailable if the rows of the matrix are not all of the same length, because short rows are filled with zeroes.
  4. The "Draw" button. When the user clicks this button, the program parses the matrix in component #2, draws the contour plot if the data is valid, and finally shows some results (or an error message) in component #5.
  5. The results area in which the applet displays some information about the plot just drawn. If the data are not valid for some reason, an error message will appear here. Otherwise, this area will display the number of rows and columns in the grid, the matrix of z values (with some rows extended by zeroes if necessary to make the matrix rectangular), and finally the ten contour values, numbered from 0 through 9.

The Source Code

The source code consists of an html file and four java files, one for each newly defined class. Each file has the same name as the class whose source code it contains, with the extension java appended. Thus the file contains the class ContourPlotApplet, etc. Flanagan [4] is an invaluable reference for information about Java classes predefined in the Java API version 1.0, from which the classes discussed here are derived.

ContourPlotApplet is the main class of the four and is derived from java.applet.Applet. The class ContourPlotLayout is used to layout the user-interface items in the applet's rectangle. ContourPlot contains the code, adapted from Snyder [2], whose task is to draw the applet's most important component, the contour plot itself. Finally, ParseMatrixException is used to signal error conditions corresponding to invalid data.


This html file contains the <APPLET> tag which declares the CODEBASE (that is, the folder where class files are located), the CODE (that is, the name of the applet class), the graphical dimensions of the applet and its parameters. This <APPLET> tag is shown in Listing 1; for brevity, some of the parameters are omitted from the listing.

Listing 1

The <APPLET> tag in ContourPlotApplet.html
    CODE="ContourPlotApplet.class" WIDTH=715 HEIGHT=460>
<PARAM NAME="stringX"          VALUE="Number of rows:">
<PARAM NAME="stringY"          VALUE="Number of columns:">
<PARAM NAME="stringZ"          VALUE="Matrix of z values:">
<PARAM NAME="stringBox"        VALUE="Log interpolation">
<PARAM NAME="stringButton"      VALUE="Draw">
<PARAM NAME="stringResults"    VALUE="Contour values:">
<!- Other parameters here ->

ContourPlotApplet is a container for all the user-interface elements. Its source code is shown in Listing 2. The class starts with a few final static variables (constants) the keyword final indicating that the variable's value may not be changed and the keyword static indicating that it is a class variable, not an instance variable. These are followed by the six user-interface components shown in Figures 3, 4 and 5, and finally a number of static (class) variables which are String objects used to store strings read from the <APPLET> tag and subsequently to display messages in the results area. These data members are followed by the class' three methods init(), handleEvent(Event e) and DrawTheContourPlot() which are explained in the comments in the source code. This last method is the most important and calls several key methods in the ContourPlot object, especially thePlot.paint(Graphics g).

Listing 2
// "ContourPlotApplet" is the main class, that is, the applet,
// which is a container for all the user-interface elements.

import java.awt.*;

public class ContourPlotApplet extends java.applet.Applet {

  // Below, constants, i.e. "final static" data members:
  final static int  NUMBER_COMPONENTS =  6;
  final static int  MIN_X_STEPS  =   2,
              MIN_Y_STEPS  =   2,
              MAX_X_STEPS  =  100,
              MAX_Y_STEPS  =  100;
  final static String EOL  =
  final static String DEFAULT_Z  =
    "{{0.5,1.1,1.5,1,2.0,3,3,2,1,0.1}," + EOL +
    " {1.0,1.5,3.0,5,6.0,2,1,1.2,1,4}," + EOL +
    " {0.9,2.0,2.1,3,6.0,7,3,2,1,1.4}," + EOL +
    " {1.0,1.5,3.0,4,6.0,5,2,1.5,1,2}," + EOL +
    " {0.8,2.0,3.0,3,4.0,4,3,2.4,2,3}," + EOL +
    " {0.6,1.1,1.5,1,4.0,3.5,3,2,3,4}," + EOL +
    " {1.0,1.5,3.0,5,6.0,2,1,1.2,2.7,4}," + EOL +
    " {0.8,2.0,3.0,3,5.5,6,3,2,1,1.4}," + EOL +
    " {1.0,1.5,3.0,4,6.0,5,2,1,0.5,0.2}}";

  // Below, the six user-interface components:
  ContourPlot thePlot  =
    new ContourPlot(MIN_X_STEPS, MIN_Y_STEPS);
  Label       zPrompt  =  new Label("", Label.LEFT);
  TextArea   zField    =  new TextArea(DEFAULT_Z,30,6);
  Checkbox   interBox  =  new Checkbox();
  Button      drawBtn  =  new Button();
  TextArea   results   =  new TextArea();

  // Below, class data members read from the <APPLET> tag:
  static String  contourValuesTitle,infoStrX,infoStrY,

  // "init" overrides "super.init()" and initializes the applet by:
  // 1.  getting parameters from the <APPLET> tag;
  // 2.  setting layout to instance of "ContourPlotLayout";
  // 3.  initializing and adding the six user-interface
  //      components, using the method "add()" which will
  //      also call "ContourPlotLayout.addLayoutComponent()".
  public void init() {
    infoStrX   =  getParameter("stringX");
    infoStrY   =  getParameter("stringY");

    setLayout(new ContourPlotLayout());
    add("thePlot", thePlot);
    add("zPrompt", zPrompt);
    add("zField",  zField);
    add("interBox",  interBox);
    drawBtn.setFont(new Font("Helvetica", Font.BOLD, 10));
    add("drawBtn", drawBtn);
    results.setFont(new Font("Courier", Font.PLAIN, 9));
    add("results", results);
    contourValuesTitle = getParameter("stringResults");
    errParse   =  getParameter("stringErrParse");
    errLog      =  getParameter("stringErrLog1") + EOL +
                getParameter("stringErrLog2") + EOL +
    errComp    =  getParameter("stringErrComp");
    errEqual   =  getParameter("stringErrEqual");
    errExpect  =  getParameter("stringErrExpect");
    errEOF      =  getParameter("stringErrEOF");
    errBounds  =  getParameter("stringErrBounds");

  // Handle events. The only event not handled by the superclass 
  // is a mouse hit (i.e. "Event.ACTION_EVENT") in the "Draw" button.
  public boolean handleEvent(Event e) {
    if ((e != null) &&
       ( == Event.ACTION_EVENT) &&
       ( == drawBtn)) {
      return true;
    else return super.handleEvent(e);
  // "DrawTheContourPlot" does what its name says (in reaction to a hit on the 
  // "Draw" button). The guts of this method are in the "try" block which:
  // 1.  gets the interpolation flag (for contour values);
  // 2.  parses the data, i.e. the matrix of z values;
  // 3.  draws the contour plot by calling the "paint()"
  //      method of the component "thePlot";
  //   4.  displays the results, i.e. the number of rows and columns in the grid, 
  //      an echo of the matrix of z values, and the list of contour values.
  // This method catches 2 exceptions, then finally (i.e. regardless of exceptions) 
  // sends a completion message to the Java console using "System.out.println()".
  public void DrawTheContourPlot() {
    String    s;

    try {
      s = zField.getText();
      thePlot.logInterpolation = interBox.getState();
      s = thePlot.ReturnZedMatrix() +
        contourValuesTitle + EOL +
    catch(ParseMatrixException e) {
    catch(IOException e) {
    finally {
      System.out.println("Exiting DrawTheContourPlot");

ContourPlotLayout is derived directly from java.lang.Object and implements the interface java.awt.LayoutManager. Its source code is shown in Listing 3. Recall that an "interface" in Java is an abstract class in which all methods are abstract, and is Java's limited way of implementing mix-in classes, that is, allowing a very restricted degree of multiple inheritance. Since an interface is completely abstract, all its methods must be overridden in any class which implements it, and that is the case here: ContourPlotLayout contains implementations of all five methods - addLayoutComponent, layoutContainer, minimumLayoutSize, preferredLayoutSize and removeLayoutComponent - declared abstractly in java.awt.LayoutManager.

The purpose of ContourPlotLayout is to lay out the six user-interface components inside our applet's rectangle. The Java API includes several layout managers, such as FlowLayout, BorderLayout, GridLayout, etc. (again, see Dave Mark's series of Getting Started articles in MacTech), but none was deemed appropriate here because it was desired to assign special fixed values to most (but not all) of the positions and dimensions of the components. The six components are stored in an instance variable, an array k, whose values k[0] through k[5] correspond to the applet's instance variables thePlot, zPrompt, zField, interBox, drawBtn and results. k[1] through k[4] are of fixed position and dimension. The other two components, that is, the contour plot and the results, also have fixed position, but may change in size as the applet's dimensions change (for example, if the applet's window is resized in the Java interpreter). The contour plot will be made as large as possible while remaining square, while its size never falls below a certain minimum, the constant (that is, static final) MIN_PLOT_DIMEN. The results area's width never changes, but its height expands to fill the available space while never falling below the minimum MIN_RES_HEIGHT.

Listing 3
// ContourPlotLayout implements the interface LayoutManager
// & is used by ContourPlotApplet to lay out its components.

import java.awt.*;

public class ContourPlotLayout
  extends    java.lang.Object
  implements  java.awt.LayoutManager {

  // Below, constant data members:
  private static final int  COUNT =
  private static final int
    MARGIN          =   5,
    MIN_PLOT_DIMEN  =  300,
    LEFT_WIDTH      =  250,
    CBOX_WIDTH      =  130,
    LINE_HEIGHT     =   25,
    DATA_HEIGHT     =  105,
    MIN_RES_HEIGHT  =   50,

  // Below, data members: the array of components, the dimensions of 
  // the contour  plot component and the height of the results area.
  Component  k[]  = new Component[COUNT];
  Dimension  d    = new Dimension(  MIN_PLOT_DIMEN,
  int  results_height = MIN_RES_HEIGHT;

  // "addLayoutComponent" is necessary to override the
  // corresponding abstract method in "LayoutManager".
  public void addLayoutComponent(String name, Component c)
    if (name.equals("thePlot")) {
      c.reshape(  2*MARGIN+LEFT_WIDTH, MARGIN,
                d.width, d.height);
    else if (name.equals("zPrompt")) {
      c.reshape(  MARGIN, MARGIN,
                LEFT_WIDTH, LINE_HEIGHT);
    else if (name.equals("zField")) {
      c.reshape(  MARGIN, DATA_V_POS,
                LEFT_WIDTH, DATA_HEIGHT);
    else if (name.equals("interBox")) {
      c.reshape(  MARGIN, BUTTON_V_POS,
                CBOX_WIDTH, LINE_HEIGHT);
    else if (name.equals("drawBtn")) {
      c.reshape(  BUTTON_H_POS, BUTTON_V_POS,
                BUTTON_WIDTH, LINE_HEIGHT);
    else if (name.equals("results")) {
      c.reshape(  MARGIN, RESULTS_V_POS,
              LEFT_WIDTH, results_height);
//   throw new SomeKindOfException(
//     "Attempt to add an invalid component");

  // "GetDimensions" computes the data members "d" and  "results_height" 
  // which are  the only dimensions in the layout which are not fixed.
  public void GetDimensions(Container parent) {
    d = parent.size();
    d.width = d.width - LEFT_WIDTH - 3*MARGIN;
    d.height = d.height - 2*MARGIN;
    if (d.width < MIN_PLOT_DIMEN)
      d.width = MIN_PLOT_DIMEN;
    if (d.height < MIN_PLOT_DIMEN)
      d.height = MIN_PLOT_DIMEN;
    if (d.width > d.height) d.width = d.height;
    else if (d.height > d.width) d.height = d.width;
    results_height = d.height + MARGIN - RESULTS_V_POS;
    if (results_height < MIN_RES_HEIGHT)
      results_height = MIN_RES_HEIGHT;

  // "addComponentNumber" adds a component given its index
  // and is a utility routine used by "addLayoutComponent".
  public void addComponentNumber(int i, Component c) {
    if ((i < 0) || (i >= COUNT)) {
      throw new ArrayIndexOutOfBoundsException();
    else if (k[i] != null) {
//   throw new SomeKindOfException(
//     "Attempt to add a component already added");
    else k[i] = c;

  // "layoutContainer" is necessary to override the
  // corresponding abstract method in "LayoutManager".
  public void layoutContainer(Container parent) {
    if (k[0] != null) k[0].reshape
    if (k[1] != null) k[1].reshape
    if (k[2] != null) k[2].reshape
    if (k[3] !=null) k[3].reshape
    if (k[4] != null) k[4].reshape
    if (k[5] != null) k[5].reshape

  // "minimumLayoutSize" is necessary to override the
  // corresponding abstract method in "LayoutManager".
  public Dimension minimumLayoutSize(Container parent) {
    return new Dimension(

  // "preferredLayoutSize" is necessary to override the
  // corresponding abstract method in "LayoutManager".
  public Dimension preferredLayoutSize(Container parent) {
    return new Dimension(  3*MARGIN + d.width + LEFT_WIDTH,
                        2*MARGIN + d.height);

  // "removeLayoutComponent" is necessary to override the
  // corresponding abstract method in "LayoutManager".
  public void removeLayoutComponent(Component c) {
    for (int i = 0; i < COUNT; i++)
      if (c == k[i]) k[i] = null;

ContourPlot, part of whose source code is shown in Listing 4, is derived from the class java.awt.Canvas. An instance of it is used by the applet as the user-interface component which parses the data, draws the contour plot, and returns a string of results. This class begins with a number of constants: note, for example, the characters OPEN_SUITE and CLOSE_SUITE specifying delimiters in the matrix to be parsed and BETWEEN_ARGS which specifies the data separator between values in the matrix; note also the platform-independent way of assigning a value to EOL, as recommended in [5].

The data members xSteps and ySteps are used to hold the number of horizontal and vertical steps, respectively, in the grid.

The matrix z will contain values of type float and is declared to have two indices but the number of components in each dimension is initially unspecified. The number of rows in z and the length of each row will be incremented as the data are read. The matrix will be made rectangular only after all data are parsed; in fact, Java syntax allows one to use an array of arrays (such as z here) in which the "inner" arrays need not have the same length. For example, the length of the xth row of z is given by z[x].length. Notice that, according to standard Java practice, the memory allocated for the matrix z is never disposed, even when new data are parsed, since garbage collection is performed automatically by the Java interpreter. Or to express this in different words, the contents of z may be "disposed" by simply performing the assignment z = null which has the effect that any previous contents of z are no longer referenced (unless they have been assigned to some other variable other than z) and may thus be garbage-collected by the interpreter at its convenience.

The data members d, deltaX, deltaY are measurements, in pixels, of the dimensions of the contour plot and the distance between grid lines horizontally and vertically.

Most of the remaining data members are variables adapted from Snyder's Fortran subroutine GCONTR. See [2] for a discussion of their meaning.

The various methods in the class ContourPlot are explained briefly by comments in the full source code included with the project. The most important are paint(Graphics g) and ContourPlotKernel(Graphics g, boolean workSpace[]). The former is called directly by the applet and in turn calls the latter which corresponds to the "outer" level of the plotting algorithm adapted from Synder's subroutine GCONTR. (For brevity, some methods have been omitted from Listing 4, in particular a few methods which are called directly or indirectly only by ContourPlotKernel and thus include only code adapted from Synder.)

Listing 4

Selections from
// "ContourPlot" is the most important class. It is a user-interface component which 
// parses the data, draws the contour plot, and returns a string of results.

import java.awt.*;

public class ContourPlot extends Canvas {

  // Below, constant data members:
  final static boolean SHOW_NUMBERS = true;
  final static int  BLANK       =  32,
              OPEN_SUITE      =  (int)'{',
              CLOSE_SUITE     =  (int)'}',
              BETWEEN_ARGS    =  (int)',',
              N_CONTOURS      =  10,
              PLOT_MARGIN     =  20,
              WEE_BIT        =   3,
              NUMBER_LENGTH    =   3;
  final static double    Z_MAX_MAX  =  1.0E+10,
                      Z_MIN_MIN  = -Z_MAX_MAX;
  final static String EOL  =

  // Below, data members which store the grid steps,
  // the z values, the interpolation flag, the dimensions
  // of the contour plot and the increments in the grid:
  int        xSteps, ySteps;
  float      z[][];
  boolean    logInterpolation = false;
  Dimension  d;
  double      deltaX, deltaY;

  // Below, data members, most of which are adapted from
  // Fortran variables in Snyder's code:
  int    ncv = N_CONTOURS;
  int    l1[] = new int[4];
  int    l2[] = new int[4];
  int    ij[] = new int[2];
  int    i1[] = new int[2];
  int    i2[] = new int[2];
  int    i3[] = new int[6];
  int    ibkey,icur,jcur,ii,jj,elle,ix,iedge,iflag,ni,ks;
  int    cntrIndex,prevIndex;
  int    idir,nxidir,k;
  double    z1,z2,cval,zMax,zMin;
  double    intersect[]    = new double[4];
  double    xy[]          = new double[2];
  double    prevXY[]      = new double[2];
  float     cv[]          = new float[ncv];
  boolean  jump;

  // A constructor method.
  public ContourPlot(int x, int y) {
    xSteps = x;
    ySteps = y;

  // The following routines are omitted from this listing.
  // See the full source code included with the project.
  // int sign(int a, int b)
  // void InvalidData()
  // void GetExtremes()
  // void SetMeasurements()
  // void DetectBoundary()
  // boolean Routine_label_020()
  // boolean Routine_label_050()
  // boolean Routine_label_150()
  // short Routine_label_200(  Graphics g,
  //                          boolean workSpace[])
  // void ContinueContour()
  // "AssignContourValues" interpolates between "zMin" and "zMax", either
  // logarithmically or linearly, in order to assign contour values to the array "cv".
  void AssignContourValues() throws ParseMatrixException {
    int    i;
    double  delta;

    if ((logInterpolation) && (zMin <= 0.0)) {
      throw new
    if (logInterpolation) {
      double  temp = Math.log(zMin);

      delta = (Math.log(zMax)-temp) / ncv;
      for (i = 0; i < ncv; i++)
        cv[i] = (float)Math.exp(temp + (i+1)*delta);
    else {
      delta = (zMax-zMin) / ncv;
      for (i = 0; i < ncv; i++)
        cv[i] = (float)(zMin + (i+1)*delta);

  // "GetContourValuesString" returns a list of the
  // contour values for display in the results area.
  String GetContourValuesString() {
    String  s = new String();
    int    i;

    for (i = 0; i < ncv; i++)
      s = s  + "[" +  Integer.toString(i)
            + "] " + Float.toString(cv[i]) + EOL;
    return s;

  // "DrawGrid" draws the rectangular grid of gray lines
  // on top of which the contours will later be drawn.
  void DrawGrid(Graphics g) {
    int  i,j,kx,ky;

    // Interchange horizontal & vertical
    g.clearRect(0, 0,    d.height+2*PLOT_MARGIN,
                      d.width +2*PLOT_MARGIN);
    for (i = 0; i < xSteps; i++) {
      kx = (int)((float)i * deltaX);
      g.drawLine(  PLOT_MARGIN,
    for (j = 0; j < ySteps; j++) {
      ky = (int)((float)j * deltaY);
      g.drawLine(  PLOT_MARGIN+ky,

  // "SetColour" sets the colour of the graphics object, given the contour 
  // index, by interpolating linearly between "" & "".
  void SetColour(Graphics g) {
    Color c = new Color(
      ((ncv-cntrIndex)  *  +
             cntrIndex  *,
      ((ncv-cntrIndex)  * +
             cntrIndex  *,
      ((ncv-cntrIndex)  * +
             cntrIndex  *;
  // "DrawKernel" is the guts of drawing and is called directly or indirectly by 
  // "ContourPlotKernel" in order to draw a segment of a contour or to set the pen
  // position "prevXY". Its action depends on "iflag":
  // iflag == 1 means Continue a contour
  // iflag == 2 means Start a contour at a boundary
  // iflag == 3 means Start a contour not at a boundary
  // iflag == 4 means Finish contour at a boundary
  // iflag == 5 means Finish closed contour not at boundary
  // iflag == 6 means Set pen position
  // If the constant "SHOW_NUMBERS" is true, then the contour index is drawn 
  // adjacent to where the contour ends when completing a contour (iflag == 4 or 5).
  void DrawKernel(Graphics g) {
    int  prevU,prevV,u,v;

    if ((iflag == 1) || (iflag == 4) || (iflag == 5)) {
      if (cntrIndex != prevIndex) { // Must change colour
        prevIndex = cntrIndex;
      prevU = (int)((prevXY[0] - 1.0) * deltaX);
      prevV = (int)((prevXY[1] - 1.0) * deltaY);
      u = (int)((xy[0] - 1.0) * deltaX);
      v = (int)((xy[1] - 1.0) * deltaY);

      // Interchange horizontal & vertical
      g.drawLine( PLOT_MARGIN+prevV,PLOT_MARGIN+prevU,
              PLOT_MARGIN+v,   PLOT_MARGIN+u);
      if ((SHOW_NUMBERS) && ((iflag==4) || (iflag==5))) {
        if       (u == 0)        u = u - WEE_BIT;
        else if  (u == d.width)  u = u + PLOT_MARGIN/2;
        else if  (v == 0)        v = v - PLOT_MARGIN/2;
        else if  (v == d.height)  v = v + WEE_BIT;
          PLOT_MARGIN+v, PLOT_MARGIN+u);
    prevXY[0] = xy[0];
    prevXY[1] = xy[1];

  // "CrossedByContour" is true iff the current segment inthe grid is crossed by 
  // one of the contour values and has not already been processed for that value.
  boolean CrossedByContour(boolean workSpace[]) {
    ii = ij[0] + i1[elle];
    jj = ij[1] + i1[1-elle];
    z1 = z[ij[0]-1][ij[1]-1];
    z2 = z[ii-1][jj-1];
    for (cntrIndex = 0; cntrIndex < ncv; cntrIndex++) {
      int  i = 2*(xSteps*(ySteps*cntrIndex+ij[1]-1)
                  +ij[0]-1) + elle;

      if (!workSpace[i]) {
        float x = cv[cntrIndex];
        if ((x>Math.min(z1,z2)) && (x<=Math.max(z1,z2)))
          workSpace[i] = true;
          return true;
    return false;

  // "ContourPlotKernel" is the guts of this class and
  // corresponds to Synder's subroutine "GCONTR".
  void ContourPlotKernel(Graphics g,  boolean workSpace[])
    short val_label_200;

    l1[0] = xSteps;    l1[1] = ySteps;
    l1[2] = -1;       l1[3] = -1;
    i1[0] =  1; i1[1] =  0;
    i2[0] =  1; i2[1] = -1;
    i3[0] =  1; i3[1] =  0; i3[2] =  0;
    i3[3] =  1; i3[4] =  1; i3[5] =  0;
    prevXY[0]  = 0.0; prevXY[1] = 0.0;
    xy[0]       = 1.0; xy[1] = 1.0;
    cntrIndex  = 0;
    prevIndex  = -1;
    iflag      = 6;
    icur = Math.max(1,
      Math.min((int)Math.floor(xy[0]), xSteps));
    jcur = Math.max(1,
      Math.min((int)Math.floor(xy[1]), ySteps));
    ibkey = 0;
    ij[0] = icur;
    ij[1] = jcur;
    if (  Routine_label_020() &&
        Routine_label_150()) return;
    if (  Routine_label_050()) return;
    while (true) {
      if (jump)  {
        if (ix != 0)
          iflag = 4; // Finish contour at boundary
        iedge = ks + 2;
        if (iedge > 4) iedge = iedge - 4;
        intersect[iedge-1] = intersect[ks-1];
        val_label_200 = Routine_label_200(g,workSpace);
        if (val_label_200 == 1) {
          if (  Routine_label_020() &&
               Routine_label_150()) return;
          if (  Routine_label_050()) return;
        if (val_label_200 == 2) continue;
      if ((ix != 3) && (ix+ibkey != 0) &&
        CrossedByContour(workSpace)) {
        // An acceptable line segment has been found.
        // Follow contour until it hits a boundary or closes.
        iedge = elle + 1;
        cval = cv[cntrIndex];
        if (ix != 1) iedge = iedge + 2;
        iflag = 2 + ibkey;
        intersect[iedge-1] = (cval - z1) / (z2 - z1);
        val_label_200 = Routine_label_200(g,workSpace);
        if (val_label_200 == 1) {
          if (  Routine_label_020() &&
               Routine_label_150()) return;
          if (  Routine_label_050()) return;
        if (val_label_200 == 2) continue;
      if (++elle > 1) {
        elle = idir % 2;
        ij[elle] = sign(ij[elle],l1[k-1]);
        if (Routine_label_150()) return;
      if (Routine_label_050()) return;

  // "paint" overrides the superclass' "paint()" method. This method draws the grid and 
  // then the contours, provided that the first two contour values are not equal 
  // (which would indicate invalid data). The "workSpace" is used to remember which 
  // segments in the grid have been crossed by which contours.
  public void paint(Graphics g)
    int    workLength = 2 * xSteps * ySteps * ncv;
    boolean  workSpace[]; // Allocate below if data valid

    if (cv[0] != cv[1]) { // Valid data
      workSpace = new boolean[workLength];
      ContourPlotKernel(g, workSpace);

  // "ParseZedMatrix" parses the matrix of z values
  // which it expects to find in the string "s".
  public void ParseZedMatrix(String s)
    throws ParseMatrixException, IOException
    StringBufferInputStream i;
    StreamTokenizer      t;

    i = new StringBufferInputStream(s);
    t = new StreamTokenizer(i);

    z = null; // Junk any existing matrix
    do ParseRowVector(t);
    while (t.nextToken() == BETWEEN_ARGS);
    if (t.ttype != CLOSE_SUITE) {
      throw new ParseMatrixException(
        ContourPlotApplet.errParse + EOL +
    if (t.nextToken() != t.TT_EOF) {
      throw new ParseMatrixException(
        ContourPlotApplet.errParse + EOL +
    if (zMax > Z_MAX_MAX) zMax = Z_MAX_MAX;
    if (zMin < Z_MIN_MIN) zMin = Z_MIN_MIN;

  // "ParseRowVector" parses a row of data from the stream.
  public void ParseRowVector(StreamTokenizer t)
    throws ParseMatrixException, IOException
  {  // Parse a row of float's and
    // insert them in a new row of z[][]
    if (z == null) z = new float[1][];
    else AddRow();
    do {
      if (t.nextToken() == t.TT_NUMBER) {
        int x = z.length - 1;

        if (z[x] == null) {
          z[x] = new float[1];
          z[x][0] = (float)t.nval;
        else AddColumn((float)t.nval);
      else {
        int x = z.length - 1;
        int y = z[x].length - 1;

        throw new ParseMatrixException(
          ContourPlotApplet.errParse + EOL +
          ContourPlotApplet.errComp + " [" +
          Integer.toString(x) + "," +
          Integer.toString(y) + "]");
    } while (t.nextToken() == BETWEEN_ARGS);
    if (t.ttype != CLOSE_SUITE) {
      throw new ParseMatrixException(
        ContourPlotApplet.errParse + EOL +

  // "AddRow" appends a new empty row to the end of "z"
  public void AddRow() throws ParseMatrixException {
    int leng = z.length;
    float temp[][];

    if (leng >= ContourPlotApplet.MAX_X_STEPS)
      throw new ParseMatrixException(
        ContourPlotApplet.errParse + EOL +
    temp = new float[leng+1][];
    System.arraycopy(z, 0, temp, 0, leng);
    z = temp;

  // "AddColumn" appends "val" to end of last row in "z"
  public void AddColumn(float val)
    throws ParseMatrixException
    int i = z.length - 1;
    int leng = z[i].length;
    float temp[];

    if (leng >= ContourPlotApplet.MAX_Y_STEPS)
      throw new ParseMatrixException(
        ContourPlotApplet.errParse + EOL +
    temp = new float[leng+1];
    System.arraycopy(z[i], 0, temp, 0, leng);
    temp[leng] = val;
    z[i] = temp;

  // "MakeMatrixRectangular" appends zero(s) to the end of
  // any row of "z" which is shorter than the longest row.
  public void MakeMatrixRectangular() {
    int  i,y,leng;

    xSteps = z.length;
    ySteps = ContourPlotApplet.MIN_Y_STEPS;
    for (i = 0; i < xSteps; i++) {
      y = z[i].length;
      if (ySteps < y) ySteps = y;
    for (i = 0; i < xSteps; i++) {
      leng = z[i].length;
      if (leng < ySteps) {
        float temp[] = new float[ySteps];

        System.arraycopy(z[i], 0, temp, 0, leng);
        while (leng < ySteps) temp[leng++] = 0;
        z[i] = temp;

  // "ReturnZedMatrix" returns a string containing the
  // values in "z" for display in the results area.
  public String ReturnZedMatrix() {
    String  s,oneValue;
    int    i,j;
    s = new String(
      ContourPlotApplet.infoStrX + xSteps + EOL +
      ContourPlotApplet.infoStrY + ySteps + EOL);
    for (i = 0; i < xSteps; i++) {
      for (j = 0; j < ySteps; j++) {
        oneValue = Double.toString(z[i][j]);
        while (oneValue.length() < NUMBER_LENGTH)
          oneValue = " " + oneValue;
        s = s + oneValue;
        if (j < ySteps-1) s = s + " ";
      s = s + EOL;
    return s;
  // "EatCharacter" skips any BLANK's in the stream and
  // expects the character "c", throwing an exception if
  // the next non-BLANK character is not "c".
  public void EatCharacter(StreamTokenizer t, int c)
    throws ParseMatrixException, IOException
    while (t.nextToken() == BLANK) ;
    if (t.ttype != c) {
      throw new ParseMatrixException(
        ContourPlotApplet.errParse + EOL +
        ContourPlotApplet.errExpect + (char)c);

ParseMatrixException, a very small class whose source code is shown in Listing 5, extends java.lang.Exception and is used to throw exceptions when any error occurs during parsing of the matrix of z values. It contains no new data members and its only method is a constructor taking a single String argument whose contents explain the error. The applet catches this exception and displays the string in the results box. The various explanatory strings are built from arguments read from the <APPLET> tag in the html file and stored as static String objects in ContourPlotApplet.

Listing 5
// Class "ParseMatrixException" is used to signal an error corresponding to invalid 
// data encounteredwhen parsing the matrix of z values.

public class ParseMatrixException extends Exception {

  public ParseMatrixException(String message) {


This article has presented a reasonably simple Java applet which nevertheless performs a useful function. It illustrates a variety of features of the Java language, such as:

  • constants, that is, final static data members;
  • class (static) methods (See, for example, Float.toString called by GetContourValuesString or Math.log() called by AssignContourValues, in Listing 4.);
  • manipulation of characters strings using the String object;
  • parsing data by breaking it into tokens (see ParseZedMatrix() in Listing 4);
  • sending output to the Java console (see DrawTheContourPlot in Listing 2);
  • several user-interface components (see the data members in Listing 2);
  • interfaces and a custom layout (see Listing 3);
  • a custom component (see Listing 4);
  • arrays of one or two dimensions (see, for example, data member z in Listing 4);
  • applet parameters (see Listing 1 and init() in Listing 2);
  • a little colour (see DrawGrid and SetColour in Listing 4);
  • throwing and catching exceptions (see ParseZedMatrix() in Listing 4 and DrawTheContourPlot in Listing 2); custom exceptions (see Listing 5); etc.

For the reader who would like to experiment with possible improvements to this applet, here are a few suggestions:

  • allow user-input of the number of contour values, or of the contour values themselves;
  • implement a file dialogue so the user can read a matrix of data from a disk file;
  • shade the regions between contours;
  • allow the option of keeping grid cells square when the number of rows does not equal the number of columns - thus requiring a non-rectangular drawing area;
  • allow user-input of the grid values - i.e. x and y values - so that the grid lines need not be equally spaced.
  • for the ambitious: parse a closed-form expression such as z = sin(x y), then generate the grid values - choosing the fineness of the grid according to the absolute values of the partial derivatives of z - and finally plot the result;
  • again, for the ambitious: implement Preusser's algorithm, for nice smooth curves!

The contour plotting applet (not necessarily the version described in this article, but similar) may be viewed by pointing your web browser to http://www.CRM.UMontreal.CA/Galerie/ContourPlotApplet_Eng.html.


  1. Dave Mark, "Java Break," MacTech Magazine, 12, 5 (May 1996), 7-12. (and subsequent months)
  2. W. V. Snyder, "Algorithm 531, Contour plotting [J6]," ACM Trans. Math. Softw. 4, 3 (Sept. 1978), 290-294.
  3. A. Preusser, "Algorithm 671, FARB-E-2D: Fill Area with Bicubics on Rectangles-A Contour Plot Program," ACM Trans. Math. Softw. 15, 1 (March 1989), 79-89.
  4. D. Flanagan, Java in a Nutshell, O'Reilly & Associates (1996).
  5. 100% Pure Java Cookbook, Version 5.01.97, Sun Microsystems (1997).

David Rand works at the Centre de recherches mathématiques (CRM) at the Université de Montréal where he manages the CRM's web site. He has developed a number of Macintosh applications such as the concordance-editor Concorder 3 and the shareware text- and list-editor Zephyr 1.1.


Community Search:
MacTech Search:

Software Updates via MacUpdate

Google Earth - View and contr...
Google Earth gives you a wealth of imagery and geographic information. Explore destinations like Maui and Paris, or browse content from Wikipedia, National Geographic, and more. Google Earth combines... Read more
QuickBooks R12 - Financial...
QuickBooks helps you manage your business easily and efficiently. Organize your finances all in one place, track money going in and out of your business, and spot areas where you can save. Built for... Read more
FileZilla 3.24.0 - Fast and reliable FTP...
FileZilla (ported from Windows) is a fast and reliable FTP client and server with lots of useful features and an intuitive interface. Version 3.24.0: New The context menu for remote file search... Read more
Bookends 12.7.8 - Reference management a...
Bookends is a full-featured bibliography/reference and information-management system for students and professionals. Bookends uses the cloud to sync reference libraries on all the Macs you use.... Read more
Duplicate Annihilator 5.8.3 - Find and d...
Duplicate Annihilator takes on the time-consuming task of comparing the images in your iPhoto library using effective algorithms to make sure that no duplicate escapes. Duplicate Annihilator detects... Read more
BusyContacts 1.1.6 - Fast, efficient con...
BusyContacts is a contact manager for OS X that makes creating, finding, and managing contacts faster and more efficient. It brings to contact management the same power, flexibility, and sharing... Read more
MarsEdit 3.7.10 - Quick and convenient b...
MarsEdit is a blog editor for OS X that makes editing your blog like writing email, with spell-checking, drafts, multiple windows, and even AppleScript support. It works with with most blog services... Read more
BusyCal 3.1.4 - Powerful calendar app wi...
BusyCal is an award-winning desktop calendar that combines personal productivity features for individuals with powerful calendar sharing capabilities for families and workgroups. Its unique features... Read more
VirtualBox 5.1.14 - x86 virtualization s...
VirtualBox is a family of powerful x86 virtualization products for enterprise as well as home use. Not only is VirtualBox an extremely feature rich, high performance product for enterprise customers... Read more
Bookends 12.7.8 - Reference management a...
Bookends is a full-featured bibliography/reference and information-management system for students and professionals. Bookends uses the cloud to sync reference libraries on all the Macs you use.... Read more

Super Mario Run dashes onto Android in M...
Super Mario Run was one of the biggest mobile launches in 2016 before it was met with a lukewarm response by many. While the game itself plays a treat, it's pretty hard to swallow the steep price for the full game. With that said, Android users... | Read more »
WarFriends Beginner's Guide: How to...
Chillingo's new game, WarFriends, is finally available world wide, and so far it's a refreshing change from common mobile game trends. The game's a mix of tower defense, third person shooter, and collectible card game. There's a lot to unpack here... | Read more »
Super Gridland (Entertainment)
Super Gridland 1.0 Device: iOS Universal Category: Entertainment Price: $1.99, Version: 1.0 (iTunes) Description: Match. Build. Survive. "exquisitely tuned" - Rock Paper Shotgun No in-app purches, and no ads! | Read more »
Red's Kingdom (Games)
Red's Kingdom 1.0 Device: iOS Universal Category: Games Price: $4.99, Version: 1.0 (iTunes) Description: Mad King Mac has kidnapped your father and stolen your golden nut! Solve puzzles and battle goons as you explore and battle your... | Read more »
Turbo League Guide: How to tame the cont...
| Read more »
Fire Emblem: Heroes coming to Google Pla...
Nintendo gave us our first look at Fire Emblem: Heroes, the upcoming mobile Fire Emblem game the company hinted at last year. Revealed at the Fire Emblem Direct event held today, the game will condense the series' tactical RPG combat into bite-... | Read more »
ReSlice (Music)
ReSlice 1.0 Device: iOS Universal Category: Music Price: $9.99, Version: 1.0 (iTunes) Description: Audio Slice Machine Slice your audio samples with ReSlice and create flexible musical atoms which can be triggered by MIDI notes or... | Read more »
Stickman Surfer rides in with the tide t...
Stickson is back and this time he's taken up yet another extreme sport - surfing. Stickman Surfer is out this Thursday on both iOS and Android, so if you've been following the other Stickman adventures, you might be interested in picking this one... | Read more »
Z-Exemplar (Games)
Z-Exemplar 1.4 Device: iOS Universal Category: Games Price: $3.99, Version: 1.4 (iTunes) Description: | Read more »
5 dastardly difficult roguelikes like th...
Edmund McMillen's popular roguelike creation The Binding of Isaac: Rebirth has finally crawled onto mobile devices. It's a grotesque dual-stick shooter that tosses you into an endless, procedurally generated basement as you, the pitiable Isaac,... | Read more »

Price Scanner via

Twelve South Releases RelaxedLeather Cases fo...
Inspired by the laid-back luxury of burnished leather boots and crafted in rich tones of taupe, herb and marsala, RelaxedLeather cases deliver smart, easy protection for the iPhone 7. Each genuine... Read more
Week’s Best Deal: New 2016 13-inch 2.0GHz Mac...
Amazon has the new 2016 13″ 2.0GHz non-Touch Bar MacBook Pros on sale for a limited time for $225 off MSRP including free shipping: - 13″ 2.0GHz MacBook Pro, Space Gray (MLL42LL/A): $1274.99 $225 off... Read more
Back in stock: Apple refurbished Mac minis fr...
Apple has Certified Refurbished Mac minis available starting at $419. Apple’s one-year warranty is included with each mini, and shipping is free: - 1.4GHz Mac mini: $419 $80 off MSRP - 2.6GHz Mac... Read more
Apple Ranked ‘Most Intimate Brand’
The top ranked ‘”intimate” brands continued to outperform the S&P and Fortune 500 indices in revenue and profit over the past 10 years, according to MBLM’s Brand Intimacy 2017 Report, the largest... Read more
B-Eng introduces SSD Health Check for Mac OS
Fehraltorf, Switzerland based independant Swiss company- B-Eng has announced the release and immediate availability of SSD Health Check 1.0, the company’s new hard drive utility for Mac OS X. As the... Read more
Apple’s Education discount saves up to $300 o...
Purchase a new Mac or iPad using Apple’s Education Store and take up to $300 off MSRP. All teachers, students, and staff of any educational institution qualify for the discount. Shipping is free: -... Read more
4-core 3.7GHz Mac Pro on sale for $2290, save...
Guitar Center has the 3.7GHz 4-core Mac Pro (MD253LL/A) on sale for $2289.97 including free shipping or free local store pickup (if available). Their price is a $710 savings over standard MSRP for... Read more
128GB Apple iPad Air 2, refurbished, availabl...
Apple has Certified Refurbished 128GB iPad Air 2s WiFis available for $419 including free shipping. That’s an $80 savings over standard MSRP for this model. A standard Apple one-year warranty is... Read more
13-inch 2.7GHz Retina MacBook Pro on sale for...
B&H Photo has the 2015 13″ 2.7GHz/128GB Retina Apple MacBook Pro on sale for $100 off MSRP. Shipping is free, and B&H charges NY tax only: - 13″ 2.7GHz/128GB Retina MacBook Pro (MF839LL/A): $... Read more
Laptop Market – Flight To Quality? – The ‘Boo...
Preliminary quarterly PC shipments data released by Gartner Inc. last week reveal an interesting disparity between sales performance of major name PC vendors as opposed to that of less well-known... Read more

Jobs Board

*Apple* macOS Systems Integration Administra...
…most exceptional support available in the industry. SCI is seeking an Junior Apple macOS systems integration administrator that will be responsible for providing Read more
*Apple* Retail - Multiple Positions- Deer Pa...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
*Apple* Retail - Multiple Positions - Apple,...
Job Description: Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, Read more
*Apple* Technician - nfrastructure (United S...
Let’s Work Together Apple Technician This position is based in Portland, ME Life at nfrastructure At nfrastructure, we understand that our success results from our Read more
*Apple* Mobile Master - Best Buy (United Sta...
**467692BR** **Job Title:** Apple Mobile Master **Location Number:** 000602-Columbia MO-Store **Job Description:** **What does a Best Buy Apple Mobile Master Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.