C# 클래스 TriangleNet.Quality

Add a bad subsegment to the queue.

Ensure that the mesh is (constrained) Delaunay.

Test the mesh for topological consistency.

Check a subsegment to see if it is encroached; add it to the list if it is.

A subsegment is encroached if there is a vertex in its diametral lens. For Ruppert's algorithm (-D switch), the "diametral lens" is the diametral circle. For Chew's algorithm (default), the diametral lens is just big enough to enclose two isosceles triangles whose bases are the subsegment. Each of the two isosceles triangles has two angles equal to 'b.minangle'. Chew's algorithm does not require diametral lenses at all--but they save time. Any vertex inside a subsegment's diametral lens implies that the triangle adjoining the subsegment will be too skinny, so it's only a matter of time before the encroaching vertex is deleted by Chew's algorithm. It's faster to simply not insert the doomed vertex in the first place, which is why I use diametral lenses with Chew's algorithm.

Remove all the encroached subsegments and bad triangles from the triangulation.

Test a triangle for quality and size.

Tests a triangle to see if it satisfies the minimum angle condition and the maximum area condition. Triangles that aren't up to spec are added to the bad triangle queue.

Split all the encroached subsegments.

Each encroached subsegment is repaired by splitting it - inserting a vertex at or near its midpoint. Newly inserted vertices may encroach upon other subsegments; these are also repaired.

Inserts a vertex at the circumcenter of a triangle. Deletes the newly inserted vertex if it encroaches upon a segment.

Traverse the entire list of subsegments, and check each to see if it is encroached. If so, add it to the list.

Test every triangle in the mesh for quality measures.