Merge pull request #409 from LIHPC-Computational-Geometry/Adding_Smar…

…tLaplacian

- Added SmartLaplacian3UC in smoothy component

smoothy/CMakeLists.txt

@@ -16,6 +16,7 @@ set(GMDS_INC
         inc/gmds/smoothy/EllipticSmoothing.h
         inc/gmds/smoothy/EllipticSmoother2D.h
         inc/gmds/smoothy/SmoothingClassificationService.h
+        inc/gmds/smoothy/SmartLaplacian3UC.h
         )
 set(GMDS_SRC
         src/AbstractSmoother.cpp
@@ -27,6 +28,7 @@ set(GMDS_SRC
         src/EllipticSmoothing.cpp
         src/EllipticSmoother2D.cpp
         src/SmoothingClassificationService.cpp
+        src/SmartLaplacian3UC.cpp
         )
 #==============================================================================
 # HLBFGS include link (old fashion include)

smoothy/inc/gmds/smoothy/SmartLaplacian3UC.h

@@ -0,0 +1,51 @@
+/*----------------------------------------------------------------------------*/
+// GMDS File Headers
+/*----------------------------------------------------------------------------*/
+#include "AbstractSmoother.h"
+#include "GMDSSmoothy_export.h"
+#include <gmds/utils/CommonTypes.h>
+#include <gmds/utils/Exception.h>
+/*----------------------------------------------------------------------------*/
+#ifndef GMDS_SMARTLAPLACIAN_3UC_H
+#	define GMDS_SMARTLAPLACIAN_3UC_H
+/*----------------------------------------------------------------------------*/
+namespace gmds {
+/*----------------------------------------------------------------------------*/
+namespace smoothy {
+/*----------------------------------------------------------------------------*/
+/** \class LaplacianSmoother
+ *  \brief This class provides a straightforward implementation of a Laplacian
+ *         smoother for unclassified 2D meshes.
+ */
+/*----------------------------------------------------------------------------*/
+class GMDSSmoothy_API SmartLaplacian3UC : public AbstractSmoother
+{
+ public:
+	/**@brief constructor
+	 * @param AMesh the mesh we work on
+	 */
+	SmartLaplacian3UC(Mesh *AMesh);
+	/** @brief check if the mesh is valid for performing the algorithm.
+	 * More specifically the mesh must not have regions and the relation N2F
+	 * must be available.
+	 *
+	 * @return true if the mesh is valid, false otherwise.
+	 */
+	bool isValid() const override;
+	/** @brief perform the smoothing algorithm
+	 * @return 1 if the mesh is smoothed
+	 */
+	int smooth() override;
+
+ private:
+	void getAdjacentNodes(const Region& ARegion, const TCellID &ANode1, TCellID &ANode2, TCellID &ANode3, TCellID &ANode4);
+
+	void getAdjacentQuality(const Node& ANode, std::vector<double>& AQualities);
+};
+/*----------------------------------------------------------------------------*/
+}     // namespace smoothy
+/*----------------------------------------------------------------------------*/
+}     // end namespace gmds
+/*----------------------------------------------------------------------------*/
+#endif     // GMDS_SMARTLAPLACIAN_3UC_H
+/*----------------------------------------------------------------------------*/

smoothy/src/SmartLaplacian3UC.cpp

@@ -0,0 +1,140 @@
+/*----------------------------------------------------------------------------*/
+#include <gmds/smoothy/SmartLaplacian3UC.h>
+/*----------------------------------------------------------------------------*/
+using namespace gmds;
+using namespace gmds::smoothy;
+/*----------------------------------------------------------------------------*/
+SmartLaplacian3UC::SmartLaplacian3UC(gmds::Mesh *AMesh) : AbstractSmoother(AMesh) {}
+/*----------------------------------------------------------------------------*/
+bool SmartLaplacian3UC::isValid() const
+{
+	MeshModel model = m_mesh->getModel();
+
+	if (!model.has(N2R) && !model.has(R2N)) return false;
+
+	return true;
+}
+/*----------------------------------------------------------------------------*/
+int SmartLaplacian3UC::smooth()
+{
+	// First we build the N2N connectivity for the nodes to be smoothed
+	std::map<TCellID, std::set<TCellID>> n2n;
+	for (auto nid : m_nodes) {
+		Node ni = m_mesh->get<Node>(nid);
+		std::vector<Region> ni_regions = ni.get<Region>();
+		for (const auto& r : ni_regions) {
+			TCellID id1, id2, id3;
+			getAdjacentNodes(r, nid, id1, id2, id3);
+			n2n[nid].insert(id1);
+			n2n[nid].insert(id2);
+			n2n[nid].insert(id3);
+		}
+	}
+
+	for (auto i = 0; i < m_nb_iterations; i++) {
+
+		// We smooth each node in a naive way
+		for (auto nid : m_nodes) {
+			Node ni = m_mesh->get<Node>(nid);
+			math::Point origin = ni.point();
+			std::vector<double> origin_qualities;
+			getAdjacentQuality(ni, origin_qualities);
+
+			std::set<TCellID> adj_n = n2n[nid];
+			math::Point pi(0, 0, 0);
+			for (auto adj_id : adj_n) {
+				math::Point pj = m_mesh->get<Node>(adj_id).point();
+				pi = pi + pj;
+			}
+			pi = pi * (1.0 / adj_n.size());
+			ni.setPoint(pi);
+
+			std::vector<double> new_qualities;
+			getAdjacentQuality(ni, new_qualities);
+
+			if(origin_qualities.size() != new_qualities.size()){
+				throw GMDSException("Error: number of adjacent region of node " + std::to_string(nid) + " is not equal after laplacian");
+			}
+
+			bool revert = false;
+
+			for(int i = 0; i < origin_qualities.size(); i++){
+				if(new_qualities[i] < origin_qualities[i]) revert = true;
+			}
+
+			if(revert) ni.setPoint(origin);
+		}
+	}
+
+	return 1;
+}
+/*----------------------------------------------------------------------------*/
+void SmartLaplacian3UC::getAdjacentNodes(const Region& ARegion, const TCellID & ANode1, TCellID& ANode2, TCellID& ANode3, TCellID& ANode4){
+	std::vector<TCellID> nodes = ARegion.getIDs<Node>();
+	int index1 = -1, index2, index3, index4;
+	for (int i = 0; i < 8; i++) {
+		if (nodes[i] == ANode1)
+			index1 = i;
+	}
+	switch (index1) {
+	case -1:
+#ifdef _DEBUG
+		std::cout << "Index error" << std::endl;
+#endif  //_DEBUG
+		throw GMDSException("getAdjacentNodes: node 1 is not adjacent to the face");
+		break;
+	case 0:
+		index2 = 3;
+		index3 = 1;
+		index4 = 4;
+		break;
+	case 1:
+		index2 = 0;
+		index3 = 2;
+		index4 = 5;
+		break;
+	case 2:
+		index2 = 1;
+		index3 = 3;
+		index4 = 6;
+		break;
+	case 3:
+		index2 = 2;
+		index3 = 0;
+		index4 = 7;
+		break;
+	case 4:
+		index2 = 7;
+		index3 = 5;
+		index4 = 0;
+		break;
+	case 5:
+		index2 = 4;
+		index3 = 6;
+		index4 = 1;
+		break;
+	case 6:
+		index2 = 5;
+		index3 = 7;
+		index4 = 2;
+		break;
+	case 7:
+		index2 = 6;
+		index3 = 4;
+		index4 = 3;
+		break;
+	}
+
+	ANode2 = nodes[index2];
+	ANode3 = nodes[index3];
+	ANode4 = nodes[index4];
+}
+/*----------------------------------------------------------------------------*/
+void SmartLaplacian3UC::getAdjacentQuality(const Node &ANode, std::vector<double> &AQualities)
+{
+	std::vector<Region> n_regions = ANode.get<Region>();
+
+	for(auto r : n_regions){
+		AQualities.push_back(r.computeScaledJacobian());
+	}
+}