|
LSSTApplications
19.0.0-14-gb0260a2+72efe9b372,20.0.0+7927753e06,20.0.0+8829bf0056,20.0.0+995114c5d2,20.0.0+b6f4b2abd1,20.0.0+bddc4f4cbe,20.0.0-1-g253301a+8829bf0056,20.0.0-1-g2b7511a+0d71a2d77f,20.0.0-1-g5b95a8c+7461dd0434,20.0.0-12-g321c96ea+23efe4bbff,20.0.0-16-gfab17e72e+fdf35455f6,20.0.0-2-g0070d88+ba3ffc8f0b,20.0.0-2-g4dae9ad+ee58a624b3,20.0.0-2-g61b8584+5d3db074ba,20.0.0-2-gb780d76+d529cf1a41,20.0.0-2-ged6426c+226a441f5f,20.0.0-2-gf072044+8829bf0056,20.0.0-2-gf1f7952+ee58a624b3,20.0.0-20-geae50cf+e37fec0aee,20.0.0-25-g3dcad98+544a109665,20.0.0-25-g5eafb0f+ee58a624b3,20.0.0-27-g64178ef+f1f297b00a,20.0.0-3-g4cc78c6+e0676b0dc8,20.0.0-3-g8f21e14+4fd2c12c9a,20.0.0-3-gbd60e8c+187b78b4b8,20.0.0-3-gbecbe05+48431fa087,20.0.0-38-ge4adf513+a12e1f8e37,20.0.0-4-g97dc21a+544a109665,20.0.0-4-gb4befbc+087873070b,20.0.0-4-gf910f65+5d3db074ba,20.0.0-5-gdfe0fee+199202a608,20.0.0-5-gfbfe500+d529cf1a41,20.0.0-6-g64f541c+d529cf1a41,20.0.0-6-g9a5b7a1+a1cd37312e,20.0.0-68-ga3f3dda+5fca18c6a4,20.0.0-9-g4aef684+e18322736b,w.2020.45
LSSTDataManagementBasePackage
|
This file contains the meat of the ConvexPolygon implementation. More...
#include "lsst/sphgeom/Box.h"#include "lsst/sphgeom/Box3d.h"#include "lsst/sphgeom/Circle.h"#include "lsst/sphgeom/Ellipse.h"#include "lsst/sphgeom/orientation.h"#include "lsst/sphgeom/utils.h"Go to the source code of this file.
Namespaces | |
| lsst | |
| A base class for image defects. | |
| lsst::sphgeom | |
| lsst::sphgeom::detail | |
Functions | |
| template<typename VertexIterator > | |
| UnitVector3d | lsst::sphgeom::detail::centroid (VertexIterator const begin, VertexIterator const end) |
| template<typename VertexIterator > | |
| Circle | lsst::sphgeom::detail::boundingCircle (VertexIterator const begin, VertexIterator const end) |
| template<typename VertexIterator > | |
| Box | lsst::sphgeom::detail::boundingBox (VertexIterator const begin, VertexIterator const end) |
| template<typename VertexIterator > | |
| Box3d | lsst::sphgeom::detail::boundingBox3d (VertexIterator const begin, VertexIterator const end) |
| template<typename VertexIterator > | |
| bool | lsst::sphgeom::detail::contains (VertexIterator const begin, VertexIterator const end, UnitVector3d const &v) |
| template<typename VertexIterator > | |
| Relationship | lsst::sphgeom::detail::relate (VertexIterator const begin, VertexIterator const end, Box const &b) |
| template<typename VertexIterator > | |
| Relationship | lsst::sphgeom::detail::relate (VertexIterator const begin, VertexIterator const end, Circle const &c) |
| template<typename VertexIterator1 , typename VertexIterator2 > | |
| Relationship | lsst::sphgeom::detail::relate (VertexIterator1 const begin1, VertexIterator1 const end1, VertexIterator2 const begin2, VertexIterator2 const end2) |
| template<typename VertexIterator > | |
| Relationship | lsst::sphgeom::detail::relate (VertexIterator const begin, VertexIterator const end, ConvexPolygon const &p) |
| template<typename VertexIterator > | |
| Relationship | lsst::sphgeom::detail::relate (VertexIterator const begin, VertexIterator const end, Ellipse const &e) |
This file contains the meat of the ConvexPolygon implementation.
These functions are parametrized by vertex iterator type, making it possible to call them given only a fixed size vertex array. The functions which compute indexes of HTM triangles and Q3C quads intersecting a spherical region use them to avoid the cost of creating ConvexPolygon objects for each triangle/quad.
Definition in file ConvexPolygonImpl.h.
1.8.18