For all issues regarding the Forums use, please, refer to the Forum Rules.

Our Solutions

Need professional assistance?
Consider our:

Support Offerings


Need to speed up your development?
Have a look at our:

Samples & Tools


Need some functionality extending standard OCCT capabilities?
Check out our:

Adv. Components

Related pages

Fast intersection test

Torsten Thiele's picture

Given two shapes, I want to decide whether they intersect (or one is included in the other).

1. Is there a faster method for this decision problem than computing the intersection shape explicitly (like common or section)?

2. Can I exploit the fact that the shapes are polyhedral?

3. Is there a fast method to test whether a point is inside a shape (for example a polyhedron)?

Many thanks for any hints in advance,

Torsten Thiele.

Contact us

Attention: DO NOT use this form for all kind of request for the removal of your personal data. Please follow this link for such cases.