File: ManualSegmentationTools.h

package info (click to toggle)
cloudcompare 2.11.3-7.1
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 58,224 kB
  • sloc: cpp: 229,982; ansic: 30,723; makefile: 84; sh: 20
file content (154 lines) | stat: -rw-r--r-- 6,901 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
//##########################################################################
//#                                                                        #
//#                               CCLIB                                    #
//#                                                                        #
//#  This program is free software; you can redistribute it and/or modify  #
//#  it under the terms of the GNU Library General Public License as       #
//#  published by the Free Software Foundation; version 2 or later of the  #
//#  License.                                                              #
//#                                                                        #
//#  This program is distributed in the hope that it will be useful,       #
//#  but WITHOUT ANY WARRANTY; without even the implied warranty of        #
//#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the          #
//#  GNU General Public License for more details.                          #
//#                                                                        #
//#          COPYRIGHT: EDF R&D / TELECOM ParisTech (ENST-TSI)             #
//#                                                                        #
//##########################################################################

#ifndef MANUAL_SEGMENTATION_TOOLS_HEADER
#define MANUAL_SEGMENTATION_TOOLS_HEADER

//Local
#include "Neighbourhood.h"

namespace CCLib
{

class GenericIndexedCloud;
class GenericIndexedCloudPersist;
class GenericIndexedMesh;
class GenericProgressCallback;
class ReferenceCloud;
class SimpleMesh;
class Polyline;

//! Manual segmentation algorithms (inside/outside a polyline, etc.)
class CC_CORE_LIB_API ManualSegmentationTools : public CCToolbox
{
public:

	//! Extracts the points that fall inside/outside of a 2D polyline once projected on the screen
	/** The camera parameters of the screen must be transmitted to this method,
		as well as the polyline (generally drawn on the screen by a user)
		expressed in the screen coordinates.
		\param aCloud the cloud to segment
		\param poly the polyline
		\param keepInside if true (resp. false), the points falling inside (resp. outside) the polyline will be extracted
		\param viewMat the optional 4x4 visualization matrix (OpenGL style)
		\return a cloud structure containing references to the extracted points (references to - no duplication)
	**/
	static ReferenceCloud* segment(GenericIndexedCloudPersist* aCloud, const Polyline* poly, bool keepInside, const float* viewMat = nullptr);

	//! Selects the points which associated scalar value fall inside or outside a specified interval
	/** \warning: be sure to activate an OUTPUT scalar field on the input cloud
		\param cloud the RefrenceCloud to segment
		\param minDist the lower boundary
		\param maxDist the upper boundary
		\param outside whether to select the points inside or outside
		\return a new cloud structure containing the extracted points (references to - no duplication)
	**/
	static ReferenceCloud* segmentReferenceCloud(ReferenceCloud * cloud, ScalarType minDist, ScalarType maxDist, bool outside);

	//! Selects the points which associated scalar value fall inside or outside a specified interval
	/** \warning: be sure to activate an OUTPUT scalar field on the input cloud
		\param cloud the cloud to segment
		\param minDist the lower boundary
		\param maxDist the upper boundary
		\param outside whether to select the points inside or outside
		\return a new cloud structure containing the extracted points (references to - no duplication)
	**/
	static ReferenceCloud* segment(GenericIndexedCloudPersist* cloud, ScalarType minDist, ScalarType maxDist, bool outside = false);


	//! Tests if a point is inside a polygon (2D)
	/** \param P a 2D point
		\param polyVertices polygon vertices (considered as ordered 2D poyline vertices)
		\return true if P is inside poly
	**/
	static bool isPointInsidePoly(const CCVector2& P, const GenericIndexedCloud* polyVertices);

	//! Tests if a point is inside a polygon (2D)
	/** \param P a 2D point
		\param polyVertices polygon vertices (considered as ordered 2D poyline vertices)
		\return true if P is inside poly
	**/
	static bool isPointInsidePoly(const CCVector2& P, const std::vector<CCVector2>& polyVertices);

	//! Segments a mesh knowing which vertices should be kept or not
	/** This method takes as input a set of vertex indexes and creates a new mesh
		composed either of:
		- the triangles that have exactly those points as vertices (pointsWillBeInside = true)
		- or all the triangles for which no vertices are part of this subset (pointsWillBeInside = false).
		
		\warning No re-triangulation on the border will occur.

		\param theMesh a mesh
		\param pointsIndexes the vertices indexes as a set of references
		\param pointsWillBeInside specifies if the points corresponding to the input indexes should be the new mesh vertices, or the opposite
		\param progressCb the client application can get some notification of the process progress through this callback mechanism (see GenericProgressCallback)
		\param destCloud optionally, a cloud object can be specified to be associated to the new created mesh object, instead of the cloud associated to the ReferenceCloud "pointsIndexes"
		\param indexShift optionally, a shift can be added to all vertex indexes of the new mesh
		\return a new mesh structure, or 0 if something went wrong
	**/
	static GenericIndexedMesh* segmentMesh(	GenericIndexedMesh* theMesh,
											ReferenceCloud* pointsIndexes,
											bool pointsWillBeInside,
											GenericProgressCallback* progressCb = nullptr,
											GenericIndexedCloud* destCloud = nullptr,
											unsigned indexShift = 0);

	//! Input/output parameters for the segmentMeshWitAAPlane method
	struct MeshCutterParams
	{
		SimpleMesh* insideMesh;
		SimpleMesh* outsideMesh;
		bool generateOutsideMesh;
		double epsilon;
		//for infinite plane intersection
		unsigned char planeOrthoDim;
		double planeCoord;
		//for box intersection
		CCVector3d bbMin, bbMax;
		//for the reprojection of triangle features
		bool trackOrigIndexes;
		std::vector<unsigned> origTriIndexesMapInside;
		std::vector<unsigned> origTriIndexesMapOutside;

		MeshCutterParams()
			: insideMesh(nullptr)
			, outsideMesh(nullptr)
			, generateOutsideMesh(false)
			, epsilon(ZERO_TOLERANCE)
			, planeOrthoDim(0)
			, planeCoord(0)
			, bbMin(0, 0, 0)
			, bbMax(0, 0, 0)
			, trackOrigIndexes(false)
		{}
	};

	static bool segmentMeshWithAAPlane(GenericIndexedMesh* mesh,
		GenericIndexedCloudPersist* vertices,
		MeshCutterParams& ioParams,
		GenericProgressCallback* progressCb = nullptr);

	static bool segmentMeshWithAABox(GenericIndexedMesh* mesh,
		GenericIndexedCloudPersist* vertices,
		MeshCutterParams& ioParams,
		GenericProgressCallback* progressCb = nullptr);
};

}

#endif //MANUAL_SEGMENTATION_TOOLS_HEADER