/*========================================================================= * * Copyright NumFOCUS * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * https://www.apache.org/licenses/LICENSE-2.0.txt * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * *=========================================================================*/ /*========================================================================= * * Portions of this file are subject to the VTK Toolkit Version 3 copyright. * * Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen * * For complete copyright, license and disclaimer of warranty information * please refer to the NOTICE file at the top of the ITK source tree. * *=========================================================================*/ #ifndef itkPolygonCell_hxx #define itkPolygonCell_hxx #include // For copy_n. namespace itk { /** * Standard CellInterface: */ template void PolygonCell::MakeCopy(CellAutoPointer & cellPointer) const { auto * newPolygonCell = new Self; cellPointer.TakeOwnership(newPolygonCell); const PointIdentifier numberOfPoints = this->GetNumberOfPoints(); if (numberOfPoints) { newPolygonCell->SetPointIds(0, numberOfPoints, this->GetPointIds()); } else { newPolygonCell->ClearPoints(); // Make sure the new cell has no points or edges } } /** * Standard CellInterface: * Get the topological dimension of this cell. */ template unsigned int PolygonCell::GetDimension() const { return Self::CellDimension; } /** * Standard CellInterface: * Get the number of points required to define the cell. */ template unsigned int PolygonCell::GetNumberOfPoints() const { return static_cast(m_PointIds.size()); } /** * Standard CellInterface: * Get the number of boundary features of the given dimension. */ template auto PolygonCell::GetNumberOfBoundaryFeatures(int dimension) const -> CellFeatureCount { switch (dimension) { case 0: return this->GetNumberOfVertices(); case 1: return this->GetNumberOfEdges(); default: return 0; } } /** * Standard CellInterface: * Get the boundary feature of the given dimension specified by the given * cell feature Id. * The Id can range from 0 to GetNumberOfBoundaryFeatures(dimension)-1. */ template bool PolygonCell::GetBoundaryFeature(int dimension, CellFeatureIdentifier featureId, CellAutoPointer & cellPointer) { switch (dimension) { case 0: { VertexAutoPointer vertexPointer; if (this->GetVertex(featureId, vertexPointer)) { TransferAutoPointer(cellPointer, vertexPointer); return true; } break; } case 1: { EdgeAutoPointer edgePointer; if (this->GetEdge(featureId, edgePointer)) { TransferAutoPointer(cellPointer, edgePointer); return true; } break; } default: break; // just fall through } cellPointer.Reset(); return false; } /** * Standard CellInterface: * Set the point id list used by the cell. It is assumed that the given * iterator can be incremented and safely de-referenced enough times to * get all the point ids needed by the cell. */ template void PolygonCell::SetPointIds(int itkNotUsed(dummy), int num, PointIdConstIterator first) { PointIdConstIterator ii(first); m_PointIds.clear(); for (int i = 0; i < num; ++i) { m_PointIds.push_back(*ii++); } this->BuildEdges(); } /** * after input the points in order, generate the edge connections */ template void PolygonCell::BuildEdges() { if (!m_PointIds.empty()) { m_Edges.resize(m_PointIds.size()); const auto numberOfPoints = static_cast(m_PointIds.size()); for (unsigned int i = 1; i < numberOfPoints; ++i) { m_Edges[i - 1][0] = i - 1; m_Edges[i - 1][1] = i; } m_Edges[numberOfPoints - 1][0] = numberOfPoints - 1; m_Edges[numberOfPoints - 1][1] = 0; } else { m_Edges.clear(); } } /** * Standard CellInterface: * Set the point id list used by the cell. It is assumed that the given * iterator can be incremented and safely de-referenced enough times to * get all the point ids needed by the cell. */ template void PolygonCell::SetPointIds(PointIdConstIterator first) { std::copy_n(first, m_PointIds.size(), m_PointIds.begin()); } /** * Add one points to the points list */ template void PolygonCell::AddPointId(PointIdentifier ptID) { m_PointIds.push_back(ptID); } /** * Remove one points from the points list */ template void PolygonCell::RemovePointId(PointIdentifier ptID) { auto position = std::find(m_PointIds.begin(), m_PointIds.end(), ptID); if (position != m_PointIds.end()) { m_PointIds.erase(position); } } /** * clear all the point and edge information */ template void PolygonCell::ClearPoints() { m_PointIds.clear(); m_Edges.clear(); } /** * Standard CellInterface: * Set the point id list used by the cell. It is assumed that the range * of iterators [first, last) contains the correct number of points needed to * define the cell. The position *last is NOT referenced, so it can safely * be one beyond the end of an array or other container. */ template void PolygonCell::SetPointIds(PointIdConstIterator first, PointIdConstIterator last) { PointIdConstIterator ii(first); m_PointIds.clear(); while (ii != last) { m_PointIds.push_back(*ii++); } this->BuildEdges(); } /** * Standard CellInterface: * Set an individual point identifier in the cell. */ template void PolygonCell::SetPointId(int localId, PointIdentifier ptId) { if (m_PointIds.size() < static_cast(localId + 1)) { m_PointIds.resize(localId + 1); } m_PointIds[localId] = ptId; } /** * Standard CellInterface: * Get a begin iterator to the list of point identifiers used by the cell. */ template auto PolygonCell::PointIdsBegin() -> PointIdIterator { if (!m_PointIds.empty()) { return &m_PointIds.front(); } else { return nullptr; } } /** * Standard CellInterface: * Get a const begin iterator to the list of point identifiers used * by the cell. */ template auto PolygonCell::PointIdsBegin() const -> PointIdConstIterator { if (!m_PointIds.empty()) { return &m_PointIds.front(); } else { return nullptr; } } /** * Standard CellInterface: * Get an end iterator to the list of point identifiers used by the cell. */ template auto PolygonCell::PointIdsEnd() -> PointIdIterator { if (!m_PointIds.empty()) { return &m_PointIds.back() + 1; } else { return nullptr; } } /** * Standard CellInterface: * Get a const end iterator to the list of point identifiers used * by the cell. */ template auto PolygonCell::PointIdsEnd() const -> PointIdConstIterator { if (!m_PointIds.empty()) { return &m_PointIds.back() + 1; } else { return nullptr; } } /** * Polygon-specific: * Get the number of vertices defining the Polygon. */ template auto PolygonCell::GetNumberOfVertices() const -> CellFeatureCount { return static_cast(m_PointIds.size()); } /** * Polygon-specific: * Get the number of edges defined for the Polygon. */ template auto PolygonCell::GetNumberOfEdges() const -> CellFeatureCount { return static_cast(m_Edges.size()); } /** * Polygon-specific: * Get the vertex specified by the given cell feature Id. * The Id can range from 0 to GetNumberOfVertices()-1. */ template bool PolygonCell::GetVertex(CellFeatureIdentifier vertexId, VertexAutoPointer & vertexPointer) { auto * vert = new VertexType; vert->SetPointId(0, m_PointIds[vertexId]); vertexPointer.TakeOwnership(vert); return true; } /** * Polygon-specific: * Get the edge specified by the given cell feature Id. * The Id can range from 0 to GetNumberOfEdges()-1. */ template bool PolygonCell::GetEdge(CellFeatureIdentifier edgeId, EdgeAutoPointer & edgePointer) { auto * edge = new EdgeType; unsigned int max_pointId = this->GetNumberOfPoints() - 1; if (edgeId < max_pointId) { edge->SetPointId(0, m_PointIds[edgeId]); edge->SetPointId(1, m_PointIds[edgeId + 1]); } else if (edgeId == max_pointId) { edge->SetPointId(0, m_PointIds[max_pointId]); edge->SetPointId(1, m_PointIds[0]); } edgePointer.TakeOwnership(edge); return true; } } // end namespace itk #endif