Package graphics.common

Examples of graphics.common.Box

65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
        drawTreeRecursive( g, node.mTopLeft );
        drawTreeRecursive( g, node.mTopRight );
        drawTreeRecursive( g, node.mBottomLeft );
        drawTreeRecursive( g, node.mBottomRight );

        Box loc = node.mNodeLoc;
        //top
        g.drawLine( loc.getX(), loc.getY(),
                loc.getX() + loc.getWidth(), loc.getY() );
        //bottom
        g.drawLine( loc.getX(), loc.getY() + loc.getHeight(),
                loc.getX() + loc.getWidth(), loc.getY() + loc.getHeight() );
        //left
        g.drawLine( loc.getX(), loc.getY(), loc.getX(),
                loc.getY() + loc.getHeight() );
        //right
        g.drawLine( loc.getX() + loc.getWidth(), loc.getY(),
                loc.getX() + loc.getWidth(), loc.getY() + loc.getHeight() );
        loc = null;
    }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
        insertRecursive( thing, mHead, 0 );
    }

    private void insertRecursive( T thing, Node< T > node, int depth ) {
        if( node.mTopLeft != null ) {
            Box thingBox = thing.getBox()[ 0 ];
            if( thingBox.intersectingWith( node.mTopLeft.mNodeLoc ) )
                insertRecursive( thing, node.mTopLeft, depth + 1 );
            if( thingBox.intersectingWith( node.mTopRight.mNodeLoc ) )
                insertRecursive( thing, node.mTopRight, depth + 1 );
            if( thingBox.intersectingWith( node.mBottomLeft.mNodeLoc ) )
                insertRecursive( thing, node.mBottomLeft, depth + 1 );
            if( thingBox.intersectingWith( node.mBottomRight.mNodeLoc ) )
                insertRecursive( thing, node.mBottomRight, depth + 1 );
        }
        else {
            node.mStoredItems.add( thing );
            if( node.mStoredItems.size() >= mItemsToSplit && depth < mMaxDepth ) {
View Full Code Here
132
133
134
135
136
137
138
139
140
141
142
143
    }

    private void removeRecursive( T thing, Node< T > node ) {
        if( node == null )
            return;
        Box thingBox = thing.getBox()[ 0 ];
        if( thingBox.intersectingWith( node.mNodeLoc ) ) {
            if( node.mTopLeft == null ) {
                node.mStoredItems.remove( thing );
            }
            else {
                removeRecursive( thing, node.mTopLeft );
View Full Code Here
198
199
200
201
202
203
204
205
206
207
208
209
210
            return true;
       
        //if( node.mStoredItems.contains( thing ) )
        //    return true;
       
        Box thingBox = thing.getBox()[ 0 ];
        boolean found = false;
        if( thingBox.intersectingWith( node.mNodeLoc ) ) {
            found = updateRecursive( thing, node.mTopLeft, depth + 1 ) || found ? true : false;
            found = updateRecursive( thing, node.mTopRight, depth + 1 ) || found ? true : false;
            found = updateRecursive( thing, node.mBottomLeft, depth + 1 ) || found ? true : false;
            found = updateRecursive( thing, node.mBottomRight, depth + 1 ) || found ? true : false;
        }
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
        return false;
    }

    private boolean nodeContains( Node< T > node, T thing ) {
        Box thingBox = thing.getBox()[ 0 ];
        Box nodeLoc = node.mNodeLoc;
        if( thingBox.getRealX() < nodeLoc.getRealX() ||
                thingBox.getRealX() > nodeLoc.getRealX() + nodeLoc.getRealWidth() )
            return false;
        if( thingBox.getRealX() + thingBox.getRealWidth() < nodeLoc.getRealX() ||
                thingBox.getRealX() + thingBox.getRealWidth() > nodeLoc.getRealX() + nodeLoc.getRealWidth() )
            return false;
        if( thingBox.getRealY() < nodeLoc.getRealY() ||
                thingBox.getRealY() > nodeLoc.getRealY() + nodeLoc.getRealHeight() )
            return false;
        if( thingBox.getRealY() + thingBox.getRealHeight() < nodeLoc.getRealY() ||
                thingBox.getRealY() + thingBox.getRealHeight() > nodeLoc.getRealY() + nodeLoc.getRealHeight() )
            return false;

        return true;
    }
View Full Code Here
261
262
263
264
265
266
267
268
269
270
271
            if( thingBox.intersectingWith( node.mBottomRight.mNodeLoc ) )
                findCollidingRecursive( thingBox, node.mBottomRight, list );
        }
        else {
            for( T storedThing : node.mStoredItems ) {
                Box otherBox = storedThing.getBox()[ 0 ];
                if( thingBox.intersectingWith( otherBox ) ) {
                    list.add( storedThing );
                }
            }
        }
View Full Code Here
272
273
274
275
276
277
278
279
280
281
282
283
284
    }

    @Override
    public List< T > findCollidingBetween( T thing1, T thing2 ) {
        List< T > theList = new LinkedList< T >();
        Box box1 = thing1.getBox()[ 0 ];
        Box box2 = thing2.getBox()[ 0 ];
        Box totalBox = null;
        if( box1.getRealY() < box2.getRealY() ) {
            if( box1.getRealX() < box2.getRealX() ) {
                totalBox = Boxes.get( box1.getRealX(), box1.getRealY(), 0,
                        box2.getRealX() + box2.getRealWidth() - box1.getRealX(),
                        box2.getRealY() + box2.getRealHeight() - box1.getRealY(),
View Full Code Here
TOP

Related Classes of graphics.common.Box

  • utils.SpacialQuadTree
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.