VM2D::NbBox Struct Reference

Габаритный прямоугольник More...

#include <cpuNeighborTree.h>

Public Member Functions
void	SetEmpty ()
void	Add (const Point2D &p)
void	Add (const NbBox &b)
bool	IsEmpty () const
double	Dist2 (const NbBox &b) const
	Квадрат расстояния до другого прямоугольника (для пустого — бесконечность).
double	Dist2 (const Point2D &p) const
	Квадрат расстояния до точки

Public Attributes
double	minx
double	miny
double	maxx
double	maxy

Detailed Description

Габаритный прямоугольник

Definition at line 54 of file cpuNeighborTree.h.

Member Function Documentation

Add() [1/2]

void VM2D::NbBox::Add ( const NbBox & b )

inline

Definition at line 70 of file cpuNeighborTree.h.

        {
            minx = std::min(minx, b.minx); maxx = std::max(maxx, b.maxx);
            miny = std::min(miny, b.miny); maxy = std::max(maxy, b.maxy);
        }

Add() [2/2]

void VM2D::NbBox::Add ( const Point2D & p )

inline

Definition at line 64 of file cpuNeighborTree.h.

        {
            minx = std::min(minx, p[0]); maxx = std::max(maxx, p[0]);
            miny = std::min(miny, p[1]); maxy = std::max(maxy, p[1]);
        }

Here is the caller graph for this function:

Dist2() [1/2]

double VM2D::NbBox::Dist2 ( const NbBox & b ) const

inline

Квадрат расстояния до другого прямоугольника (для пустого — бесконечность).

Definition at line 79 of file cpuNeighborTree.h.

        {
            if (IsEmpty() || b.IsEmpty())
                return std::numeric_limits<double>::infinity();
            const double dx = std::max(0.0, std::max(minx - b.maxx, b.minx - maxx));
            const double dy = std::max(0.0, std::max(miny - b.maxy, b.miny - maxy));
            return dx * dx + dy * dy;
        }

Here is the call graph for this function:

Here is the caller graph for this function:

Dist2() [2/2]

double VM2D::NbBox::Dist2 ( const Point2D & p ) const

inline

Квадрат расстояния до точки

Definition at line 89 of file cpuNeighborTree.h.

        {
            if (IsEmpty())
                return std::numeric_limits<double>::infinity();
            const double dx = std::max(0.0, std::max(minx - p[0], p[0] - maxx));
            const double dy = std::max(0.0, std::max(miny - p[1], p[1] - maxy));
            return dx * dx + dy * dy;
        }

Here is the call graph for this function:

IsEmpty()

bool VM2D::NbBox::IsEmpty ( ) const

inline

Definition at line 76 of file cpuNeighborTree.h.

{ return minx > maxx; }

Here is the caller graph for this function:

SetEmpty()

void VM2D::NbBox::SetEmpty ( )

inline

Definition at line 58 of file cpuNeighborTree.h.

        {
            minx = miny = std::numeric_limits<double>::infinity();
            maxx = maxy = -std::numeric_limits<double>::infinity();
        }

Here is the caller graph for this function:

Member Data Documentation

maxx

double VM2D::NbBox::maxx

Definition at line 56 of file cpuNeighborTree.h.

maxy

double VM2D::NbBox::maxy

Definition at line 56 of file cpuNeighborTree.h.

minx

double VM2D::NbBox::minx

Definition at line 56 of file cpuNeighborTree.h.

miny

double VM2D::NbBox::miny

Definition at line 56 of file cpuNeighborTree.h.

---

The documentation for this struct was generated from the following file:

• VM2D/TreeCPU2D/cpuNeighborTree.h