datapoints.java

This program demonstrates some function approximation capabilities of a Radial Basis Function Networ

// Decompiled by JAD v1.5.4.3. Copyright 1997-98 Pavel Kouznetsov.
// JAD Home Page:      http://web.unicom.com.cy/~kpd/jad.html
// Decompiler options: packimports(3) 
// Source File Name:   RBFunction.java
// Decompiled by S.Baehni in order to be compliant with Java1.2

import java.awt.Color;
import java.awt.Graphics;

class DataPoints
{

    public DataPoints(int i)
    {
        data = new double[i][2];
        maxsize = i;
        count = 0;
    }

    public void reset()
    {
        count = 0;
        RBFunction.statusMesg("Cleared all training points.");
    }

    public void redraw(DataDisp datadisp, Graphics g)
    {
        for(int i = 0; i < count; i++)
            drawpt(datadisp, g, data[i], 4);

    }

    public void drawpt(DataDisp datadisp, Graphics g, double ad[], int i)
    {
        Color color = g.getColor();
        g.setColor(Color.blue);
        int ai[] = new int[2];
        ai = datadisp.getcoords(ad);
        g.drawOval(ai[0] - i / 2, ai[1] - i / 2, i, i);
        g.setColor(color);
    }

    public int add(DataDisp datadisp, Graphics g, int i, int j, int k)
    {
        if(count < maxsize)
        {
            int ai[] = new int[2];
            ai[0] = i;
            ai[1] = j;
            data[count] = datadisp.setcoords(ai);
            RBFunction.statusMesg("Added training point " + (count + 1) + " at ( " + data[count][0] + " , " + data[count][1] + " ).");
            drawpt(datadisp, g, data[count], k);
            count++;
        }
        else
        {
            RBFunction.statusMesg("Too many training points.");
            return -1;
        }
        return count;
    }

    public double data[][];
    public int maxsize;
    public int count;
}