LSST Applications g013ef56533+d2224463a4,g199a45376c+0ba108daf9,g19c4beb06c+9f335b2115,g1fd858c14a+2459ca3e43,g210f2d0738+2d3d333a78,g262e1987ae+abbb004f04,g2825c19fe3+eedc38578d,g29ae962dfc+0cb55f06ef,g2cef7863aa+aef1011c0b,g35bb328faa+8c5ae1fdc5,g3fd5ace14f+19c3a54948,g47891489e3+501a489530,g4cdb532a89+a047e97985,g511e8cfd20+ce1f47b6d6,g53246c7159+8c5ae1fdc5,g54cd7ddccb+890c8e1e5d,g5fd55ab2c7+951cc3f256,g64539dfbff+2d3d333a78,g67b6fd64d1+501a489530,g67fd3c3899+2d3d333a78,g74acd417e5+0ea5dee12c,g786e29fd12+668abc6043,g87389fa792+8856018cbb,g89139ef638+501a489530,g8d7436a09f+5ea4c44d25,g8ea07a8fe4+81eaaadc04,g90f42f885a+34c0557caf,g9486f8a5af+165c016931,g97be763408+d5e351dcc8,gbf99507273+8c5ae1fdc5,gc2a301910b+2d3d333a78,gca7fc764a6+501a489530,gce8aa8abaa+8c5ae1fdc5,gd7ef33dd92+501a489530,gdab6d2f7ff+0ea5dee12c,ge410e46f29+501a489530,geaed405ab2+e3b4b2a692,gf9a733ac38+8c5ae1fdc5,w.2025.41
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 | |
namespace | lsst |
namespace | lsst::sphgeom |
namespace | 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.