vpoint.java

一个新的voronoi算法实现

package dv;

import java.util.Vector;

public class vpoint {
    int vpointkey=0;

    double x = 0;
    double y = 0;

    public vpoint() {
    }

    public vpoint(double a, double b) {
        x = a;
        y = b;
    }

    public vpoint(double a, double b, int vpointkey) {
        x = a;
        y = b;
        vpointkey = vpointkey;

    }
    public boolean brother(vpoint b,double det){
    boolean flag;//true is the same or the flase is different
    double xdet=Math.abs(b.x-this.x);
    double ydet=Math.abs(b.y-this.y);
    if(xdet<det & ydet<det){
        flag=true;
    }else{
        flag=false;
    }
    return flag;
}

}