LSSTApplications
17.0+124,17.0+14,17.0+73,18.0.0+37,18.0.0+80,18.0.0-4-g68ffd23+4,18.1.0-1-g0001055+12,18.1.0-1-g03d53ef+5,18.1.0-1-g1349e88+55,18.1.0-1-g2505f39+44,18.1.0-1-g5315e5e+4,18.1.0-1-g5e4b7ea+14,18.1.0-1-g7e8fceb+4,18.1.0-1-g85f8cd4+48,18.1.0-1-g8ff0b9f+4,18.1.0-1-ga2c679d+1,18.1.0-1-gd55f500+35,18.1.0-10-gb58edde+2,18.1.0-11-g0997b02+4,18.1.0-13-gfe4edf0b+12,18.1.0-14-g259bd21+21,18.1.0-19-gdb69f3f+2,18.1.0-2-g5f9922c+24,18.1.0-2-gd3b74e5+11,18.1.0-2-gfbf3545+32,18.1.0-26-g728bddb4+5,18.1.0-27-g6ff7ca9+2,18.1.0-3-g52aa583+25,18.1.0-3-g8ea57af+9,18.1.0-3-gb69f684+42,18.1.0-3-gfcaddf3+6,18.1.0-32-gd8786685a,18.1.0-4-gf3f9b77+6,18.1.0-5-g1dd662b+2,18.1.0-5-g6dbcb01+41,18.1.0-6-gae77429+3,18.1.0-7-g9d75d83+9,18.1.0-7-gae09a6d+30,18.1.0-9-gc381ef5+4,w.2019.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.