dpoint.java~2~

来自「一个新的voronoi算法实现」· JAVA~2~ 代码 · 共 37 行

package dv;

import java.util.Vector;


public class dpoint {
    int dpointkey;
    double x = 0;
    double y = 0;
    Vector<edge> dpointedges = new Vector<edge>();
    public dpoint() {
    }

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

    public dpoint(double a, double b, int dpointkey) {
        x = a;
        y = b;
        dpointkey = dpointkey;

    }
    public boolean brother(dpoint b,double det){
        boolean flag;
        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;
    }
}