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
|
/*=========================================================================
Program: Visualization Toolkit
Module: TestIntersectionPolyDataFilter2.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 <vtkIntersectionPolyDataFilter.h>
#include <vtkActor.h>
#include <vtkPolyDataMapper.h>
#include <vtkProperty.h>
#include <vtkRenderer.h>
#include <vtkRenderWindow.h>
#include <vtkRenderWindowInteractor.h>
#include <vtkSmartPointer.h>
int TestIntersectionPolyDataFilter2(int, char *[])
{
// Set up two polydata representing two triangles that share a vertex
int coplanar;
double isectpt1[3], isectpt2[3];
double thisCellTri[9] = {-30.125,
29.3125,
-27.1875,
-29.9375,
29.375,
-27.3125,
-30.0625,
28.5,
-27.25};
double otherCellTri[9] = {-29.9375,
29.3125,
-27.3125,
-29.875,
29.8125,
-27.5,
-29.75,
27.6875,
-27.4375};
double surfaceid[2];
double tolerance = 1e-6;
int intersects = vtkIntersectionPolyDataFilter
::TriangleTriangleIntersection(&thisCellTri[0],
&thisCellTri[3],
&thisCellTri[6],
&otherCellTri[0],
&otherCellTri[3],
&otherCellTri[6],
coplanar,
isectpt1, isectpt2,
surfaceid, tolerance);
std::cerr << "First: "
<< thisCellTri[0] << ", "
<< thisCellTri[3] << ", "
<< thisCellTri[6] << std::endl;
std::cerr << "Second: "
<< otherCellTri[0] << ", "
<< otherCellTri[3] << ", "
<< otherCellTri[6] << std::endl;
if ( intersects )
{
std::cerr << "Triangles with shared vertex should not be reported to intersect" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
