[2 days left] What’s wrong with your cloud strategy? Learn why multicloud solutions matter with Nimble Storage.Register Now

x
Solved

java 3d bounds

Posted on 2011-03-02
Medium Priority
672 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
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points

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

Are you developing a Java application and want to create Excel Spreadsheets? You have come to the right place, this article will describe how you can create Excel Spreadsheets from a Java Application. For the purposes of this article, I will be u…
Basic understanding on "OO- Object Orientation" is needed for designing a logical solution to solve a problem. Basic OOAD is a prerequisite for a coder to ensure that they follow the basic design of OO. This would help developers to understand the b…
Viewers will learn about the regular for loop in Java and how to use it. Definition: Break the for loop down into 3 parts: Syntax when using for loops: Example using a for loop:
This tutorial covers a step-by-step guide to install VisualVM launcher in eclipse.
Suggested Courses
Course of the Month13 days, 12 hours left to enroll