Solved

# java 3d bounds

Posted on 2011-03-02
Medium Priority
675 Views
Hi everyone,
I'm new to this forum and new to Java 3d. I've been trying to solve my problem for days but I can't find a solution! I am creating a mind map(like a graph) and I have problem with intersection. I use spheres for the nodes and cylinders as the links between them. I have a  function where it calculates the position of the node(each node can have 18 children around it) and how to position the cylinder(edge). I have added boundingspheres to the nodes to check for intersections and it works fine but I'm trying to add boundingboxes to the links and get the wrong results. Can anyone tell me how to add a boundingbox around a cylinder? Oh I have to check for intersections before I add the nodes and links to the scene so I have to check the boundingbox depending on the position that the cylinder will have afterwards... I hope I make sense...

0
Question by:aquarius4291

LVL 25

Accepted Solution

InteractiveMind earned 1000 total points
ID: 35075150
I personally would not add a bounding box to the cylinders. It is fairly straightforward to check for cylinder-cylinder and cylinder-sphere intersections:

Cylinder-sphere
------------------------
Let the cylinder start at x, be of radius r, length L, direction d.
Let the sphere be at o, radius R.
Find the shortest distance between the point o and the line x+t*d, as outlined here:
http://mathworld.wolfram.com/Point-LineDistance3-Dimensional.html
Then if the shortest distance is greater than (r+R) then they do NOT intersect.
Otherwise, if the closest point is for t<L, then they DO intersect.

Cylinder-cylinder
-------------------------
Exactly the same concept.
Suppose cylinder A begins at x_A, is of length L_A, has radius r_A, and points in the direction d_A.
Similarly for cylinder B.
Then compute the shortest distance between the axes of each cylinder, as explained here:
http://www.softsurfer.com/Archive/algorithm_0106/algorithm_0106.htm (It's just one equation)
Is this distance greater than (r_A+r_B)? If so, then they do NOT intersect.
Otherwise, suppose the point on the axis of A which is closest to the axis of B is x_A+t*d_A, where t is a parameter. Then if t<L then the cylinders DO intersect.

Does that make sense?
0

Author Comment

ID: 35081874
It does make sense but doesn't that mean that for every new node I will have to check for intersection between the new one and all the others that already exist? I'm currently using bounds.intersect and I give an array of all the bounds as a parameter. I assume that a for loop happens 'behind the scenes' but isn't it easier this way? Also even though I do save the coordinates for each object, the cylinders are rotated in different ways which makes it a bit difficult to calculate the area each one covers.
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Artificial Intelligence comes in many forms, and for game developers, Path-Finding is an important ability for making an NPC (Non-Playable Character) maneuver through terrain.  A* is a particularly easy way to approach it.  I’ll start with the algor…
In this post we will learn different types of Android Layout and some basics of an Android App.
Viewers learn about how to reduce the potential repetitiveness of coding in main by developing methods to perform specific tasks for their program. Additionally, objects are introduced for the purpose of learning how to call methods in Java. Define …