|
LSSTApplications
16.0-10-g0ee56ad,16.0-11-ga33d1f2+2,16.0-12-g3ef5c14+1,16.0-12-g71e5ef5+14,16.0-12-gbdf3636+2,16.0-13-g118c103+2,16.0-13-g8f68b0a,16.0-15-gbf5c1cb,16.0-16-gfd17674+2,16.0-17-g7c01f5c+2,16.0-18-g0a50484,16.0-20-ga20f992+3,16.0-21-g0e05fd4+2,16.0-21-g15e2d33,16.0-22-g62d8060,16.0-22-g847a80f,16.0-24-gfa57b64+1,16.0-28-g3990c221,16.0-3-gf928089+2,16.0-32-g88a4f23,16.0-34-gd7987ad,16.0-36-g6d07a18,16.0-4-g10fc685,16.0-4-g18f3627+24,16.0-4-g5f3a788+25,16.0-5-gaf5c3d7+1,16.0-5-gcc1f4bb,16.0-6-g3b92700,16.0-6-g4412fcd+2,16.0-6-g7235603+1,16.0-68-gb45e8e9d,16.0-7-g0913a87,16.0-7-g56728dd,16.0-8-g14ebd58,16.0-8-g2df868b,16.0-8-g4cec79c+1,16.0-81-g9604f5049,16.0-9-g5400cdc,16.0-9-ge6233d7+1,master-g2880f2d8cf+1,w.2019.05
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.13