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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkContourTriangulator.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/**
* @class vtkContourTriangulator
* @brief Fill all 2D contours to create polygons
*
* vtkContourTriangulator will generate triangles to fill all of the 2D
* contours in its input. The contours may be concave, and may even
* contain holes i.e. a contour may contain an internal contour that
* is wound in the opposite direction to indicate that it is a hole.
* @warning
* The triangulation of is done in O(n) time for simple convex
* inputs, but for non-convex inputs the worst-case time is O(n^2*m^2)
* where n is the number of points and m is the number of holes.
* The best triangulation algorithms, in contrast, are O(n log n).
* The resulting triangles may be quite narrow, the algorithm does
* not attempt to produce high-quality triangles.
* @par Thanks:
* Thanks to David Gobbi for contributing this class to VTK.
*/
#ifndef vtkContourTriangulator_h
#define vtkContourTriangulator_h
#include "vtkFiltersGeneralModule.h" // For export macro
#include "vtkPolyDataAlgorithm.h"
class vtkCellArray;
class vtkIdList;
class VTKFILTERSGENERAL_EXPORT vtkContourTriangulator : public vtkPolyDataAlgorithm
{
public:
static vtkContourTriangulator *New();
vtkTypeMacro(vtkContourTriangulator,vtkPolyDataAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent) VTK_OVERRIDE;
//@{
/**
* Check if there was a triangulation failure in the last update.
*/
vtkGetMacro(TriangulationError, int);
//@}
//@{
/**
* Generate errors when the triangulation fails.
* Note that triangulation failures are often minor, because they involve
* tiny triangles that are too small to see.
*/
vtkSetMacro(TriangulationErrorDisplay, int);
vtkBooleanMacro(TriangulationErrorDisplay, int);
vtkGetMacro(TriangulationErrorDisplay, int);
//@}
/**
* A robust method for triangulating a polygon.
* It cleans up the polygon and then applies the ear-cut triangulation.
* A zero return value indicates that triangulation failed.
*/
static int TriangulatePolygon(
vtkIdList *polygon, vtkPoints *points, vtkCellArray *triangles);
/**
* Given some closed contour lines, create a triangle mesh that
* fills those lines. The input lines must be single-segment lines,
* not polylines. The input lines do not have to be in order.
* Only numLines starting from firstLine will be used.
*/
static int TriangulateContours(
vtkPolyData *data, vtkIdType firstLine, vtkIdType numLines,
vtkCellArray *outputPolys, const double normal[3]);
protected:
vtkContourTriangulator();
~vtkContourTriangulator() VTK_OVERRIDE;
int RequestData(
vtkInformation* request, vtkInformationVector** inputVector,
vtkInformationVector* outputVector) VTK_OVERRIDE;
int TriangulationError;
int TriangulationErrorDisplay;
private:
vtkContourTriangulator(const vtkContourTriangulator&) VTK_DELETE_FUNCTION;
void operator=(const vtkContourTriangulator&) VTK_DELETE_FUNCTION;
};
#endif
|
