Changeset 7c2ebb for molecuilder/src/tesselation.hpp

Timestamp:

Apr 16, 2010, 12:26:16 PM (15 years ago)

Author:

Frederik Heber <heber@…>

Children:

adff53

Parents:

ce0de8

Message:

New approach to degenerated triangles: Recognize on creation and add both sides at once.

• FindNonConvexBorder(): Approach with constructing a tree of smallest ShortestAngle has bee abandoned.

• new function BoundaryTriangleSet::CheckDegeneracy(): Similar to CandidateForTesselation::CheckValidity()
  • checks by looking whether points are inside the sphere at OtherOptCenter
• new function AddCandidateTriangle(): refactored out of AddCandidatePolygon()
• new function AddDegenerateTriangle(): basically just checks which lines to take, newly created or existing ones and which
• AddCandidatePolygon(): (renamed from AddCandidateTriangle())
  • Now needs radius of sphere and LinkedCell structure (for the degenerated searches), adapted where called
  • calls AddCandidateTriangle() for one triangle in the polygon, subsequently calls CheckDegeneracy()
  • if appropriate, calls AddDegenerateTriangle() for the other side triangle
• rename AlwaysAddTesselationTriangleLine() -> AddNewTesselationTriangleLine()
• new function AddExistingTesselationTriangleLine(), refactored out of AddTriangleLine()

File:

• molecuilder/src/tesselation.hpp (modified) (2 diffs)

molecuilder/src/tesselation.hpp

@@ -163 +163 @@
     bool IsPresentTupel(const BoundaryPointSet * const Points[3]) const;
     bool IsPresentTupel(const BoundaryTriangleSet * const T) const;
+    bool CheckDegeneracy(Vector *OtherOptCenter, const double RADIUS, const LinkedCell *LC) const;
     void SetTopNode(const BoundaryTriangleSet * const topnode);
 
@@ -283 +284 @@
     void SetTesselationPoint(TesselPoint* Candidate, const int n) const;
     void AddTesselationLine(class BoundaryPointSet *a, class BoundaryPointSet *b, const int n);
-    void AlwaysAddTesselationTriangleLine(class BoundaryPointSet *a, class BoundaryPointSet *b, const int n);
+    void AddNewTesselationTriangleLine(class BoundaryPointSet *a, class BoundaryPointSet *b, const int n);
+    void AddExistingTesselationTriangleLine(class BoundaryLineSet *FindLine, int n);
     void AddTesselationTriangle();
     void AddTesselationTriangle(const int nr);
-    void AddCandidatePolygon(CandidateForTesselation CandidateLine);
+    void AddCandidateTriangle(TesselPoint *first, TesselPoint *second, TesselPoint *third);
+    void AddDegeneratedTriangle(BoundaryTriangleSet *&triangle, Vector *OtherOptCenter, const double RADIUS, const LinkedCell *LC);
+    void AddCandidatePolygon(CandidateForTesselation CandidateLine, const double RADIUS, const LinkedCell *LC);
     void RemoveTesselationTriangle(class BoundaryTriangleSet *triangle);
     void RemoveTesselationLine(class BoundaryLineSet *line);