From 97094d716ae85a0a47c0d2633cfe55ed8a39ed95 Mon Sep 17 00:00:00 2001
From: Alexander Mock <amock@uos.de>
Date: Tue, 10 Dec 2024 01:49:16 +0100
Subject: [PATCH] removed unused includes of json-cpp. removed unused boost
 json parser. removed empty lines between if else

---
 include/lvr2/io/scanio/MetaFormatFactory.hpp    | 1 -
 src/liblvr2/algorithm/pmp/TriangleKdTree.cpp    | 8 +++-----
 src/liblvr2/io/schema/ScanProjectSchemaRdbx.cpp | 3 ---
 3 files changed, 3 insertions(+), 9 deletions(-)

diff --git a/include/lvr2/io/scanio/MetaFormatFactory.hpp b/include/lvr2/io/scanio/MetaFormatFactory.hpp
index 123a117f4..f038f37be 100644
--- a/include/lvr2/io/scanio/MetaFormatFactory.hpp
+++ b/include/lvr2/io/scanio/MetaFormatFactory.hpp
@@ -4,7 +4,6 @@
 #include "lvr2/util/Timestamp.hpp"
 
 #include <yaml-cpp/yaml.h>
-#include <jsoncpp/json/json.h>
 
 #include "lvr2/io/YAML.hpp"
 #include "lvr2/util/IOUtils.hpp"
diff --git a/src/liblvr2/algorithm/pmp/TriangleKdTree.cpp b/src/liblvr2/algorithm/pmp/TriangleKdTree.cpp
index 9b9bd3f25..a7f5d4d1d 100755
--- a/src/liblvr2/algorithm/pmp/TriangleKdTree.cpp
+++ b/src/liblvr2/algorithm/pmp/TriangleKdTree.cpp
@@ -86,7 +86,7 @@ unsigned int TriangleKdTree::build_recurse(Node* node, unsigned int max_faces,
     left->faces = new Triangles();
     left->faces->reserve(node->faces->size() / 2);
     auto* right = new Node();
-    right->faces = new Triangles;
+    right->faces = new Triangles();
     right->faces->reserve(node->faces->size() / 2);
 
     // partition for left and right child
@@ -133,10 +133,9 @@ unsigned int TriangleKdTree::build_recurse(Node* node, unsigned int max_faces,
         // return tree depth
         return depth;
     }
-
-    // or recurse further?
     else
     {
+        // or recurse further?
         // free my memory
         delete node->faces;
         node->faces = nullptr;
@@ -186,10 +185,9 @@ void TriangleKdTree::nearest_recurse(Node* node, const Point& point,
             }
         }
     }
-
-    // non-terminal node
     else
     {
+        // non-terminal node
         Scalar dist = point[node->axis] - node->split;
 
         if (dist <= 0.0)
diff --git a/src/liblvr2/io/schema/ScanProjectSchemaRdbx.cpp b/src/liblvr2/io/schema/ScanProjectSchemaRdbx.cpp
index c519260cd..377e8947b 100644
--- a/src/liblvr2/io/schema/ScanProjectSchemaRdbx.cpp
+++ b/src/liblvr2/io/schema/ScanProjectSchemaRdbx.cpp
@@ -9,9 +9,6 @@
 #include "lvr2/types/ScanTypes.hpp"
 #include "lvr2/io/schema/ScanProjectSchemaRdbx.hpp"
 #include <boost/filesystem.hpp>
-#include <boost/optional/optional_io.hpp>
-#include <boost/property_tree/ptree.hpp>
-#include <boost/property_tree/json_parser.hpp>
 
 #include <iostream>
 #include <fstream>