Polygon2D Class Reference

2D polygon. More...

#include <Polygon2D.h>

Public Member Functions
	Polygon2D (const HepGeom::Point3D< double > *points, int n)
	Constructor.
	Polygon2D (const Polygon2D &)=delete
	Copy constructor (disabled).
Polygon2D &	operator= (const Polygon2D &)=delete
	Operator = (disabled).
	~Polygon2D ()
	Destructor.
bool	pointInside (const HepGeom::Point3D< double > &point) const
	Check if point is inside the polygon.
bool	hasIntersection (const LineSegment2D &lineSegment) const
	Check whether polygon has an intersection with a line segment or this line segment is fully inside the polygon.
bool	hasIntersection (const Arc2D &arc) const
	Check whether polygon has an intersection with an arc or this arc is fully inside the polygon.
bool	hasIntersection (const Polygon2D &polygon) const
	Check whether polygon has an intersection with a polygon or one of the polygons is fully inside another polygon.
LineSegment2D **	getLineSegments () const
	Get line segments.

Private Attributes
int	m_nPoints
	Number of points.
LineSegment2D **	m_LineSegments
	Line segments.

Detailed Description

2D polygon.

Definition at line 29 of file Polygon2D.h.

Constructor & Destructor Documentation

Polygon2D()

Polygon2D	(	const HepGeom::Point3D< double > *	points,
		int	n
	)

Constructor.

Parameters

[in]	points	Points.
[in]	n	Number of points.

Definition at line 17 of file Polygon2D.cc.

                                                                    :
  m_nPoints(n)
{
  int i;
  m_LineSegments = new LineSegment2D*[n];
  for (i = 0; i < n; i++) {
    if (i < n - 1)
      m_LineSegments[i] = new LineSegment2D(points[i], points[i + 1]);
    else
      m_LineSegments[i] = new LineSegment2D(points[i], points[0]);
  }
}

~Polygon2D()

~Polygon2D

(

)

Destructor.

Definition at line 30 of file Polygon2D.cc.

{
  int i;
  for (i = 0; i < m_nPoints; i++)
    delete m_LineSegments[i];
  delete[] m_LineSegments;
}

Member Function Documentation

getLineSegments()

LineSegment2D ** getLineSegments ( ) const

inline

Get line segments.

Definition at line 84 of file Polygon2D.h.

      {
        return m_LineSegments;
      }

hasIntersection() [1/3]

bool hasIntersection

(

const Arc2D &

arc

)

const

Check whether polygon has an intersection with an arc or this arc is fully inside the polygon.

Parameters

[in]

arc

Arc.

Definition at line 76 of file Polygon2D.cc.

{
  int i;
  HepGeom::Point3D<double> intersections[2];
  for (i = 0; i < m_nPoints; i++) {
    if (m_LineSegments[i]->findIntersection(arc, intersections) > 0)
      return true;
  }
  if (pointInside(arc.getInitialPoint()))
    return true;
  return false;
}

hasIntersection() [2/3]

bool hasIntersection

(

const LineSegment2D &

lineSegment

)

const

Check whether polygon has an intersection with a line segment or this line segment is fully inside the polygon.

Parameters

[in]

lineSegment

Line segment.

Definition at line 63 of file Polygon2D.cc.

{
  int i;
  HepGeom::Point3D<double> intersection;
  for (i = 0; i < m_nPoints; i++) {
    if (m_LineSegments[i]->findIntersection(lineSegment, &intersection) > 0)
      return true;
  }
  if (pointInside(lineSegment.getInitialPoint()))
    return true;
  return false;
}

hasIntersection() [3/3]

bool hasIntersection

(

const Polygon2D &

polygon

)

const

Check whether polygon has an intersection with a polygon or one of the polygons is fully inside another polygon.

Parameters

[in]

polygon

Polygon.

Definition at line 89 of file Polygon2D.cc.

{
  int i;
  for (i = 0; i < m_nPoints; i++) {
    if (polygon.hasIntersection(*m_LineSegments[i]))
      return true;
  }
  if (pointInside(polygon.getLineSegments()[0]->getInitialPoint()) ||
      polygon.pointInside(m_LineSegments[0]->getInitialPoint()))
    return true;
  return false;
}

pointInside()

bool pointInside

(

const HepGeom::Point3D< double > &

point

)

const

Check if point is inside the polygon.

Definition at line 38 of file Polygon2D.cc.

{
  int i, n, nIntersections;
  double angle, t[2];
  HepGeom::Point3D<double> intersection;
new_line: {
    nIntersections = 0;
    angle = gRandom->Uniform(0., 2.0 * M_PI);
    Line2D line(point.x(), point.y(), cos(angle), sin(angle));
    for (i = 0; i < m_nPoints; i++) {
      n = m_LineSegments[i]->Line2D::findIntersection(line, &intersection, t);
      if (n == 0)
        continue;
      /* Line goes through vertex, need to generate another line. */
      if (t[0] == 0 || t[0] == 1)
        goto new_line;
      if (t[0] > 0 && t[0] < 1 && t[1] > 0)
        nIntersections++;
    }
  }
  if (nIntersections % 2 == 1)
    return true;
  return false;
}

Member Data Documentation

m_LineSegments

LineSegment2D** m_LineSegments

private

Line segments.

Definition at line 95 of file Polygon2D.h.

m_nPoints

int m_nPoints

private

Number of points.

Definition at line 92 of file Polygon2D.h.

---

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

• klm/eklm/geometry/include/Polygon2D.h
• klm/eklm/geometry/src/Polygon2D.cc