intervalintersection Class Reference

Interval overlap tests. More...

#include <mathlib.h>

List of all members.

Static Public Member Functions
template<class T >
static boolc	unordered (T const a0, T const a1, T const b0, T const b1)
	Do the two intervals overlap?
template<class T >
static boolc	unordered (T &c0, T &c1, T const a0, T const a1, T const b0, T const b1)
	Find the common interval of intersection if it exists.
template<class I >
static boolc	unordered (I const *i0, I const *i1)
	Do the two intervals overlap?
template<class I >
static boolc	unorderedD2 (I const *box0, I const *box1)
	Test for overlap in two dimensions.

---

Detailed Description

Interval overlap tests.

Definition at line 105 of file mathlib.h.

---

Member Function Documentation

template<class I >

static boolc intervalintersection::unordered	(	I const *	i0,
		I const *	i1
	)			[inline, static]

Do the two intervals overlap?

Definition at line 133 of file mathlib.h.

References unordered().

Referenced by unordered().

    { return unordered(i0[0],i0[1],i1[0],i1[1]); }

template<class T >

boolc intervalintersection::unordered	(	T &	c0,
		T &	c1,
		T const	a0,
		T const	a1,
		T const	b0,
		T const	b1
	)			[inline, static]

Find the common interval of intersection if it exists.

Definition at line 942 of file mathlib.h.

{
  // Order the points.
  T a[2];
  if (a0<a1)
  {
    a[0] = a0;
    a[1] = a1;
  }
  else
  {
    a[1] = a0;
    a[0] = a1;
  }
  T b[2];
  if (b0<b1)
  {
    b[0] = b0;
    b[1] = b1;
  }
  else
  {
    b[1] = b0;
    b[0] = b1;
  }

//cout << SHOW(a[0]) << " " << SHOW(a[1]) << endl;
//cout << SHOW(b[0]) << " " << SHOW(b[1]) << endl;

  if (a[1]<b[0])
    return false;

  if (b[1]<a[0])
    return false;

  // Find the intersection interval.
  if (a[0]<b[0])
  {
//cout << "a[0]<b[0]" << endl;
    if (b[1]<a[1])
    {
//cout << "b[1]<a[1]" << endl;
      c0 = b[0];
      c1 = b[1];
    }
    else
    {
      c0 = b[0];
      c1 = a[1];
    }
  }
  else
  {
//cout << "b[0]<a[0]" << endl;
    if (a[1]<b[1])
    {
      c0 = a[0];
      c1 = a[1];
    }
    else
    {
      c0 = a[0];
      c1 = b[1];
    }
  }

  return true;
}

template<class T >

boolc intervalintersection::unordered	(	T const	a0,
		T const	a1,
		T const	b0,
		T const	b1
	)			[inline, static]

Do the two intervals overlap?

Definition at line 897 of file mathlib.h.

Referenced by disk::intersects(), mathlibtest::test04(), mathlibtest::test05(), mathlibtest::test06(), and unorderedD2().

{
  // Order the points.
  T a[2];
  if (a0<a1)
  {
    a[0] = a0;
    a[1] = a1;
  }
  else
  {
    a[1] = a0;
    a[0] = a1;
  }
  T b[2];
  if (b0<b1)
  {
    b[0] = b0;
    b[1] = b1;
  }
  else
  {
    b[1] = b0;
    b[0] = b1;
  }

  if (a[1]<b[0])
    return false;

  if (b[1]<a[0])
    return false;

  return true;
}

template<class I >

static boolc intervalintersection::unorderedD2	(	I const *	box0,
		I const *	box1
	)			[inline, static]

Test for overlap in two dimensions.

The first row of I is the x interval, the second row is the y interval.

Definition at line 141 of file mathlib.h.

References unordered().

Referenced by mathlibtest::test07().

  {
    if (unordered(box0,box1)==false)
      return false;

    return unordered(box0+2,box1+2);
  }

---

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

• mathlib/mathlib.h