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 quality improvement #1

Closed
6 tasks done
jdugge opened this issue Mar 5, 2016 · 1 comment
Closed
6 tasks done

Implement quality improvement #1

jdugge opened this issue Mar 5, 2016 · 1 comment
Assignees

Comments

@jdugge
Copy link
Owner

jdugge commented Mar 5, 2016

Implement the quality improvement algorithm described in Shewchuk's Delaunay Refinement Algorithms
for Triangular Mesh Generation

  • for each boundary edge (or, more generally, each input edge), check if it is encroached by a vertex (i.e. has a vertex inside its diametral circle)
    • if it does, split the edge in half
  • for each triangle, check if it it is skinny (i.e. has a circumradius-to-shortest-edge ratio greater than B)
    • if it is, insert the off-center as a new vertex

  • Scan boundary edges
  • Check encroachment
  • Split edge
  • Calculate circumradius-to-shortest-edge ratio
  • Find off-center
  • Insert off-center
@jdugge jdugge self-assigned this Mar 20, 2016
@jdugge
Copy link
Owner Author

jdugge commented Mar 22, 2016

This completes the ingredients for the Ruppert/Shewchuk/Üngör algorithm.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant