Mercurial > hg > orthanc-stone
view Framework/Toolbox/DicomStructureSetUtils.h @ 998:38b6bb0bdd72
added a new set of classes that correctly handle non-convex polygons (not
used yet because of limitations in coordinates computing): DicomStructure2,
DicomStructureSet2, DicomStructurePolygon2, DicomStructureSetSlicer2. Too
many shortcuts have been taken when computing the actual position.
author | Benjamin Golinvaux <bgo@osimis.io> |
---|---|
date | Fri, 20 Sep 2019 11:58:00 +0200 |
parents | |
children | 2d8ab34c8c91 |
line wrap: on
line source
/** * Stone of Orthanc * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics * Department, University Hospital of Liege, Belgium * Copyright (C) 2017-2019 Osimis S.A., Belgium * * This program is free software: you can redistribute it and/or * modify it under the terms of the GNU Affero General Public License * as published by the Free Software Foundation, either version 3 of * the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Affero General Public License for more details. * * You should have received a copy of the GNU Affero General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. **/ #pragma once #include <vector> #include <utility> #include "../Toolbox/LinearAlgebra.h" namespace OrthancStone { #if 0 struct Point3D { Point3D(double x, double y, double z) : x(x), y(y), z(z) {} Point3D() : x(0), y(0), z(0) {} double x, y, z; }; struct Vector3D { Vector3D(double x, double y, double z) : x(x), y(y), z(z) {} Vector3D() : x(0), y(0), z(0) {} double x, y, z; }; #else typedef Vector Vector3D; typedef Vector Point3D; #endif struct Point2D { Point2D(double x, double y) : x(x), y(y) {} Point2D() : x(0), y(0) {} double x, y; }; /** Internal */ struct RtStructRectangleInSlab { double xmin, xmax, ymin, ymax; }; typedef std::vector<RtStructRectangleInSlab> RtStructRectanglesInSlab; enum RectangleBoundaryKind { RectangleBoundaryKind_Start, RectangleBoundaryKind_End }; #if 0 /** Internal */ void PartitionRectangleList(std::vector< std::vector<size_t> > & sets, const std::vector<RtStructRectanglesInSlab>); #endif /** Internal */ void ConvertListOfSlabsToSegments(std::vector< std::pair<Point2D, Point2D> >& segments, const std::vector<RtStructRectanglesInSlab>& slabCuts, const size_t totalRectCount); /** Internal */ void AddSlabBoundaries(std::vector<std::pair<double, RectangleBoundaryKind> >& boundaries, const std::vector<RtStructRectanglesInSlab>& slabCuts, size_t iSlab); /** Internal */ void ProcessBoundaryList(std::vector< std::pair<Point2D, Point2D> >& segments, const std::vector<std::pair<double, RectangleBoundaryKind> >& boundaries, double y); }