Changeset 6bd7e0 for src/Tesselation

Timestamp:

Jan 2, 2012, 1:34:28 PM (13 years ago)

Author:

Frederik Heber <heber@…>

Branches:

Action_Thermostats, Add_AtomRandomPerturbation, Add_FitFragmentPartialChargesAction, Add_RotateAroundBondAction, Add_SelectAtomByNameAction, Added_ParseSaveFragmentResults, AddingActions_SaveParseParticleParameters, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_ParticleName_to_Atom, Adding_StructOpt_integration_tests, AtomFragments, Automaking_mpqc_open, AutomationFragmentation_failures, Candidate_v1.5.4, Candidate_v1.6.0, Candidate_v1.6.1, ChangeBugEmailaddress, ChangingTestPorts, ChemicalSpaceEvaluator, CombiningParticlePotentialParsing, Combining_Subpackages, Debian_Package_split, Debian_package_split_molecuildergui_only, Disabling_MemDebug, Docu_Python_wait, EmpiricalPotential_contain_HomologyGraph, EmpiricalPotential_contain_HomologyGraph_documentation, Enable_parallel_make_install, Enhance_userguide, Enhanced_StructuralOptimization, Enhanced_StructuralOptimization_continued, Example_ManyWaysToTranslateAtom, Exclude_Hydrogens_annealWithBondGraph, FitPartialCharges_GlobalError, Fix_BoundInBox_CenterInBox_MoleculeActions, Fix_ChargeSampling_PBC, Fix_ChronosMutex, Fix_FitPartialCharges, Fix_FitPotential_needs_atomicnumbers, Fix_ForceAnnealing, Fix_IndependentFragmentGrids, Fix_ParseParticles, Fix_ParseParticles_split_forward_backward_Actions, Fix_PopActions, Fix_QtFragmentList_sorted_selection, Fix_Restrictedkeyset_FragmentMolecule, Fix_StatusMsg, Fix_StepWorldTime_single_argument, Fix_Verbose_Codepatterns, Fix_fitting_potentials, Fixes, ForceAnnealing_goodresults, ForceAnnealing_oldresults, ForceAnnealing_tocheck, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, FragmentAction_writes_AtomFragments, FragmentMolecule_checks_bonddegrees, GeometryObjects, Gui_Fixes, Gui_displays_atomic_force_velocity, ImplicitCharges, IndependentFragmentGrids, IndependentFragmentGrids_IndividualZeroInstances, IndependentFragmentGrids_IntegrationTest, IndependentFragmentGrids_Sole_NN_Calculation, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, JobMarket_unresolvable_hostname_fix, MoreRobust_FragmentAutomation, ODR_violation_mpqc_open, PartialCharges_OrthogonalSummation, PdbParser_setsAtomName, PythonUI_with_named_parameters, QtGui_reactivate_TimeChanged_changes, Recreated_GuiChecks, Rewrite_FitPartialCharges, RotateToPrincipalAxisSystem_UndoRedo, SaturateAtoms_findBestMatching, SaturateAtoms_singleDegree, StoppableMakroAction, Subpackage_CodePatterns, Subpackage_JobMarket, Subpackage_LinearAlgebra, Subpackage_levmar, Subpackage_mpqc_open, Subpackage_vmg, Switchable_LogView, ThirdParty_MPQC_rebuilt_buildsystem, TrajectoryDependenant_MaxOrder, TremoloParser_IncreasedPrecision, TremoloParser_MultipleTimesteps, TremoloParser_setsAtomName, Ubuntu_1604_changes, stable

Children:

d78531

Parents:

f55ae5

git-author:

Frederik Heber <heber@…> (12/19/11 16:46:11)

git-committer:

Frederik Heber <heber@…> (01/02/12 13:34:28)

Message:

Renamed old LinkedCell class to LinkedCell_deprecated.

• this is preparatory for a smooth transition to the new implementation.
• note that class LinkedCell and namespace LinkedCell bite each other so far.

Location:

src/Tesselation

Files:

• CandidateForTesselation.cpp (modified) (1 diff)
• CandidateForTesselation.hpp (modified) (2 diffs)
• boundary.cpp (modified) (12 diffs)
• boundary.hpp (modified) (2 diffs)
• ellipsoid.cpp (modified) (2 diffs)
• ellipsoid.hpp (modified) (2 diffs)
• tesselation.cpp (modified) (20 diffs)
• tesselation.hpp (modified) (6 diffs)
• tesselationhelpers.cpp (modified) (2 diffs)
• tesselationhelpers.hpp (modified) (2 diffs)
• triangleintersectionlist.cpp (modified) (1 diff)
• triangleintersectionlist.hpp (modified) (3 diffs)
• unittests/TesselationUnitTest.cpp (modified) (1 diff)
• unittests/TesselationUnitTest.hpp (modified) (1 diff)
• unittests/Tesselation_InsideOutsideUnitTest.cpp (modified) (1 diff)
• unittests/Tesselation_InsideOutsideUnitTest.hpp (modified) (1 diff)

src/Tesselation/CandidateForTesselation.cpp

@@ -79 +79 @@
  * Sphere must touch all candidates and the baseline endpoints and there must be no other atoms inside.
  * \param RADIUS radius of sphere
- * \param *LC LinkedCell structure with other atoms
+ * \param *LC LinkedCell_deprecated structure with other atoms
  * \return true - sphere is valid, false - sphere contains other points
  */
-bool CandidateForTesselation::CheckValidity(const double RADIUS, const LinkedCell *LC) const
+bool CandidateForTesselation::CheckValidity(const double RADIUS, const LinkedCell_deprecated *LC) const
 {
   Info FunctionInfo(__func__);

src/Tesselation/CandidateForTesselation.hpp

@@ -24 +24 @@
 class BoundaryPointSet;
 class BoundaryTriangleSet;
-class LinkedCell;
+class LinkedCell_deprecated;
 class TesselPoint;
 
@@ -33 +33 @@
   ~CandidateForTesselation();
 
-  bool CheckValidity(const double RADIUS, const class LinkedCell *LC) const;
+  bool CheckValidity(const double RADIUS, const class LinkedCell_deprecated *LC) const;
 
   TesselPointList pointlist;

src/Tesselation/boundary.cpp

@@ -322 +322 @@
  * \param *BoundaryPts set of boundary points to use or NULL
  * \param *TesselStruct Tesselation filled with points, lines and triangles on boundary on return
- * \param *LCList atoms in LinkedCell list
+ * \param *LCList atoms in LinkedCell_deprecated list
  * \param *filename filename prefix for output of vertex data
  * \return *TesselStruct is filled with convex boundary and tesselation is stored under \a *filename.
  */
-void FindConvexBorder(const molecule* mol, Boundaries *BoundaryPts, Tesselation *&TesselStruct, const LinkedCell *LCList, const char *filename)
+void FindConvexBorder(const molecule* mol, Boundaries *BoundaryPts, Tesselation *&TesselStruct, const LinkedCell_deprecated *LCList, const char *filename)
 {
         Info FunctionInfo(__func__);
@@ -711 +711 @@
   GreatestDiameter = GetDiametersOfCluster(BoundaryPoints, mol, TesselStruct, IsAngstroem);
   PointCloudAdaptor< molecule > cloud(mol, mol->name);
-  LinkedCell *LCList = new LinkedCell(cloud, 10.);
-  FindConvexBorder(mol, BoundaryPoints, TesselStruct, (const LinkedCell *&)LCList, NULL);
+  LinkedCell_deprecated *LCList = new LinkedCell_deprecated(cloud, 10.);
+  FindConvexBorder(mol, BoundaryPoints, TesselStruct, (const LinkedCell_deprecated *&)LCList, NULL);
   delete (LCList);
   delete[] BoundaryPoints;
@@ -815 +815 @@
   double phi[NDIM];
   map<molecule *, Tesselation *> TesselStruct;
-  map<molecule *, LinkedCell *> LCList;
+  map<molecule *, LinkedCell_deprecated *> LCList;
 
   for (MoleculeList::iterator ListRunner = List->ListOfMolecules.begin(); ListRunner != List->ListOfMolecules.end(); ListRunner++)
@@ -821 +821 @@
       LOG(1, "Pre-creating linked cell lists for molecule " << *ListRunner << ".");
       PointCloudAdaptor< molecule > cloud(*ListRunner, (*ListRunner)->name);
-      LCList[(*ListRunner)] = new LinkedCell(cloud, 10.); // get linked cell list
+      LCList[(*ListRunner)] = new LinkedCell_deprecated(cloud, 10.); // get linked cell list
       LOG(1, "Pre-creating tesselation for molecule " << *ListRunner << ".");
       TesselStruct[(*ListRunner)] = NULL;
-      FindNonConvexBorder((*ListRunner), TesselStruct[(*ListRunner)], (const LinkedCell *&)LCList[(*ListRunner)], 5., NULL);
+      FindNonConvexBorder((*ListRunner), TesselStruct[(*ListRunner)], (const LinkedCell_deprecated *&)LCList[(*ListRunner)], 5., NULL);
     }
 
@@ -1017 +1017 @@
 /** Checks whether there are no atoms inside a sphere around \a CurrentPosition
  *  except those atoms present in \a *filler.
- *  If filler is NULL, then we just call LinkedCell::GetPointsInsideSphere() and
+ *  If filler is NULL, then we just call LinkedCell_deprecated::GetPointsInsideSphere() and
  *  check whether the return list is empty.
  * @param *filler
@@ -1024 +1024 @@
  */
 bool isSpaceAroundPointVoid(
-    LinkedCell *LC,
+    LinkedCell_deprecated *LC,
     molecule *filler,
     const double boundary,
@@ -1111 +1111 @@
   bool firstInsertion = true;
   const Box &Domain = World::getInstance().getDomain();
-  map<molecule *, LinkedCell *> LCList;
+  map<molecule *, LinkedCell_deprecated *> LCList;
   std::vector<molecule *> List = World::getInstance().getAllMolecules();
   MoleculeListClass *MolList = World::getInstance().getMolecules();
@@ -1119 +1119 @@
       LOG(1, "Pre-creating linked cell lists for molecule " << *ListRunner << ".");
       PointCloudAdaptor< molecule > cloud(*ListRunner, (*ListRunner)->name);
-      LCList[(*ListRunner)] = new LinkedCell(cloud, 10.); // get linked cell list
+      LCList[(*ListRunner)] = new LinkedCell_deprecated(cloud, 10.); // get linked cell list
     }
 
@@ -1169 +1169 @@
         // Check whether there is anything too close by and whether atom is outside of domain
         FillIt = true;
-        for (std::map<molecule *, LinkedCell *>::iterator ListRunner = LCList.begin(); ListRunner != LCList.end(); ++ListRunner) {
+        for (std::map<molecule *, LinkedCell_deprecated *>::iterator ListRunner = LCList.begin(); ListRunner != LCList.end(); ++ListRunner) {
           FillIt = FillIt && isSpaceAroundPointVoid(
               ListRunner->second,
@@ -1234 +1234 @@
   LOG(0, MolList->ListOfMolecules.size() << " molecules have been inserted.");
 
-  for (std::map<molecule *, LinkedCell *>::iterator ListRunner = LCList.begin(); !LCList.empty(); ListRunner = LCList.begin()) {
+  for (std::map<molecule *, LinkedCell_deprecated *>::iterator ListRunner = LCList.begin(); !LCList.empty(); ListRunner = LCList.begin()) {
     delete ListRunner->second;
     LCList.erase(ListRunner);
@@ -1244 +1244 @@
  * \param *mol molecule structure with Atom's and Bond's
  * \param *&TesselStruct Tesselation filled with points, lines and triangles on boundary on return
- * \param *&LCList atoms in LinkedCell list
+ * \param *&LCList atoms in LinkedCell_deprecated list
  * \param RADIUS radius of the virtual sphere
  * \param *filename filename prefix for output of vertex data
  * \return true - tesselation successful, false - tesselation failed
  */
-bool FindNonConvexBorder(molecule* const mol, Tesselation *&TesselStruct, const LinkedCell *&LCList, const double RADIUS, const char *filename = NULL)
+bool FindNonConvexBorder(molecule* const mol, Tesselation *&TesselStruct, const LinkedCell_deprecated *&LCList, const double RADIUS, const char *filename = NULL)
 {
         Info FunctionInfo(__func__);
@@ -1272 +1272 @@
   PointCloudAdaptor< molecule > cloud(mol, mol->name);
   if (LCList == NULL) {
-    LCList = new LinkedCell(cloud, 2.*RADIUS);
+    LCList = new LinkedCell_deprecated(cloud, 2.*RADIUS);
     freeLC = true;
   }

src/Tesselation/boundary.hpp

@@ -24 +24 @@
 class BoundaryTriangleSet;
 class config;
-class LinkedCell;
+class LinkedCell_deprecated;
 class molecule;
 class MoleculeListClass;
@@ -42 +42 @@
 void FillBoxWithMolecule(MoleculeListClass *List, molecule *filler, config &configuration, const double MaxDistance, const double distance[NDIM], const double boundary, const double RandomAtomDisplacement, const double RandomMolDisplacement, const bool DoRandomRotation);
 void FillVoidWithMolecule(molecule *&filler, config &configuration, const double distance[NDIM], const double boundary, const double RandomAtomDisplacement, const double RandomMolDisplacement, const double MinDistance, const bool DoRandomRotation);
-void FindConvexBorder(const molecule* const mol, Boundaries *BoundaryPts, Tesselation *&TesselStruct, const LinkedCell *LCList, const char *filename);
+void FindConvexBorder(const molecule* const mol, Boundaries *BoundaryPts, Tesselation *&TesselStruct, const LinkedCell_deprecated *LCList, const char *filename);
 Vector* FindEmbeddingHole(MoleculeListClass *mols, molecule *srcmol);
-bool FindNonConvexBorder(molecule* const mol, Tesselation *&TesselStruct, const LinkedCell *&LC, const double RADIUS, const char *tempbasename);
+bool FindNonConvexBorder(molecule* const mol, Tesselation *&TesselStruct, const LinkedCell_deprecated *&LC, const double RADIUS, const char *tempbasename);
 Boundaries *GetBoundaryPoints(const molecule *mol, Tesselation *&TesselStruct);
 double * GetDiametersOfCluster(const Boundaries *BoundaryPtr, const molecule *mol, Tesselation *&TesselStruct, const bool IsAngstroem);

src/Tesselation/ellipsoid.cpp

@@ -242 +242 @@
  * \param PointsToPick number of points in set to pick
  */
-void PickRandomNeighbouredPointSet(class Tesselation *T, class LinkedCell *LC, Vector *&x, size_t PointsToPick)
+void PickRandomNeighbouredPointSet(class Tesselation *T, class LinkedCell_deprecated *LC, Vector *&x, size_t PointsToPick)
 {
   size_t PointsLeft = 0;
@@ -414 +414 @@
  * \param *filename name for output file
  */
-void FindDistributionOfEllipsoids(class Tesselation *T, class LinkedCell *LCList, int N, int number, const char *filename)
+void FindDistributionOfEllipsoids(class Tesselation *T, class LinkedCell_deprecated *LCList, int N, int number, const char *filename)
 {
   ofstream output;

src/Tesselation/ellipsoid.hpp

@@ -22 +22 @@
 /****************************************** forward declarations *****************************/
 
-class LinkedCell;
+class LinkedCell_deprecated;
 class Vector;
 
@@ -31 +31 @@
 bool FitPointSetToEllipsoid(Vector *set, int N, Vector *EllipsoidCenter, double *EllipsoidLength, double *EllipsoidAngle);
 void PickRandomPointSet(class Tesselation *T, Vector *&x, size_t PointsToPick);
-void PickRandomNeighbouredPointSet(class Tesselation *T, class LinkedCell *LC, Vector *&x, size_t PointsToPick);
-void FindDistributionOfEllipsoids(class Tesselation *T, class LinkedCell *LCList, int N, int number, const char *filename);
+void PickRandomNeighbouredPointSet(class Tesselation *T, class LinkedCell_deprecated *LC, Vector *&x, size_t PointsToPick);
+void FindDistributionOfEllipsoids(class Tesselation *T, class LinkedCell_deprecated *LCList, int N, int number, const char *filename);
 
 #endif /* ELLIPSOID_HPP_ */

src/Tesselation/tesselation.cpp

@@ -415 +415 @@
  * \param *out output stream for debugging
  * \param *cloud cluster of points
- * \param *LC LinkedCell structure to find nearest point quickly
+ * \param *LC LinkedCell_deprecated structure to find nearest point quickly
  * \return true - all straddling points insert, false - something went wrong
  */
-bool Tesselation::InsertStraddlingPoints(IPointCloud & cloud, const LinkedCell *LC)
+bool Tesselation::InsertStraddlingPoints(IPointCloud & cloud, const LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);
@@ -426 +426 @@
   TriangleList *triangles = NULL;
   bool AddFlag = false;
-  LinkedCell *BoundaryPoints = NULL;
+  LinkedCell_deprecated *BoundaryPoints = NULL;
   bool SuccessFlag = true;
 
   cloud.GoToFirst();
   PointCloudAdaptor< Tesselation, MapValueIterator<Tesselation::iterator> > newcloud(this, cloud.GetName());
-  BoundaryPoints = new LinkedCell(newcloud, 5.);
+  BoundaryPoints = new LinkedCell_deprecated(newcloud, 5.);
   while (!cloud.IsEnd()) { // we only have to go once through all points, as boundary can become only bigger
     if (AddFlag) {
       delete (BoundaryPoints);
-      BoundaryPoints = new LinkedCell(newcloud, 5.);
+      BoundaryPoints = new LinkedCell_deprecated(newcloud, 5.);
       AddFlag = false;
     }
@@ -846 +846 @@
  * \param &CandidateLine contains other degenerated candidates which we have to subtract as well
  * \param RADIUS radius of sphere
- * \param *LC LinkedCell structure with other atoms
+ * \param *LC LinkedCell_deprecated structure with other atoms
  * \return true - candidate triangle is degenerated, false - candidate triangle is not degenerated
  */
-bool Tesselation::CheckDegeneracy(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell *LC) const
+bool Tesselation::CheckDegeneracy(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell_deprecated *LC) const
 {
   Info FunctionInfo(__func__);
@@ -997 +997 @@
  * \param *out output stream for debugging
  * \param RADIUS radius of virtual rolling sphere
- * \param *LC LinkedCell structure with neighbouring TesselPoint's
+ * \param *LC LinkedCell_deprecated structure with neighbouring TesselPoint's
  * \return true - a starting triangle has been created, false - no valid triple of points found
  */
-bool Tesselation::FindStartingTriangle(const double RADIUS, const LinkedCell *LC)
+bool Tesselation::FindStartingTriangle(const double RADIUS, const LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);
@@ -1130 +1130 @@
  * \param *ThirdNode third point in triangle, not in BoundaryLineSet::endpoints
  * \param RADIUS radius of sphere
- * \param *LC LinkedCell structure
+ * \param *LC LinkedCell_deprecated structure
  * \return true - there is a better candidate (smaller angle than \a ShortestAngle), false - no better TesselPoint candidate found
  */
-//bool Tesselation::HasOtherBaselineBetterCandidate(CandidateForTesselation &CandidateLine, const TesselPoint * const ThirdNode, double RADIUS, const LinkedCell * const LC) const
+//bool Tesselation::HasOtherBaselineBetterCandidate(CandidateForTesselation &CandidateLine, const TesselPoint * const ThirdNode, double RADIUS, const LinkedCell_deprecated * const LC) const
 //{
 //      Info FunctionInfo(__func__);
@@ -1270 +1270 @@
  * @param RADIUS radius of the rolling ball
  * @param N number of found triangles
- * @param *LC LinkedCell structure with neighbouring points
- */
-bool Tesselation::FindNextSuitableTriangle(CandidateForTesselation &CandidateLine, const BoundaryTriangleSet &T, const double& RADIUS, const LinkedCell *LC)
+ * @param *LC LinkedCell_deprecated structure with neighbouring points
+ */
+bool Tesselation::FindNextSuitableTriangle(CandidateForTesselation &CandidateLine, const BoundaryTriangleSet &T, const double& RADIUS, const LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);
@@ -1345 +1345 @@
 
 /** Walks through Tesselation::OpenLines() and finds candidates for newly created ones.
- * \param *&LCList atoms in LinkedCell list
+ * \param *&LCList atoms in LinkedCell_deprecated list
  * \param RADIUS radius of the virtual sphere
  * \return true - for all open lines without candidates so far, a candidate has been found,
  *         false - at least one open line without candidate still
  */
-bool Tesselation::FindCandidatesforOpenLines(const double RADIUS, const LinkedCell *&LCList)
+bool Tesselation::FindCandidatesforOpenLines(const double RADIUS, const LinkedCell_deprecated *&LCList)
 {
   bool TesselationFailFlag = true;
@@ -1372 +1372 @@
  * \param CandidateLine triangle to add
  * \param RADIUS Radius of sphere
- * \param *LC LinkedCell structure
+ * \param *LC LinkedCell_deprecated structure
  * \NOTE we need the copy operator here as the original CandidateForTesselation is removed in
  * AddTesselationLine() in AddCandidateTriangle()
  */
-void Tesselation::AddCandidatePolygon(CandidateForTesselation CandidateLine, const double RADIUS, const LinkedCell *LC)
+void Tesselation::AddCandidatePolygon(CandidateForTesselation CandidateLine, const double RADIUS, const LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);
@@ -1468 +1468 @@
  * \param CandidateLine CanddiateForTesselation structure for the desired BoundaryLine
  * \param RADIUS radius of sphere
- * \param *LC pointer to LinkedCell structure
- */
-void Tesselation::AddDegeneratedTriangle(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell *LC)
+ * \param *LC pointer to LinkedCell_deprecated structure
+ */
+void Tesselation::AddDegeneratedTriangle(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);
@@ -1876 +1876 @@
  * \param Storage[3] array storing angles and other candidate information
  * \param RADIUS radius of virtual sphere
- * \param *LC LinkedCell structure with neighbouring points
- */
-void Tesselation::FindSecondPointForTesselation(TesselPoint* a, Vector Oben, TesselPoint*& OptCandidate, double Storage[3], double RADIUS, const LinkedCell *LC)
+ * \param *LC LinkedCell_deprecated structure with neighbouring points
+ */
+void Tesselation::FindSecondPointForTesselation(TesselPoint* a, Vector Oben, TesselPoint*& OptCandidate, double Storage[3], double RADIUS, const LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);
@@ -1984 +1984 @@
  * @param ThirdPoint third point to avoid in search
  * @param RADIUS radius of sphere
- * @param *LC LinkedCell structure with neighbouring points
- */
-void Tesselation::FindThirdPointForTesselation(const Vector &NormalVector, const Vector &SearchDirection, const Vector &OldSphereCenter, CandidateForTesselation &CandidateLine, const class BoundaryPointSet * const ThirdPoint, const double RADIUS, const LinkedCell *LC) const
+ * @param *LC LinkedCell_deprecated structure with neighbouring points
+ */
+void Tesselation::FindThirdPointForTesselation(const Vector &NormalVector, const Vector &SearchDirection, const Vector &OldSphereCenter, CandidateForTesselation &CandidateLine, const class BoundaryPointSet * const ThirdPoint, const double RADIUS, const LinkedCell_deprecated *LC) const
 {
   Info FunctionInfo(__func__);
@@ -2219 +2219 @@
  * \return map of BoundaryPointSet of closest points sorted by squared distance or NULL.
  */
-DistanceToPointMap * Tesselation::FindClosestBoundaryPointsToVector(const Vector &x, const LinkedCell* LC) const
+DistanceToPointMap * Tesselation::FindClosestBoundaryPointsToVector(const Vector &x, const LinkedCell_deprecated* LC) const
 {
   Info FunctionInfo(__func__);
@@ -2270 +2270 @@
  * \return closest BoundaryLineSet or NULL in degenerate case.
  */
-BoundaryLineSet * Tesselation::FindClosestBoundaryLineToVector(const Vector &x, const LinkedCell* LC) const
+BoundaryLineSet * Tesselation::FindClosestBoundaryLineToVector(const Vector &x, const LinkedCell_deprecated* LC) const
 {
   Info FunctionInfo(__func__);
@@ -2330 +2330 @@
  * \return BoundaryTriangleSet of nearest triangle or NULL.
  */
-TriangleList * Tesselation::FindClosestTrianglesToVector(const Vector &x, const LinkedCell* LC) const
+TriangleList * Tesselation::FindClosestTrianglesToVector(const Vector &x, const LinkedCell_deprecated* LC) const
 {
   Info FunctionInfo(__func__);
@@ -2417 +2417 @@
  * \return list of BoundaryTriangleSet of nearest triangles or NULL.
  */
-class BoundaryTriangleSet * Tesselation::FindClosestTriangleToVector(const Vector &x, const LinkedCell* LC) const
+class BoundaryTriangleSet * Tesselation::FindClosestTriangleToVector(const Vector &x, const LinkedCell_deprecated* LC) const
 {
   Info FunctionInfo(__func__);
@@ -2452 +2452 @@
  * Basically calls Tesselation::GetDistanceToSurface() and checks the sign of the return value.
  * @param point of which to check the position
- * @param *LC LinkedCell structure
+ * @param *LC LinkedCell_deprecated structure
  *
  * @return true if the point is inside the Tesselation structure, false otherwise
  */
-bool Tesselation::IsInnerPoint(const Vector &Point, const LinkedCell* const LC) const
+bool Tesselation::IsInnerPoint(const Vector &Point, const LinkedCell_deprecated* const LC) const
 {
   Info FunctionInfo(__func__);
@@ -2479 +2479 @@
  *
  * @param point of which to check the position
- * @param *LC LinkedCell structure
+ * @param *LC LinkedCell_deprecated structure
  *
  * @return >0 if outside, ==0 if on surface, <0 if inside
@@ -2540 +2540 @@
  * \return distance squared to closest point on surface
  */
-double Tesselation::GetDistanceToSurface(const Vector &Point, const LinkedCell* const LC) const
+double Tesselation::GetDistanceToSurface(const Vector &Point, const LinkedCell_deprecated* const LC) const
 {
   Info FunctionInfo(__func__);
@@ -2555 +2555 @@
  * \return distance squared to closest point on surface
  */
-BoundaryTriangleSet * Tesselation::GetClosestTriangleOnSurface(const Vector &Point, const LinkedCell* const LC) const
+BoundaryTriangleSet * Tesselation::GetClosestTriangleOnSurface(const Vector &Point, const LinkedCell_deprecated* const LC) const
 {
   Info FunctionInfo(__func__);
@@ -3545 +3545 @@
  * \param *LC Linked Cell structure to find nearest point
  */
-void Tesselation::AddBoundaryPointByDegeneratedTriangle(class TesselPoint *point, LinkedCell *LC)
+void Tesselation::AddBoundaryPointByDegeneratedTriangle(class TesselPoint *point, LinkedCell_deprecated *LC)
 {
   Info FunctionInfo(__func__);

src/Tesselation/tesselation.hpp

@@ -40 +40 @@
 class CandidateForTesselation;
 class IPointCloud;
-class LinkedCell;
+class LinkedCell_deprecated;
 class Plane;
 class Tesselation;
@@ -78 +78 @@
     void AddTesselationTriangle(const int nr);
     void AddCandidateTriangle(CandidateForTesselation &CandidateLine, enum centers type);
-    void AddDegeneratedTriangle(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell *LC);
-    void AddCandidatePolygon(CandidateForTesselation CandidateLine, const double RADIUS, const LinkedCell *LC);
+    void AddDegeneratedTriangle(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell_deprecated *LC);
+    void AddCandidatePolygon(CandidateForTesselation CandidateLine, const double RADIUS, const LinkedCell_deprecated *LC);
     void RemoveTesselationTriangle(class BoundaryTriangleSet *triangle);
     void RemoveTesselationLine(class BoundaryLineSet *line);
     void RemoveTesselationPoint(class BoundaryPointSet *point);
-    bool CheckDegeneracy(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell *LC) const;
+    bool CheckDegeneracy(CandidateForTesselation &CandidateLine, const double RADIUS, const LinkedCell_deprecated *LC) const;
 
 
     // concave envelope
-    bool FindStartingTriangle(const double RADIUS, const LinkedCell *LC);
-    void FindSecondPointForTesselation(class TesselPoint* a, Vector Oben, class TesselPoint*& OptCandidate, double Storage[3], double RADIUS, const LinkedCell *LC);
-    void FindThirdPointForTesselation(const Vector &NormalVector, const Vector &SearchDirection, const Vector &OldSphereCenter, CandidateForTesselation &CandidateLine, const class BoundaryPointSet  * const ThirdNode, const double RADIUS, const LinkedCell *LC) const;
-    bool FindNextSuitableTriangle(CandidateForTesselation &CandidateLine, const BoundaryTriangleSet &T, const double& RADIUS, const LinkedCell *LC);
-    bool FindCandidatesforOpenLines(const double RADIUS, const LinkedCell *&LCList);
+    bool FindStartingTriangle(const double RADIUS, const LinkedCell_deprecated *LC);
+    void FindSecondPointForTesselation(class TesselPoint* a, Vector Oben, class TesselPoint*& OptCandidate, double Storage[3], double RADIUS, const LinkedCell_deprecated *LC);
+    void FindThirdPointForTesselation(const Vector &NormalVector, const Vector &SearchDirection, const Vector &OldSphereCenter, CandidateForTesselation &CandidateLine, const class BoundaryPointSet  * const ThirdNode, const double RADIUS, const LinkedCell_deprecated *LC) const;
+    bool FindNextSuitableTriangle(CandidateForTesselation &CandidateLine, const BoundaryTriangleSet &T, const double& RADIUS, const LinkedCell_deprecated *LC);
+    bool FindCandidatesforOpenLines(const double RADIUS, const LinkedCell_deprecated *&LCList);
     int CheckPresenceOfTriangle(class TesselPoint *Candidates[3]) const;
     class BoundaryTriangleSet * GetPresentTriangle(TesselPoint *Candidates[3]);
@@ -98 +98 @@
     void TesselateOnBoundary(IPointCloud & cloud);
     void GuessStartingTriangle();
-    bool InsertStraddlingPoints(IPointCloud & cloud, const LinkedCell *LC);
+    bool InsertStraddlingPoints(IPointCloud & cloud, const LinkedCell_deprecated *LC);
     double RemovePointFromTesselatedSurface(class BoundaryPointSet *point);
     class BoundaryLineSet * FlipBaseline(class BoundaryLineSet *Base);
@@ -106 +106 @@
     IndexToIndex * FindAllDegeneratedLines();
     void RemoveDegeneratedTriangles();
-    void AddBoundaryPointByDegeneratedTriangle(class TesselPoint *point, LinkedCell *LC);
+    void AddBoundaryPointByDegeneratedTriangle(class TesselPoint *point, LinkedCell_deprecated *LC);
     int CorrectAllDegeneratedPolygons();
 
@@ -117 +117 @@
     class BoundaryPointSet * GetCommonEndpoint(const BoundaryLineSet * line1, const BoundaryLineSet * line2) const;
     TriangleList * FindTriangles(const TesselPoint* const Points[3]) const;
-    TriangleList * FindClosestTrianglesToVector(const Vector &x, const LinkedCell* LC) const;
-    BoundaryTriangleSet * FindClosestTriangleToVector(const Vector &x, const LinkedCell* LC) const;
-    bool IsInnerPoint(const Vector &Point, const LinkedCell* const LC) const;
+    TriangleList * FindClosestTrianglesToVector(const Vector &x, const LinkedCell_deprecated* LC) const;
+    BoundaryTriangleSet * FindClosestTriangleToVector(const Vector &x, const LinkedCell_deprecated* LC) const;
+    bool IsInnerPoint(const Vector &Point, const LinkedCell_deprecated* const LC) const;
     double GetDistanceSquaredToTriangle(const Vector &Point, const BoundaryTriangleSet* const triangle) const;
-    double GetDistanceToSurface(const Vector &Point, const LinkedCell* const LC) const;
-    BoundaryTriangleSet * GetClosestTriangleOnSurface(const Vector &Point, const LinkedCell* const LC) const;
+    double GetDistanceToSurface(const Vector &Point, const LinkedCell_deprecated* const LC) const;
+    BoundaryTriangleSet * GetClosestTriangleOnSurface(const Vector &Point, const LinkedCell_deprecated* const LC) const;
     bool AddBoundaryPoint(TesselPoint * Walker, const int n);
-    DistanceToPointMap * FindClosestBoundaryPointsToVector(const Vector &x, const LinkedCell* LC) const;
-    BoundaryLineSet * FindClosestBoundaryLineToVector(const Vector &x, const LinkedCell* LC) const;
+    DistanceToPointMap * FindClosestBoundaryPointsToVector(const Vector &x, const LinkedCell_deprecated* LC) const;
+    BoundaryLineSet * FindClosestBoundaryLineToVector(const Vector &x, const LinkedCell_deprecated* LC) const;
 
     // print for debugging
@@ -163 +163 @@
     mutable PointMap::const_iterator InternalPointer;
 
-    //bool HasOtherBaselineBetterCandidate(const BoundaryLineSet * const BaseRay, const TesselPoint * const OptCandidate, double ShortestAngle, double RADIUS, const LinkedCell * const LC) const;
+    //bool HasOtherBaselineBetterCandidate(const BoundaryLineSet * const BaseRay, const TesselPoint * const OptCandidate, double ShortestAngle, double RADIUS, const LinkedCell_deprecated * const LC) const;
     void FindDegeneratedCandidatesforOpenLines(TesselPoint * const Sprinter, const Vector * const OptCenter);
 };

src/Tesselation/tesselationhelpers.cpp

@@ -409 +409 @@
  * @return point which is second closest to the provided one
  */
-TesselPoint* FindSecondClosestTesselPoint(const Vector& Point, const LinkedCell* const LC)
+TesselPoint* FindSecondClosestTesselPoint(const Vector& Point, const LinkedCell_deprecated* const LC)
 {
         Info FunctionInfo(__func__);
@@ -461 +461 @@
  * @return point which is closest to the provided one, NULL if none found
  */
-TesselPoint* FindClosestTesselPoint(const Vector& Point, TesselPoint *&SecondPoint, const LinkedCell* const LC)
+TesselPoint* FindClosestTesselPoint(const Vector& Point, TesselPoint *&SecondPoint, const LinkedCell_deprecated* const LC)
 {
         Info FunctionInfo(__func__);

src/Tesselation/tesselationhelpers.hpp

@@ -32 +32 @@
 class BoundaryPolygonSet;
 class CandidateForTesselation;
-class LinkedCell;
+class LinkedCell_deprecated;
 class TesselPoint;
 class IPointCloud;
@@ -52 +52 @@
 bool CheckLineCriteriaForDegeneratedTriangle(const BoundaryPointSet * const nodes[3]);
 bool SortCandidates(const CandidateForTesselation* candidate1, const CandidateForTesselation *candidate2);
-TesselPoint* FindClosestTesselPoint(const Vector & Point, TesselPoint *&SecondPoint, const LinkedCell* const LC);
-TesselPoint* FindSecondClosestTesselPoint(const Vector &, const LinkedCell* const LC);
+TesselPoint* FindClosestTesselPoint(const Vector & Point, TesselPoint *&SecondPoint, const LinkedCell_deprecated* const LC);
+TesselPoint* FindSecondClosestTesselPoint(const Vector &, const LinkedCell_deprecated* const LC);
 Vector * GetClosestPointBetweenLine(const BoundaryLineSet * const Base, const BoundaryLineSet * const OtherBase);
 

src/Tesselation/triangleintersectionlist.cpp

@@ -41 +41 @@
  *
  */
-TriangleIntersectionList::TriangleIntersectionList(const Vector &x, const Tesselation *surface, const LinkedCell* LC) :
+TriangleIntersectionList::TriangleIntersectionList(const Vector &x, const Tesselation *surface, const LinkedCell_deprecated* LC) :
   Point(x),
   Tess(surface),

src/Tesselation/triangleintersectionlist.hpp

@@ -23 +23 @@
 
 class BoundaryTriangleSet;
-class LinkedCell;
+class LinkedCell_deprecated;
 class Tesselation;
 class Vector;
@@ -39 +39 @@
 {
 public:
-  TriangleIntersectionList(const Vector &x, const Tesselation *surface, const LinkedCell* LC);
+  TriangleIntersectionList(const Vector &x, const Tesselation *surface, const LinkedCell_deprecated* LC);
   ~TriangleIntersectionList();
 
@@ -54 +54 @@
   const Vector &Point;
   const Tesselation *Tess;
-  const LinkedCell *Vicinity;
+  const LinkedCell_deprecated *Vicinity;
   TriangleVectorMap IntersectionList;
   mutable DistanceTriangleMap DistanceList;

src/Tesselation/unittests/TesselationUnitTest.cpp

@@ -75 +75 @@
   // create linkedcell
   PointCloudAdaptor<TesselPointSTLList> cloud(&Corners, "TesselPointSTLList");
-  LinkedList = new LinkedCell(cloud, 2.*SPHERERADIUS);
+  LinkedList = new LinkedCell_deprecated(cloud, 2.*SPHERERADIUS);
 
   // create tesselation

src/Tesselation/unittests/TesselationUnitTest.hpp

@@ -43 +43 @@
       class Tesselation *TesselStruct;
       TesselPointSTLList Corners;
-      class LinkedCell *LinkedList;
+      class LinkedCell_deprecated *LinkedList;
 };
 

src/Tesselation/unittests/Tesselation_InsideOutsideUnitTest.cpp

@@ -98 +98 @@
   // create linkedcell
   PointCloudAdaptor< TesselPointSTLList > cloud(&Corners, "TesselPointSTLList");
-  LinkedList = new LinkedCell(cloud, 2.*SPHERERADIUS);
+  LinkedList = new LinkedCell_deprecated(cloud, 2.*SPHERERADIUS);
 
   // create tesselation

src/Tesselation/unittests/Tesselation_InsideOutsideUnitTest.hpp

@@ -40 +40 @@
       class Tesselation *TesselStruct;
       TesselPointSTLList Corners;
-      class LinkedCell *LinkedList;
+      class LinkedCell_deprecated *LinkedList;
 };