-
Notifications
You must be signed in to change notification settings - Fork 1
/
vtkParallelopipedRepresentation.cxx
1679 lines (1440 loc) · 60.1 KB
/
vtkParallelopipedRepresentation.cxx
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*=========================================================================
Program: Visualization Toolkit
Module: vtkParallelopipedRepresentation.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 "vtkParallelopipedRepresentation.h"
#include "vtkSmartPointer.h"
#include "vtkActor.h"
#include "vtkCamera.h"
#include "vtkCellArray.h"
#include "vtkDoubleArray.h"
#include "vtkMath.h"
#include "vtkObjectFactory.h"
#include "vtkPolyData.h"
#include "vtkPolyDataMapper.h"
#include "vtkProperty.h"
#include "vtkRenderWindowInteractor.h"
#include "vtkRenderer.h"
#include "vtkInteractorObserver.h"
#include "vtkEvent.h"
#include "vtkSphereHandleRepresentation.h"
#include "vtkLine.h"
#include "vtkClosedSurfacePointPlacer.h"
#include "vtkPlaneCollection.h"
#include "vtkPlane.h"
#include <vtkstd/vector>
#include <vtkstd/set>
#include <vtkstd/algorithm>
#define min(x,y) ((x<y) ? (x) : (y))
#define max(x,y) ((x>y) ? (x) : (y))
//----------------------------------------------------------------------------
// This class manages topological information for a parallelopiped with a
// chair etched out at any node.
// README : Uncomment the line that reads "PrintTopology(cout) to
// understand what the class does. The goal of the class is succintly
// described in that one line.
class vtkParallelopipedTopology
{
public:
typedef struct Line { vtkIdType Id[2];
Line(vtkIdType a, vtkIdType b) { Id[0]=a; Id[1]=b; } } LineType;
typedef vtkstd::vector< vtkIdType > CellType;
typedef vtkstd::vector< CellType > CliqueType;
// Diametric opposite of Corner 0 = 6, 1 = 7, 2 = 4, 3 = 5.
// Mathematically, if a diametric corner is represented by a 3 bit value:
// abc, its diametric opposite = a'b'c.
static int GetDiametricOppositeOfCorner( int i )
{
return ((~i) & 0x6) | (i & 0x1);
}
// Get the corners connected to corner 'i'. There will be three such corners
void GetNeighbors( int c, vtkIdType neighborPtIds[3], int configuration = 0 ) const
{
vtkstd::set< vtkIdType > neighbors;
const CliqueType & clique = m_Topology[configuration];
for (CliqueType::const_iterator clit = clique.begin();
clit != clique.end(); ++clit)
{
if (vtkstd::find(clit->begin(), clit->end(), c) != clit->end())
{
const CellType cell = RotateCell( *clit, c );
neighbors.insert(cell[0]);
neighbors.insert(cell[cell.size()-2]);
}
}
int i = 0;
for (vtkstd::set< vtkIdType >::const_iterator it = neighbors.begin();
it != neighbors.end(); neighborPtIds[i++] = *it, ++it)
{
;
}
}
void GetNeighbors( vtkIdType node, vtkIdType neighborPtIds[3],
vtkCellArray *neighborCells, vtkstd::vector< LineType > & lines )
{
GetNeighbors( 8 + GetDiametricOppositeOfCorner(node), neighborPtIds, node+1 );
vtkIdType opposingNeighborPtIds[3],
opposite = GetDiametricOppositeOfCorner(node);
GetNeighbors( opposite, opposingNeighborPtIds );
vtkstd::vector< vtkIdType > nodes(2);
for (int i = 0; i < 3; i++)
{
nodes[0] = neighborPtIds[i];
for (int j = 0; j < 3; j++)
{
nodes[1] = opposingNeighborPtIds[j];
const CliqueType cells =
FindCellsContainingNodes( m_Topology[node+1], nodes );
if (cells.size())
{
PopulateTopology( cells, neighborCells );
lines.push_back( LineType(opposite, nodes[1]) );
}
}
}
}
void FindCellsContainingNodes( int configuration, vtkCellArray *cellArray,
const vtkstd::vector< vtkIdType > & nodes ) const
{
vtkParallelopipedTopology::PopulateTopology(
FindCellsContainingNodes( m_Topology[configuration], nodes), cellArray );
}
vtkstd::vector< CellType > FindCellsContainingNodes(
int configuration, const vtkstd::vector< vtkIdType > & nodes )
{ return FindCellsContainingNodes( m_Topology[configuration], nodes); }
vtkParallelopipedTopology()
{
// The topology of a parallelopiped.
CliqueType clique;
AddCellToClique(clique, 3,0,4,7);
AddCellToClique(clique, 1,2,6,5);
AddCellToClique(clique, 0,1,5,4);
AddCellToClique(clique, 2,3,7,6);
AddCellToClique(clique, 0,3,2,1);
AddCellToClique(clique, 4,5,6,7);
m_Topology.push_back(clique);
for ( vtkIdType i = 0; i < 8;
m_Topology.push_back( GetChairClique( i++, clique ) ) )
{
;
}
// README : The goal of the class is succintly described by the line below
// PrintTopology( cout );
}
// Populate topoplogy into a vtkCellArray.
// If configuration is 0, the topoology populated is that of a parallelopiped.
// If configuration > 0, the topology populated is that of a parallelopiped
// with a chair at node = (configuration - 1).
void PopulateTopology( int configuration, vtkCellArray * cellArray ) const
{ vtkParallelopipedTopology::PopulateTopology(
m_Topology[configuration], cellArray ); }
void PrintTopology(ostream &os) const
{
os << "Connectivity of Point Ids in a parallelopiped: " << endl;
PrintClique(m_Topology[0], os);
for (int i = 0; i < 8; i++)
{
os << "Connectivity of Point Ids in a parallelopiped "
<< "with chair carved out at node: " << i << endl;
PrintClique(m_Topology[i+1], os);
}
}
private:
void AddCellToClique( CliqueType & clique,
vtkIdType a, vtkIdType b, vtkIdType c, vtkIdType d)
{
CellType v(4);
v[0] = a; v[1] = b; v[2] = c; v[3] = d;
clique.push_back(v);
}
static CellType RotateCell( const CellType & cell, vtkIdType endval )
{
CellType outputCell;
for (CellType::const_iterator cit = cell.begin(); cit != cell.end(); ++cit)
{
outputCell.push_back(*cit);
if (*cit == endval) break;
}
for (CellType::const_reverse_iterator cit = cell.rbegin(); cit != cell.rend(); ++cit)
{
if (*cit == endval) break;
outputCell.insert(outputCell.begin(), *cit);
}
return outputCell;
}
static CellType ReverseCell( const CellType & cell )
{
CellType outputCell;
for (CellType::const_reverse_iterator cit = cell.rbegin(); cit != cell.rend(); ++cit)
outputCell.push_back(*cit);
return outputCell;
}
static CellType ChairCell( const CellType & cell )
{
CellType outputCell = ReverseCell(cell);
for (CellType::iterator cit = outputCell.begin(); cit != outputCell.end(); ++cit)
*cit += 8;
return outputCell;
}
static CellType ChairCell( vtkIdType c, const CellType & cell )
{
CellType tmpCell = RotateCell(cell, c);
CellType::iterator it = tmpCell.end();
tmpCell.erase(--it);
CellType outputCell = tmpCell;
for (CellType::reverse_iterator cit = tmpCell.rbegin(); cit != tmpCell.rend(); ++cit)
outputCell.push_back(*cit + 8);
return outputCell;
}
static CliqueType GetChairClique( vtkIdType c, const CliqueType & clique )
{
CliqueType outputClique;
for (CliqueType::const_iterator clit = clique.begin();
clit != clique.end(); ++clit)
{
if (vtkstd::find(clit->begin(), clit->end(), c) == clit->end())
{
outputClique.insert( outputClique.begin(), *clit );
outputClique.push_back( ChairCell(*clit) );
}
else
{
outputClique.insert( outputClique.begin(), ChairCell(c, *clit) );
}
}
return outputClique;
}
static void PopulateTopology( const CliqueType & clique, vtkCellArray * cellArray )
{
for (CliqueType::const_iterator clit = clique.begin();
clit != clique.end(); ++clit)
{
vtkIdType *ids = new vtkIdType[clit->size()];
int i = 0;
for (CellType::const_iterator cit = clit->begin();
cit != clit->end(); ids[i++] = *cit, ++cit )
{
;
}
cellArray->InsertNextCell( clit->size(), ids );
delete [] ids;
}
}
// Find all the cells in a given a configuration (specified by the clique)
// that contain the nodes. (specified by nodes). Each cell returned must
// contain all the nodes specified.
static vtkstd::vector< CellType > FindCellsContainingNodes(
const CliqueType & clique, const vtkstd::vector< vtkIdType > & nodes )
{
vtkstd::vector< CellType > cells;
for (CliqueType::const_iterator clit = clique.begin();
clit != clique.end(); ++clit)
{
bool found = true;
for (vtkstd::vector< vtkIdType >::const_iterator nit = nodes.begin();
nit != nodes.end(); ++nit)
found &= (vtkstd::find(clit->begin(), clit->end(), *nit) != clit->end());
if (found) cells.push_back(*clit);
}
return cells;
}
static void PrintCell( const CellType & cell, ostream &os )
{
for (CellType::const_iterator cit = cell.begin();
cit != cell.end(); os << *cit << " ", ++cit )
{
;
}
}
static void PrintClique( const CliqueType & clique, ostream &os )
{
os << " Clique has " << clique.size() << " cells." << endl;
for (CliqueType::const_iterator clit = clique.begin();
clit != clique.end(); ++clit)
{
os << " Cell PtIds: ";
PrintCell( *clit, os );
os << endl;
}
}
vtkstd::vector< CliqueType > m_Topology;
};
//----------------------------------------------------------------------------
vtkStandardNewMacro(vtkParallelopipedRepresentation);
vtkCxxSetObjectMacro(vtkParallelopipedRepresentation,
HandleProperty, vtkProperty);
vtkCxxSetObjectMacro(vtkParallelopipedRepresentation,
SelectedHandleProperty, vtkProperty);
vtkCxxSetObjectMacro(vtkParallelopipedRepresentation,
HoveredHandleProperty, vtkProperty);
//----------------------------------------------------------------------------
vtkParallelopipedRepresentation::vtkParallelopipedRepresentation()
{
// This contains all the connectivity information.
this->Topology = new vtkParallelopipedTopology;
this->LastEventPosition[0] = this->LastEventPosition[1] = 0.0;
// Construct the poly data representing the hex
this->HexPolyData = vtkPolyData::New();
this->HexMapper = vtkPolyDataMapper::New();
this->HexActor = vtkActor::New();
this->HexMapper->SetInput(HexPolyData);
this->HexActor->SetMapper(this->HexMapper);
// 16 points from the parallelopiped and the chair (also modelled as a
// parallelopiped).
this->Points = vtkPoints::New(VTK_DOUBLE);
this->Points->SetNumberOfPoints(16);
this->HexPolyData->SetPoints(this->Points);
vtkCellArray *cellArray = vtkCellArray::New();
this->Topology->PopulateTopology( 0, cellArray );
this->HexPolyData->SetPolys(cellArray);
this->HexPolyData->BuildCells();
cellArray->Delete();
// The face of the polyhedron
vtkIdType pts[4] = { 4, 5, 6, 7 };
vtkCellArray * cells = vtkCellArray::New();
cells->Allocate(cells->EstimateSize(1,4));
cells->InsertNextCell(4,pts); //temporary, replaced later
this->HexFacePolyData = vtkPolyData::New();
this->HexFaceMapper = vtkPolyDataMapper::New();
this->HexFaceActor = vtkActor::New();
this->HexFacePolyData->SetPoints(this->Points);
this->HexFacePolyData->SetPolys(cells);
this->HexFaceMapper->SetInput(HexFacePolyData);
this->HexFaceActor->SetMapper(this->HexFaceMapper);
cells->Delete();
// Set some default properties.
// Handle properties
this->HandleProperty = vtkProperty::New();
this->SelectedHandleProperty = vtkProperty::New();
this->HoveredHandleProperty = vtkProperty::New();
this->HandleProperty ->SetColor(1.0,1.0,0.7);
this->SelectedHandleProperty->SetColor(1.0,0.2,0.1);
this->HoveredHandleProperty ->SetColor(1.0,0.7,0.5);
// Face properties
this->FaceProperty = vtkProperty::New();
this->SelectedFaceProperty = vtkProperty::New();
this->FaceProperty ->SetColor(1,1,1);
this->SelectedFaceProperty->SetColor(0,0,1);
this->FaceProperty->SetOpacity(0.0);
this->SelectedFaceProperty->SetOpacity(0.25);
// Outline properties (for the hex and the chair)
this->OutlineProperty = vtkProperty::New();
this->OutlineProperty->SetRepresentationToWireframe();
this->OutlineProperty->SetAmbient(1.0);
this->OutlineProperty->SetAmbientColor(1.0,1.0,1.0);
this->OutlineProperty->SetLineWidth(2.0);
this->SelectedOutlineProperty = vtkProperty::New();
this->SelectedOutlineProperty->SetRepresentationToWireframe();
this->SelectedOutlineProperty->SetAmbient(1.0);
this->SelectedOutlineProperty->SetAmbientColor(0.0,0.0,1.0);
this->SelectedOutlineProperty->SetLineWidth(2.0);
this->HexActor->SetProperty(this->OutlineProperty);
this->HexFaceActor->SetProperty(this->FaceProperty);
// Handle looks like a sphere.
this->HandleRepresentation = NULL;
this->HandleRepresentations = NULL;
vtkSphereHandleRepresentation * hRep = vtkSphereHandleRepresentation::New();
this->SetHandleRepresentation(hRep);
hRep->Delete();
this->CurrentHandleIdx = -1;
this->LastResizeAxisIdx = -1;
this->ChairHandleIdx = -1;
// Point placer to dictate placement of the chair point inside the
// parallelopiped.
this->ChairPointPlacer = vtkClosedSurfacePointPlacer::New();
this->InitialChairDepth = 0.25;
this->MinimumThickness = 0.05;
this->AbsoluteMinimumThickness = 0.05;
this->PlaceFactor = 1.0;
// Define the point coordinates and initial placement of the widget
double bounds[6] = { -0.5, 0.5, -0.5, 0.5, -0.5, 0.5 };
this->PlaceWidget(bounds);
}
//----------------------------------------------------------------------------
vtkParallelopipedRepresentation::~vtkParallelopipedRepresentation()
{
this->HexActor->Delete();
this->HexMapper->Delete();
this->HexPolyData->Delete();
this->Points->Delete();
this->HexFaceActor->Delete();
this->HexFaceMapper->Delete();
this->HexFacePolyData->Delete();
this->SetHandleRepresentation(NULL);
this->FaceProperty->Delete();
this->SelectedFaceProperty->Delete();
this->OutlineProperty->Delete();
this->SelectedOutlineProperty->Delete();
this->SetHandleProperty ( NULL );
this->SetSelectedHandleProperty ( NULL );
this->SetHoveredHandleProperty ( NULL );
this->ChairPointPlacer->Delete();
delete this->Topology;
}
//----------------------------------------------------------------------------
vtkHandleRepresentation* vtkParallelopipedRepresentation
::GetHandleRepresentation( int handleIndex )
{
return (handleIndex > 7) ? NULL : this->HandleRepresentations[handleIndex];
}
//----------------------------------------------------------------------
// You can swap the handle representation to one that you like.
void vtkParallelopipedRepresentation
::SetHandleRepresentation(vtkHandleRepresentation *handle)
{
if ( handle == this->HandleRepresentation )
{
return;
}
vtkSetObjectBodyMacro( HandleRepresentation,
vtkHandleRepresentation, handle );
if (this->HandleRepresentation)
{
// Allocate the 8 handles if they haven't been allocated.
if (!this->HandleRepresentations)
{
this->HandleRepresentations = new vtkHandleRepresentation* [8];
for (int i=0; i<8; this->HandleRepresentations[i++] = NULL)
{
;
}
}
}
else
{
// Free the 8 handles if they haven't been freed.
if (this->HandleRepresentations)
{
for (int i=0; i<8; this->HandleRepresentations[i++]->Delete())
{
;
}
delete [] this->HandleRepresentations;
this->HandleRepresentations = NULL;
}
}
for (int i=0; i<8; i++)
{
// We will remove the old handle, in anticipation of the new user-
// provided handle type that we are going to set a few lines later.
if (this->HandleRepresentations && this->HandleRepresentations[i])
{
this->HandleRepresentations[i]->Delete();
this->HandleRepresentations[i] = NULL;
}
// Copy the new user-provided handle.
if (this->HandleRepresentation)
{
this->HandleRepresentations[i] = this->HandleRepresentation->NewInstance();
this->HandleRepresentations[i]->ShallowCopy(this->HandleRepresentation);
}
}
}
//----------------------------------------------------------------------
// Remove any existing chairs in the parallelopiped.
void vtkParallelopipedRepresentation::RemoveExistingChairs()
{
// If we have a chair. A chair has 9 faces as opposed to a parallelopiped
// which has 6 faces.
if (this->HexPolyData->GetPolys()->GetNumberOfCells() == 9)
{
// Go back to the topology of a parallelopiped.
vtkCellArray *parallelopipedcells = vtkCellArray::New();
this->Topology->PopulateTopology( 0, parallelopipedcells );
this->HexPolyData->SetPolys(parallelopipedcells);
this->HexPolyData->BuildCells();
parallelopipedcells->Delete();
// Bring the node that had the chair back to the 4th corner of the
// parallelopiped. We will use vector addition by finding the 4th point of
// a parallelogram from the other 3 points.
vtkIdType neighborPtIds[3], npts = 0, *cellPtIds = NULL;
this->Topology->GetNeighbors( this->ChairHandleIdx, neighborPtIds );
// First find 4 points that form a parallelogram and contain the chaired
// handle. The pointIds shall be stored in "nodes"
vtkParallelopipedTopology::CellType nodes(3);
nodes[0] = this->ChairHandleIdx;
nodes[1] = neighborPtIds[0];
nodes[2] = neighborPtIds[1];
vtkSmartPointer< vtkCellArray > cells = vtkSmartPointer<vtkCellArray>::New();
this->Topology->FindCellsContainingNodes( 0, cells, nodes );
cells->InitTraversal();
cells->GetNextCell(npts, cellPtIds);
// Find the 4th pointId.
int j = 0;
while (cellPtIds[j] == nodes[0]
|| cellPtIds[j] == nodes[1]
|| cellPtIds[j] == nodes[2]) ++j;
nodes.push_back(cellPtIds[j]);
// Now go about finding the 4th point (Index 0) in the parallelogram..
// 0 ------ 1
// | |
// 2 ------ 3
//
double p[4][3]; // for 4 points.. 3 we know, 4th to find..
this->Points->GetPoint( nodes[3], p[0] );
this->Points->GetPoint( nodes[1], p[1] );
this->Points->GetPoint( nodes[2], p[2] );
p[3][0] = p[1][0] + p[2][0] - p[0][0];
p[3][1] = p[1][1] + p[2][1] - p[0][1];
p[3][2] = p[1][2] + p[2][2] - p[0][2];
this->Points->SetPoint( nodes[0], p[3] );
this->ChairHandleIdx = -1;
}
}
//----------------------------------------------------------------------
// Node can be an integer within [0,7]. This will create a chair one one of
// the handle corners. The '0 < scale < 1' value dicates the starting
// depth of the cavity.
void vtkParallelopipedRepresentation::UpdateChairAtNode( int node )
{
vtkIdType npts = 0, *cellPtIds = NULL;
// If we have a chair somewhere else, remove it. We can have only one
// chair at a time.
if (this->CurrentHandleIdx != this->ChairHandleIdx &&
this->HexPolyData->GetPolys()->GetNumberOfCells() == 9)
{
this->RemoveExistingChairs();
}
this->ChairHandleIdx = node;
// If we already don't have a chair, create one. (a chair has 6 faces,
// unlike a parallelopiped).
if (this->HexPolyData->GetPolys()->GetNumberOfCells() != 9)
{
// chair has 14 points, but we will model this with 2 parallelopipeds.
// Hence 16 points. Look at vtkParallelopipedTopology for details.
// Scale points with respect to the node.
double origin[3], d[3];
this->Points->GetPoint( node, origin );
for (int i = 0; i < 8 ; i++)
{
this->Points->GetPoint(i, d);
d[0] = (d[0] - origin[0]) * this->InitialChairDepth + origin[0];
d[1] = (d[1] - origin[1]) * this->InitialChairDepth + origin[1];
d[2] = (d[2] - origin[2]) * this->InitialChairDepth + origin[2];
this->Points->SetPoint(i+8, d);
}
this->Points->SetPoint( node, this->Points->GetPoint(
vtkParallelopipedTopology::GetDiametricOppositeOfCorner(node) + 8));
vtkSmartPointer< vtkCellArray > cells = vtkSmartPointer<vtkCellArray>::New();
this->Topology->PopulateTopology( node + 1, cells );
this->HexPolyData->SetPolys(cells);
this->HexPolyData->BuildCells();
// Synchronize the handle representations with our recently updated
// "Points" data-structure.
this->PositionHandles();
}
else
{
// We do have a chair. Update the points in the chair by taking the
// projection of the chaired node onto the axes of the parallelopiped.
// These three PtIds are those that lie on the chair and are connected via
// a line to the "Chair node" in question. It is the position of these 3
// points that we seek to find in the next few lines.
vtkIdType neighborPtIds[3];
// This will contain the 3 faces that lie on the parallelopiped and have
// a chair carved out in them. As you know, we are about to compute the
// points at the carved out locations.
vtkSmartPointer< vtkCellArray > neighborCells = vtkSmartPointer<vtkCellArray>::New();
// Handle PointID is the diametric opposite of the chair corner on the
// higher order parallelopiped (the chair parallelopiped).
const vtkIdType chairHandleId = 8 + vtkParallelopipedTopology::
GetDiametricOppositeOfCorner(this->CurrentHandleIdx);
// Get the world position of the chair handle.
double chairPoint[3];
this->Points->GetPoint( chairHandleId, chairPoint );
vtkstd::vector< vtkParallelopipedTopology::LineType > lines;
this->Topology->GetNeighbors( node, neighborPtIds, neighborCells, lines );
neighborCells->InitTraversal();
for (int i = 0; i < 3; i++)
{
double lineEndPt[2][3];
this->Points->GetPoint( lines[i].Id[0], lineEndPt[0] );
this->Points->GetPoint( lines[i].Id[1], lineEndPt[1] );
double t, neighborPt[3]; // "x" is the point that we are trying to find.
neighborCells->GetNextCell(npts, cellPtIds);
vtkIdType planePtIds[3];
// For each point in the cell
for (int j = 0, idx = 0; j < npts && idx < 3; j++)
{
// Avoid the points that are on the chair as these are the ones we seek
// to find.
if ( cellPtIds[j] < 8 )
{
planePtIds[idx++] = cellPtIds[j];
}
}
// Construct a plane from the cell.
vtkPlane *plane = vtkPlane::New();
this->DefinePlane(plane, planePtIds[0], planePtIds[1], planePtIds[2]);
double endPoint[3] = { chairPoint[0] + lineEndPt[1][0] - lineEndPt[0][0],
chairPoint[1] + lineEndPt[1][1] - lineEndPt[0][1],
chairPoint[2] + lineEndPt[1][2] - lineEndPt[0][2] };
vtkPlane::IntersectWithLine( chairPoint, endPoint,
plane->GetNormal(), plane->GetOrigin(), t, neighborPt );
plane->Delete();
vtkDebugMacro( << "ChairPoint: (" << chairPoint[0] << "," << chairPoint[1]
<< "," << chairPoint[2] << ") lineEndPts [" << lines[i].Id[0] << "("
<< lineEndPt[0][0] << "," << lineEndPt[0][1] << "," << lineEndPt[0][2]
<< ")-" << lines[i].Id[1] << "(" << lineEndPt[1][0] << ","
<< lineEndPt[1][1] << "," << lineEndPt[1][2] << ")]"
<< " Intersection at: (" << neighborPt[0] << "," << neighborPt[1]
<< "," << neighborPt[2] << ")" );
this->Points->SetPoint( neighborPtIds[i], neighborPt );
}
// Now that we have found the 3 neighbors, we need to compute the other
// points in the chair. Note that we have 4 so far (3 neighbors + the
// chair node). There are 2 more to be found. Given that they will
// have to satisfy a parallelogram relationship, we can easily use
// vector addition to evaluate them.
for (int i = 0; i < 3; i++)
{
vtkstd::vector< vtkIdType > nodes(3);
vtkSmartPointer< vtkCellArray > cells
= vtkSmartPointer<vtkCellArray>::New();
nodes[0] = 8 + vtkParallelopipedTopology::
GetDiametricOppositeOfCorner(this->CurrentHandleIdx);
nodes[1] = neighborPtIds[i];
nodes[2] = neighborPtIds[(i+1)%3];
vtkDebugMacro( << "Looking for cells containing nodes: " << nodes[0]
<< "," << nodes[1] << "," << nodes[2] << " in topology "
<< (this->CurrentHandleIdx+1) );
this->Topology->FindCellsContainingNodes(
this->CurrentHandleIdx + 1, cells, nodes );
npts = 0; cellPtIds = NULL;
cells->InitTraversal();
cells->GetNextCell(npts, cellPtIds);
// Find the 4th pointId. The pointIds shall be stored in "nodes"
int j = 0;
while (cellPtIds[j] == nodes[0]
|| cellPtIds[j] == nodes[1]
|| cellPtIds[j] == nodes[2]) ++j;
nodes.push_back(cellPtIds[j]);
// Now go about finding the 4th point (Index 3) in the parallelogram..
// 0 ------ 1
// | |
// 2 ------ 3
//
double p[4][3]; // for 4 points.. 3 we know, 4th to find..
this->Points->GetPoint( nodes[0], p[0] );
this->Points->GetPoint( nodes[1], p[1] );
this->Points->GetPoint( nodes[2], p[2] );
p[3][0] = p[1][0] + p[2][0] - p[0][0];
p[3][1] = p[1][1] + p[2][1] - p[0][1];
p[3][2] = p[1][2] + p[2][2] - p[0][2];
vtkDebugMacro( << "Parallelogram built from (nodes and points): \n"
<< "(" << nodes[0] << ") = [" << p[0][0] << "," << p[0][1] << "," << p[0][2] << "]\n"
<< "(" << nodes[1] << ") = [" << p[1][0] << "," << p[1][1] << "," << p[1][2] << "]\n"
<< "(" << nodes[2] << ") = [" << p[2][0] << "," << p[2][1] << "," << p[2][2] << "]\n"
<< "(" << cellPtIds[j] << ") = [" << p[3][0] << "," << p[3][1] << "," << p[3][2] << "]\n");
this->Points->SetPoint( nodes[3], p[3] );
}
this->Points->SetPoint( 8 + vtkParallelopipedTopology::
GetDiametricOppositeOfCorner(this->CurrentHandleIdx),
this->Points->GetPoint(this->CurrentHandleIdx));
}
}
//----------------------------------------------------------------------
// This is where the bulk of the work is done.
int vtkParallelopipedRepresentation
::ComputeInteractionState(int X, int Y, int vtkNotUsed(modify))
{
int oldInteractionState = this->InteractionState;
// (A) -----------------------------------------------------------
// Handle the request methods. These are mere requests and will not cause
// any change in the position of the handles or the shape of the
// parallelopiped. The representation will, within this IF block change its
// state from a request to a concrete state.
if ( this->InteractionState == vtkParallelopipedRepresentation::RequestResizeParallelopiped
|| this->InteractionState == vtkParallelopipedRepresentation::RequestResizeParallelopipedAlongAnAxis
|| this->InteractionState == vtkParallelopipedRepresentation::RequestChairMode )
{
this->CurrentHandleIdx = -1;
// We are trying to perform user interaction that might potentially
// select a handle. Check if we are really near a handle, so it
// can be selected.
// Loop over all the handles and check if one of them is selected
for(int i = 0; i< 8; i++)
{
this->HandleRepresentations[i]->ComputeInteractionState(X, Y, 0);
if (this->HandleRepresentations[i]->GetInteractionState() ==
vtkHandleRepresentation::Selecting)
{
// The selected handle.
this->CurrentHandleIdx = i;
// The shift modifier determines if the handles are going to be
// translated along an axes of the parallelopiped.
switch (this->InteractionState)
{
case vtkParallelopipedRepresentation::RequestResizeParallelopiped:
this->InteractionState = (this->CurrentHandleIdx == this->ChairHandleIdx)
? ChairMode : ResizingParallelopiped;
break;
case vtkParallelopipedRepresentation::RequestResizeParallelopipedAlongAnAxis:
this->InteractionState = (this->CurrentHandleIdx == this->ChairHandleIdx)
? ChairMode : ResizingParallelopipedAlongAnAxis;
break;
case vtkParallelopipedRepresentation::RequestChairMode:
{
// Toggle chair mode if we already have a chair here.. We are
// trying to toggle of course.. In this case remove all chairs,
if (this->CurrentHandleIdx == this->ChairHandleIdx &&
this->HexPolyData->GetPolys()->GetNumberOfCells() == 9)
{
this->RemoveExistingChairs();
this->LastEventPosition[0] = X;
this->LastEventPosition[1] = Y;
this->InteractionState = vtkParallelopipedRepresentation::Inside;
// Synchronize the handle representations with our recently updated
// "Points" data-structure.
this->PositionHandles();
return this->InteractionState;
}
// We aren't trying to toggle. Create one
// Create a chair with a default cavity depth of 0.1
this->UpdateChairAtNode( this->CurrentHandleIdx );
// We are in chair mode. Use the placer to dictate where the
// "chaired" handle can move. (It can only move within the
// parallelopiped). First set some parameters on the placer.
vtkPlaneCollection *pc = vtkPlaneCollection::New();
this->GetParallelopipedBoundingPlanes( pc );
this->ChairPointPlacer->SetBoundingPlanes( pc );
pc->Delete();
this->InteractionState = ChairMode;
break;
}
}
// Highlight the selected handle and unhighlight all others.
this->SetHandleHighlight(-1, this->HandleProperty);
this->SetHandleHighlight(
this->CurrentHandleIdx, this->SelectedHandleProperty);
break;
}
}
if (this->CurrentHandleIdx == -1)
{
// We are near none of the handles.
// Now check if we are within the parallelopiped or outside the
// parallelopiped. We will use the pointplacer to evaluate this.
vtkPlaneCollection *pc = vtkPlaneCollection::New();
this->GetParallelopipedBoundingPlanes( pc );
this->ChairPointPlacer->SetBoundingPlanes( pc );
pc->Delete();
// Use any random handle as a reference for the point placer.
double eventDisplayPos[3] = {X, Y,0.0}, dummy[4],
worldOrient[9], handleWorldPos[4];
this->HandleRepresentations[0]->GetWorldPosition(handleWorldPos);
this->InteractionState = (this->ChairPointPlacer->ComputeWorldPosition(
this->Renderer, eventDisplayPos, handleWorldPos, dummy, worldOrient )
? vtkParallelopipedRepresentation::Inside
: vtkParallelopipedRepresentation::Outside);
}
if (this->InteractionState == vtkParallelopipedRepresentation::Inside &&
oldInteractionState == vtkParallelopipedRepresentation::
RequestResizeParallelopipedAlongAnAxis)
{
this->HighlightAllFaces();
}
else
{
// UnHighlight all faces
this->UnHighlightAllFaces();
}
// Reset any cached "resize along that axis" stuff.
this->LastResizeAxisIdx = -1;
}
// (B) -----------------------------------------------------------
// Handle the resizing operations (along the axis or arbitrarily).
else if (this->InteractionState ==
vtkParallelopipedRepresentation::ResizingParallelopipedAlongAnAxis ||
this->InteractionState ==
vtkParallelopipedRepresentation::ResizingParallelopiped)
{
// Ensure that a handle has been picked.
if (this->CurrentHandleIdx != -1)
{
// Compute world positions corresponding to the current event position
// (X,Y) and the last event positions such that they lie at the same
// depth that the handle lies on.
double axis[3][3], eventWorldPos[4], handleWorldPos[4],
handleDisplayPos[4], neighborWorldPos[3][4], neighborDisplayPos[3][4];
this->HandleRepresentations[this->CurrentHandleIdx]
->GetWorldPosition(handleWorldPos);
vtkInteractorObserver::ComputeWorldToDisplay( this->Renderer,
handleWorldPos[0], handleWorldPos[1], handleWorldPos[2],
handleDisplayPos);
// Now find and get the display positions of the three neighbors of the
// current handle. We have to rescale along one of the three edges.
vtkIdType neighborIndices[3];
this->Topology->GetNeighbors( this->CurrentHandleIdx, neighborIndices,
(this->ChairHandleIdx == -1) ? 0 : this->ChairHandleIdx + 1 );
// The motion vector in display coords
const double motionVector[3] = { X - this->LastEventPosition[0],
Y - this->LastEventPosition[1],
0.0 };
double maxConfidence = VTK_DOUBLE_MIN;
// The next few lines attempt to find the axis should we scale along.
// The axis is the axis of the parallelopiped that is most aligned with
// the direction of mouse motion.
int axisIdx = this->LastResizeAxisIdx; // To be found out ..
// loop over the 3 neighbors of the current handle
for (int i = 0; i < 3; i++)
{
// Compute display position of this neighbor
this->Points->GetPoint(neighborIndices[i], neighborWorldPos[i]);
vtkInteractorObserver::ComputeWorldToDisplay( this->Renderer,
neighborWorldPos[i][0], neighborWorldPos[i][1],
neighborWorldPos[i][2], neighborDisplayPos[i]);
// Dot product of the motion vector (in display coords) with each
// of the three edges (in display coords). The maximum of the three
// will determine which axis of the parallelopiped we will rescale along
axis[i][0] = neighborDisplayPos[i][0] - handleDisplayPos[0];
axis[i][1] = neighborDisplayPos[i][1] - handleDisplayPos[1],
axis[i][2] = 0.0;
vtkMath::Normalize2D(axis[i]);
// If we did not compute the resize axis Idx already the last time,
// we were in this method, compute it now, by checking which axis
// the motion vector is most aligned with.
if (this->LastResizeAxisIdx == -1 ||
this->InteractionState ==
vtkParallelopipedRepresentation::ResizingParallelopiped)
{
const double confidence
= fabs(vtkMath::Dot2D( axis[i], motionVector ));
if (confidence > maxConfidence)
{
axisIdx = i;
maxConfidence = confidence;
}
}
}
// Now that we know the axis to translate along, find the amount we should
// translate by. The new handle position must lie somewhere along the
// line joining the currently selected handle and the neighbor that lies
// along the rescale axis. We will evaluate 't E [-inf, 1.0]', the
// parametric position along the line. This point will simply be the
// point on the aforementioned line that the current event position is
// closest to.
double directionOfProjection[3], closestPt1[3], closestPt2[3], t1, t;
this->Renderer->GetActiveCamera()->
GetDirectionOfProjection(directionOfProjection);
vtkInteractorObserver::ComputeDisplayToWorld( this->Renderer,
X, Y, handleDisplayPos[2], eventWorldPos);
double l0[3] = {eventWorldPos[0] - directionOfProjection[0],
eventWorldPos[1] - directionOfProjection[1],
eventWorldPos[2] - directionOfProjection[2] };
double l1[3] = {eventWorldPos[0] + directionOfProjection[0],
eventWorldPos[1] + directionOfProjection[1],
eventWorldPos[2] + directionOfProjection[2] };
vtkLine::DistanceBetweenLines( handleWorldPos, neighborWorldPos[axisIdx],
l0, l1,
closestPt1, closestPt2,
t, t1 );
t = (t > 1.0 ? 1.0 : t); // clamp 't'
vtkDebugMacro( << "Currently selected handle is at : (" <<
handleWorldPos[0] << "," << handleWorldPos[1] << "," << handleWorldPos[2] <<
")\n Pt2 (the selected handle will be moved along the axis represented by"
<< " itself and Pt2) is at: (" << neighborWorldPos[axisIdx][0]
<< "," << neighborWorldPos[axisIdx][1] << "," << neighborWorldPos[axisIdx][2]
<< ")\n The selected handle will be moved to parametric location t = " << t
<< "with the line being specified by the above 2 points.");
// This is the amount by which the face will move towards
// (or away from if t < 0.0) the other face. We know that the face has
// the following PointIds.
// 1) CurrentHandleIdx
// 2) Neighbor 1 of currentHandleIdx
// 3) Neighbor 2 of CurrentHandleIdx
// It will be our job in the next few lines to find the other points in