diff --git a/SimpleTests/MeshTests/MeshSearchTest.cpp b/SimpleTests/MeshTests/MeshSearchTest.cpp
index 30d9904627d5f6283df50b7aeb6f08a483b921ac..1fc453f9e7a6f6b8bac48477006b28cfabaa5aaf 100644
--- a/SimpleTests/MeshTests/MeshSearchTest.cpp
+++ b/SimpleTests/MeshTests/MeshSearchTest.cpp
@@ -56,7 +56,7 @@ void testMeshGridAlgorithm(MeshLib::Mesh const*const mesh,
 		INFO ("[MeshGridAlgorithm] searching %d points ...", pnts_for_search.size());
 		clock_t start = clock();
 		for (std::size_t k(0); k<n_pnts_for_search; k++) {
-			MeshLib::Node const* node(mesh_grid.getNearestPoint(*pnts_for_search[k]));
+			MeshLib::Node const* node(mesh_grid.getNearestPoint(*(pnts_for_search[k])));
 			idx_found_nodes.push_back(node->getID());
 		}
 		clock_t stop = clock();
@@ -80,7 +80,7 @@ void testMeshGridAlgorithm(MeshLib::Mesh const*const mesh,
 		INFO ("[MeshGridAlgorithm] searching %d points ...", pnts_for_search.size());
 		clock_t start = clock();
 		for (std::size_t k(0); k<n_pnts_for_search; k++) {
-			MeshLib::Node const* node(mesh_grid.getNearestPoint(pnts_for_search[k]));
+			MeshLib::Node const* node(mesh_grid.getNearestPoint(*(pnts_for_search[k])));
 			idx_found_nodes.push_back(node->getID());
 		}
 		clock_t stop = clock();
@@ -135,7 +135,7 @@ int main(int argc, char *argv[])
 	std::vector<GeoLib::Point*> pnts_for_search;
 	unsigned n(std::min(static_cast<unsigned>(nodes.size()), number_arg.getValue()));
 	for (std::size_t k(0); k<n; k++) {
-		pnts_for_search.push_back(new GeoLib::Point(nodes[k]));
+		pnts_for_search.push_back(new GeoLib::Point(*(nodes[k]), k));
 	}
 
 	std::vector<std::size_t> idx_found_nodes;