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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkLinearSubdivisionFilter.cxx
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.
=========================================================================*/
#include "vtkLinearSubdivisionFilter.h"
#include "vtkCellArray.h"
#include "vtkEdgeTable.h"
#include "vtkIdList.h"
#include "vtkObjectFactory.h"
#include "vtkPointData.h"
#include "vtkPolyData.h"
vtkStandardNewMacro(vtkLinearSubdivisionFilter);
int vtkLinearSubdivisionFilter::GenerateSubdivisionPoints (vtkPolyData *inputDS, vtkIntArray *edgeData, vtkPoints *outputPts, vtkPointData *outputPD)
{
vtkIdType *pts = 0;
int edgeId;
vtkIdType npts, cellId, newId;
vtkIdType p1, p2;
vtkCellArray *inputPolys=inputDS->GetPolys();
vtkEdgeTable *edgeTable;
vtkIdList *cellIds = vtkIdList::New();
vtkIdList *pointIds = vtkIdList::New();
vtkPoints *inputPts=inputDS->GetPoints();
vtkPointData *inputPD=inputDS->GetPointData();
static double weights[2] = {.5, .5};
// Create an edge table to keep track of which edges we've processed
edgeTable = vtkEdgeTable::New();
edgeTable->InitEdgeInsertion(inputDS->GetNumberOfPoints());
pointIds->SetNumberOfIds(2);
double total = inputPolys->GetNumberOfCells();
double curr = 0;
// Generate new points for subdivisions surface
for (cellId=0, inputPolys->InitTraversal();
inputPolys->GetNextCell(npts, pts); cellId++)
{
if ( inputDS->GetCellType(cellId) != VTK_TRIANGLE )
{
continue;
}
p1 = pts[2];
p2 = pts[0];
for (edgeId=0; edgeId < 3; edgeId++)
{
outputPD->CopyData (inputPD, p1, p1);
outputPD->CopyData (inputPD, p2, p2);
// Do we need to create a point on this edge?
if (edgeTable->IsEdge (p1, p2) == -1)
{
edgeTable->InsertEdge (p1, p2);
// Compute Position andnew PointData using the same subdivision scheme
pointIds->SetId(0,p1);
pointIds->SetId(1,p2);
newId =
this->InterpolatePosition (inputPts, outputPts, pointIds, weights);
outputPD->InterpolatePoint (inputPD, newId, pointIds, weights);
}
else // we have already created a point on this edge. find it
{
newId = this->FindEdge (inputDS, cellId, p1, p2, edgeData, cellIds);
}
edgeData->InsertComponent(cellId,edgeId,newId);
p1 = p2;
if (edgeId < 2)
{
p2 = pts[edgeId + 1];
}
} // each edge
this->UpdateProgress(curr / total);
curr += 1;
} // each cell
edgeTable->Delete();
cellIds->Delete();
pointIds->Delete();
return 1;
}
|
