-
Notifications
You must be signed in to change notification settings - Fork 177
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
VerticesHelper: move non-template code to cpp
- Loading branch information
Showing
3 changed files
with
135 additions
and
116 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -22,4 +22,5 @@ target_sources_local( | |
| SurfaceArray.cpp | ||
| TrapezoidBounds.cpp | ||
| detail/AlignmentHelper.cpp | ||
| VerticesHelper.cpp | ||
| ) | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,115 @@ | ||
| // This file is part of the Acts project. | ||
| // | ||
| // Copyright (C) 2020 CERN for the benefit of the Acts project | ||
| // | ||
| // This Source Code Form is subject to the terms of the Mozilla Public | ||
| // License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| // file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
|
|
||
| #include "Acts/Surfaces/detail/VerticesHelper.hpp" | ||
|
|
||
| std::vector<double> Acts::detail::VerticesHelper::phiSegments( | ||
| double phiMin, double phiMax, const std::vector<double>& phiRefs, | ||
| double phiTolerance) { | ||
| // This is to ensure that the extrema are built regardless of number | ||
| // of segments | ||
| std::vector<double> phiSegments; | ||
| std::vector<double> quarters = {-M_PI, -0.5 * M_PI, 0., 0.5 * M_PI, M_PI}; | ||
| // It does not cover the full azimuth | ||
| if (phiMin != -M_PI or phiMax != M_PI) { | ||
| phiSegments.push_back(phiMin); | ||
| for (unsigned int iq = 1; iq < 4; ++iq) { | ||
| if (phiMin < quarters[iq] and phiMax > quarters[iq]) { | ||
| phiSegments.push_back(quarters[iq]); | ||
| } | ||
| } | ||
| phiSegments.push_back(phiMax); | ||
| } else { | ||
| phiSegments = quarters; | ||
| } | ||
| // Insert the reference phis if | ||
| if (not phiRefs.empty()) { | ||
| for (const auto& phiRef : phiRefs) { | ||
| // Trying to find the right patch | ||
| auto match = std::find_if( | ||
| phiSegments.begin(), phiSegments.end(), [&](double phiSeg) { | ||
| return std::abs(phiSeg - phiRef) < phiTolerance; | ||
| }); | ||
| if (match == phiSegments.end()) { | ||
| phiSegments.push_back(phiRef); | ||
| } | ||
| } | ||
| std::sort(phiSegments.begin(), phiSegments.end()); | ||
| } | ||
| return phiSegments; | ||
| } | ||
|
|
||
| std::vector<Acts::Vector2D> Acts::detail::VerticesHelper::ellispoidVertices( | ||
| double innerRx, double innerRy, double outerRx, double outerRy, | ||
| double avgPhi, double halfPhi, unsigned int lseg) { | ||
| // List of vertices counter-clockwise starting at smallest phi w.r.t center, | ||
| // for both inner/outer ring/segment | ||
| std::vector<Vector2D> rvertices; // return vertices | ||
| std::vector<Vector2D> ivertices; // inner vertices | ||
| std::vector<Vector2D> overtices; // outer verices | ||
|
|
||
| bool innerExists = (innerRx > 0. and innerRy > 0.); | ||
| bool closed = std::abs(halfPhi - M_PI) < s_onSurfaceTolerance; | ||
|
|
||
| // Get the phi segments from the helper method | ||
| auto phiSegs = detail::VerticesHelper::phiSegments( | ||
| avgPhi - halfPhi, avgPhi + halfPhi, {avgPhi}); | ||
|
|
||
| // The inner (if exists) and outer bow | ||
| for (unsigned int iseg = 0; iseg < phiSegs.size() - 1; ++iseg) { | ||
| int addon = (iseg == phiSegs.size() - 2 and not closed) ? 1 : 0; | ||
| if (innerExists) { | ||
| createSegment(ivertices, {innerRx, innerRy}, phiSegs[iseg], | ||
| phiSegs[iseg + 1], lseg, addon, Vector2D::Zero(), | ||
| Transform2D::Identity()); | ||
| } | ||
| createSegment(overtices, {outerRx, outerRy}, phiSegs[iseg], | ||
| phiSegs[iseg + 1], lseg, addon, Vector2D::Zero(), | ||
| Transform2D::Identity()); | ||
| } | ||
|
|
||
| // We want to keep the same counter-clockwise orientation for displaying | ||
| if (not innerExists) { | ||
| if (not closed) { | ||
| // Add the center case we have a sector | ||
| rvertices.push_back(Vector2D(0., 0.)); | ||
| } | ||
| rvertices.insert(rvertices.end(), overtices.begin(), overtices.end()); | ||
| } else if (not closed) { | ||
| rvertices.insert(rvertices.end(), overtices.begin(), overtices.end()); | ||
| rvertices.insert(rvertices.end(), ivertices.rbegin(), ivertices.rend()); | ||
| } else { | ||
| rvertices.insert(rvertices.end(), overtices.begin(), overtices.end()); | ||
| rvertices.insert(rvertices.end(), ivertices.begin(), ivertices.end()); | ||
| } | ||
| return rvertices; | ||
| } | ||
|
|
||
| std::vector<Acts::Vector2D> Acts::detail::VerticesHelper::circularVertices( | ||
| double innerR, double outerR, double avgPhi, double halfPhi, | ||
| unsigned int lseg) { | ||
| return ellispoidVertices(innerR, innerR, outerR, outerR, avgPhi, halfPhi, | ||
| lseg); | ||
| } | ||
|
|
||
| bool Acts::detail::VerticesHelper::onHyperPlane( | ||
| const std::vector<Acts::Vector3D>& vertices, double tolerance) { | ||
| // Obvious always on one surface | ||
| if (vertices.size() < 4) { | ||
| return true; | ||
| } | ||
| // Create the hyperplane | ||
| auto hyperPlane = Eigen::Hyperplane<double, 3>::Through( | ||
| vertices[0], vertices[1], vertices[2]); | ||
| for (size_t ip = 3; ip < vertices.size(); ++ip) { | ||
| if (hyperPlane.absDistance(vertices[ip]) > tolerance) { | ||
| return false; | ||
| } | ||
| } | ||
| return true; | ||
| } |