Search:

Type: Posts; User: helloworld922

Search: Search took 0.13 seconds.

  1. Replies
    25
    Views
    3,546

    Re: I think I need an algorith

    Please don't start multiple topics concerning the same problem. It won't get your questions answered any quicker, and is somewhat annoying.

    In the future, make sure to ask your questions in...
  2. Replies
    25
    Views
    3,546

    Re: I think I need an algorith

    Much easier to use a loop.

    unionShape = empty shape
    for every rectangle in the list:
    unionShape = union(unionShape, rectangle)
  3. Replies
    25
    Views
    3,546

    Re: I think I need an algorith

    You forgot the break statements.

    int testInt = 10;
    switch(testInt)
    {
    case 1:
    System.out.println("int = 1");
    break;
    case 2:
    System.out.println("int = 2");
  4. Replies
    25
    Views
    3,546

    Re: I think I need an algorith

    It's a way of dividing up your rectangles/objects in a way that allows you to quickly decide if it's even possible that any two objects/rectangles will be in collision. It's kind of a general term,...
  5. Replies
    25
    Views
    3,546

    Re: I think I need an algorith

    Kind of. You need to figure out whether intersects will return true if the two objects share an edge, or even just a vertex. If it does, then that would be take care of collision checking between two...
Results 1 to 5 of 5