VisClient/org/hfbk/vis/visnode/VisPartitionNode.java

Go to the documentation of this file.

package org.hfbk.vis.visnode;

import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Random;

import org.lwjgl.util.vector.Vector3f;


public class VisPartitionNode extends VisNode implements VisUI{
        float scale;
        boolean dirty=false;
        
        
        VisPartitionNode(Vector3f position) {
                super(null, position);
        }

        public void add(VisNode node) {
                super.add(node);
                dirty=true;
        }
        
        
        
        HashMap<Triple,VisPartitionNode> partition=new HashMap<Triple,VisPartitionNode>();      
        
        

        void balance(){
                
                if (parent instanceof VisPartitionNode){
                        //recenter node but keep childrens word position
                        Vector3f.add(position,center(),position);                               
                }
                scale=getExtends()/2;
                if(children.size()>30 && scale>20){
                        List<VisPartitionNode> newCells=new LinkedList<VisPartitionNode>();
                        for (VisNode node: children){
                                Vector3f p=node.position;
                                
                                Triple pair=new Triple(
                                        (int)(p.x/scale), 
                                        (int)(p.y/scale), 
                                        (int)(p.z/scale)                
                                );              
                                VisPartitionNode cell=partition.get(pair);
                                if (cell==null){
                                        cell=new VisPartitionNode(new Vector3f());
                                        partition.put(pair, cell );
                                        newCells.add(cell);
                                }                               
                                cell.add(node);
                        }
                        
                        children.clear();
                        
                        for(VisNode n: newCells)
                                super.add(n);
                        
                }
        }
        
        final Random hasher=new Random();
        
        class Triple{
                
                int x,y,z;
                public Triple(int x, int y, int z) {
                        this.x=x; this.y=y; this.z=z;
                }               
                public int hashCode() {
                        hasher.setSeed(x+y*0x10000L+z*0x100000000L);
                        return hasher.nextInt();
                }
                public boolean equals(Object o) {
                        return (o instanceof Triple 
                                        && ((Triple)o).x==x  
                                        && ((Triple)o).y==y  
                                        && ((Triple)o).z==z  );                 
                }
        }
        
        void renderSelf() {     
                if (dirty){
                        balance();
                        balance();
                        dirty=false;
                }                               
        }
        
}

---