All of Saskia Metzler's changes so far to remove bugs from Tesselation (still not working)
Principle ideas:
allow maximum of two triangles per triple of atomic indices to also tesselate "flat" areas
detect degeneracies by having a list of candidates and adding multiple triangles (one for each) by an angle criteria
New functions:
existsIntersection(): Checks per distance minimiser whether two lines intersect (for intersecting triangles)
MinIntersectDistance(): Calculates the minimal distance between two lines (function to minimize)
sortCandidates(): Sorting function for the third point candidates
CheckPresenceOfTriangle(): For a triple of atomic indices, checks whether a triangle between them already exists (needed for allowing max of two triangles per triple)
(No files)
Note:
See TracChangeset
for help on using the changeset viewer.