|
LSST Applications
21.0.0-172-gfb10e10a+18fedfabac,22.0.0+297cba6710,22.0.0+80564b0ff1,22.0.0+8d77f4f51a,22.0.0+a28f4c53b1,22.0.0+dcf3732eb2,22.0.1-1-g7d6de66+2a20fdde0d,22.0.1-1-g8e32f31+297cba6710,22.0.1-1-geca5380+7fa3b7d9b6,22.0.1-12-g44dc1dc+2a20fdde0d,22.0.1-15-g6a90155+515f58c32b,22.0.1-16-g9282f48+790f5f2caa,22.0.1-2-g92698f7+dcf3732eb2,22.0.1-2-ga9b0f51+7fa3b7d9b6,22.0.1-2-gd1925c9+bf4f0e694f,22.0.1-24-g1ad7a390+a9625a72a8,22.0.1-25-g5bf6245+3ad8ecd50b,22.0.1-25-gb120d7b+8b5510f75f,22.0.1-27-g97737f7+2a20fdde0d,22.0.1-32-gf62ce7b1+aa4237961e,22.0.1-4-g0b3f228+2a20fdde0d,22.0.1-4-g243d05b+871c1b8305,22.0.1-4-g3a563be+32dcf1063f,22.0.1-4-g44f2e3d+9e4ab0f4fa,22.0.1-42-gca6935d93+ba5e5ca3eb,22.0.1-5-g15c806e+85460ae5f3,22.0.1-5-g58711c4+611d128589,22.0.1-5-g75bb458+99c117b92f,22.0.1-6-g1c63a23+7fa3b7d9b6,22.0.1-6-g50866e6+84ff5a128b,22.0.1-6-g8d3140d+720564cf76,22.0.1-6-gd805d02+cc5644f571,22.0.1-8-ge5750ce+85460ae5f3,master-g6e05de7fdc+babf819c66,master-g99da0e417a+8d77f4f51a,w.2021.48
LSST Data Management Base Package
|
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.9.1