/usr/include/InsightToolkit/Review/itkQuadEdgeMeshBoundaryEdgesMeshFunction.txx is in libinsighttoolkit3-dev 3.20.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkQuadEdgeMeshBoundaryEdgesMeshFunction.txx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/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 notices for more information.
=========================================================================*/
#ifndef __itkQuadEdgeMeshBoundaryEdgesMeshFunction_txx
#define __itkQuadEdgeMeshBoundaryEdgesMeshFunction_txx
#include "itkQuadEdgeMeshBoundaryEdgesMeshFunction.h"
#include "itkQuadEdgeMesh.h" // Just to mark the dependance towards this class.
namespace itk
{
template< typename TMesh >
typename QuadEdgeMeshBoundaryEdgesMeshFunction< TMesh >::OutputType
QuadEdgeMeshBoundaryEdgesMeshFunction< TMesh >::
Evaluate( const InputType& mesh )
const
{
// Push on a list all the non internal edges:
typedef typename MeshType::CellsContainerConstIterator
CellsContainerConstIterator;
EdgeListType boundaryList;
CellsContainerConstIterator cellIterator = mesh.GetEdgeCells()->Begin();
CellsContainerConstIterator cellEnd = mesh.GetEdgeCells()->End();
for(; cellIterator != cellEnd; ++cellIterator )
{
if( EdgeCellType* cell =
dynamic_cast< EdgeCellType* >( cellIterator.Value( ) ) )
{
QEPrimal* edge = cell->GetQEGeom( );
if( !edge->IsInternal( ) )
{
boundaryList.push_front( edge );
}
}
}
OutputType ResultList = new EdgeListType;
while( ! boundaryList.empty( ) )
{
// Pop the first edge of list and make sure it has no face
// on it's left [because we want to follow the boundary with
// GeometricalQuadEdge::Lnext()]:
QEPrimal* bdryEdge = boundaryList.front( );
boundaryList.pop_front( );
if( bdryEdge->IsLeftSet( ) )
{
bdryEdge = bdryEdge->GetSym( );
}
if( bdryEdge->IsLeftSet( ) )
{
itkWarningMacro( "Entry edge has not face adjacency." );
delete ResultList;
return( (OutputType)0 );
}
// Store this edge as representative of it's Lnext() ring i.e.
// representative of the boundary:
ResultList->push_back( bdryEdge );
// Follow, with Lnext(), the boundary while removing edges
// from boundary list:
typename QEPrimal::IteratorGeom it = bdryEdge->BeginGeomLnext( );
for(; it != bdryEdge->EndGeomLnext( ); it++ )
{
// Only one of the following will be effective (but we have
// no way to know which one):
boundaryList.remove( it.Value( ) );
boundaryList.remove( it.Value( )->GetSym( ) );
}
}
return ResultList;
}
}
#endif
|