Changes in src/boundary.hpp [2319ed:8c54a3]
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/boundary.hpp
r2319ed r8c54a3 54 54 55 55 void AddTriangle(class BoundaryTriangleSet *triangle); 56 bool IsConnectedTo(class BoundaryLineSet *line);57 bool ContainsBoundaryPoint(class BoundaryPointSet *point);58 bool CheckConvexityCriterion(ofstream *out);59 56 60 57 class BoundaryPointSet *endpoints[2]; … … 71 68 72 69 void GetNormalVector(Vector &NormalVector); 73 bool GetIntersectionInsideTriangle(ofstream *out, Vector *MolCenter, Vector *x, Vector *Intersection);74 bool ContainsBoundaryLine(class BoundaryLineSet *line);75 bool ContainsBoundaryPoint(class BoundaryPointSet *point);76 70 77 71 class BoundaryPointSet *endpoints[3]; … … 84 78 class CandidateForTesselation { 85 79 public : 86 87 88 89 90 91 80 CandidateForTesselation(atom* candidate, BoundaryLineSet* currentBaseLine, Vector OptCandidateCenter, Vector OtherOptCandidateCenter); 81 ~CandidateForTesselation(); 82 atom *point; 83 BoundaryLineSet *BaseLine; 84 Vector OptCenter; 85 Vector OtherOptCenter; 92 86 }; 93 87 … … 99 93 ~Tesselation(); 100 94 101 void TesselateOnBoundary(ofstream *out, molecule *mol);95 void TesselateOnBoundary(ofstream *out, config *configuration, molecule *mol); 102 96 void GuessStartingTriangle(ofstream *out); 103 97 void AddPoint(atom * Walker); … … 110 104 int CheckPresenceOfTriangle(ofstream *out, atom *Candidates[3]); 111 105 void Find_next_suitable_point_via_Angle_of_Sphere(atom* a, atom* b, atom* c, atom* Candidate, atom* Parent, int RecursionLevel, Vector *Chord, Vector *direction1, Vector *OldNormal, Vector ReferencePoint, atom*& Opt_Candidate, double *Storage, const double RADIUS, molecule* mol); 112 class BoundaryTriangleSet * FindClosestTriangleToPoint(ofstream *out, Vector *x); 113 bool IsInside(Vector *pointer); 114 bool InsertStraddlingPoints(ofstream *out, molecule *mol); 115 bool CorrectConcaveBaselines(ofstream *out); 106 list<atom*> *getClosestConnectedAtoms(atom* Atom, atom* AtomToCheck); 107 list<BoundaryTriangleSet*> *FindTriangles(atom* TrianglePoints[3]); 116 108 117 109 PointMap PointsOnBoundary; … … 134 126 135 127 136 double VolumeOfConvexEnvelope(ofstream *out, c lass Tesselation *TesselStruct, class config *configuration);128 double VolumeOfConvexEnvelope(ofstream *out, const char *filename, config *configuration, Boundaries *BoundaryPoints, molecule *mol); 137 129 double * GetDiametersOfCluster(ofstream *out, Boundaries *BoundaryPtr, molecule *mol, bool IsAngstroem); 138 130 void PrepareClustersinWater(ofstream *out, config *configuration, molecule *mol, double ClusterVolume, double celldensity); 139 molecule * FillBoxWithMolecule(ofstream *out, MoleculeListClass *List, molecule *filler, config &configuration, double distance[NDIM], double RandAtomDisplacement, double RandMolDisplacement, bool DoRandomRotation);140 void Find_convex_border(ofstream *out, molecule* mol, class Tesselation *&TesselStruct, class LinkedCell *LCList, const char *filename);141 131 void Find_non_convex_border(ofstream *out, molecule* mol, class Tesselation *T, class LinkedCell *LC, const char *tempbasename, const double RADIUS); 142 132 void Find_next_suitable_point(class BoundaryTriangleSet *BaseTriangle, class BoundaryLineSet *BaseLine, atom*& OptCandidate, Vector *OptCandidateCenter, double *ShortestAngle, const double RADIUS, LinkedCell *LC); … … 144 134 bool existsIntersection(Vector point1, Vector point2, Vector point3, Vector point4); 145 135 bool sortCandidates(CandidateForTesselation* candidate1, CandidateForTesselation* candidate2); 136 bool IsInnerPoint(Vector Point, class Tesselation *Tess, LinkedCell* LC); 137 bool IsInnerAtom(atom *Atom, class Tesselation *Tess, LinkedCell* LC); 138 atom* findClosestAtom(const atom* Atom, LinkedCell* LC); 139 double getAngle(Vector point, Vector reference, Vector center, Vector OrthogonalVector); 146 140 147 141 #endif /*BOUNDARY_HPP_*/
Note:
See TracChangeset
for help on using the changeset viewer.