Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement more robust intersection computation #20

Open
sseraj opened this issue Nov 1, 2022 · 0 comments
Open

Implement more robust intersection computation #20

sseraj opened this issue Nov 1, 2022 · 0 comments
Labels
enhancement New feature or request

Comments

@sseraj
Copy link
Collaborator

sseraj commented Nov 1, 2022

Currently, the triangle-triangle intersection routine in intersection.F90 implements the method from Moller's 1997 paper. This method works for most cases but can give incorrect results 50% of the time for certain degenerate cases (see Table 2 in Devillers and Guigue 2002).

The chances of such a degenerate case occurring increase as the triangulated surface meshes are refined further. I have checked for my case that refining enough causes problems with the intersection computation.

A more robust approach would be to use exact (or adaptive) arithmetic as described by Shewchuk.

@sseraj sseraj added the enhancement New feature or request label Nov 1, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant