PUBLIC

Polygon2dC::Polygon2dC(void) Polygon2dC::Polygon2dC(const Point2dListC &) Polygon2dC::Polygon2dC(const Polygon2dC &) Polygon2dC::Polygon2dC(const SubPolygon2dC &) Polygon2dC::Polygon2dC(const char *) Polygon2dC::List(void) const Polygon2dC::Area2(void) const Polygon2dC::IsDiagonalie(const Point2dCLIterC &,const Point2dCLIterC &) const Polygon2dC::IsInCone(const Point2dCLIterC &,const Point2dCLIterC &) const Polygon2dC::IsDiagonal(const Point2dCLIterC &,const Point2dCLIterC &) const Polygon2dC::Contains(const Point2dC &) const Polygon2dC::Triangulate(void) Polygon2dC::SaveAsGF(ostream &) Polygon2dC::List(void) Polygon2dC::operator>>(istream &,Polygon2dC &) Polygon2dC::operator<<(ostream &,const Polygon2dC &)

Polygon2dC
A polygon in 2d space
include	"amma/Polygon2.hh"
User Level:	Default
Library:	Mcg2
Example:	exBnd.cc
Section:	Geometry.2-D
In Scope:	std

Comments:
The Polygon2dC class is a representation of a polygon in 2 dimensional space. A polygon is the region of a plane bounded by a finite collection of line segments forming a simple closed curve.

Ref.: - O'Rourke,J.: Computatinal geometry in C; Cambridge University Press, 1994, p. 1

BIG OBJECT

private Point2dListC

Polygon2dC()

Empty polygon.

Polygon2dC(const Point2dListC & points)

Constructs a polygon from a list of points. The 'points' will be shared by the polygon (as a big object).

Polygon2dC(const Polygon2dC & points)

Another access to the polygon.

Polygon2dC(const SubPolygon2dC & pol)

Creates the polygon from the subset of vertexes of another polygon.

Polygon2dC(const char * s)

Creates the polygon from one item of a GF set.

const DListC<Point2dC> & List() const

Access to the constant list of vertexes.

RealT Area2() const

Returns twice the signed area of this polygon. Ref.: - O'Rourke,J.: Computatinal geometry in C; Cambridge University Press, 1994, pp. 20-26

BooleanT IsDiagonalie(const Point2dCLIterC & a,const Point2dCLIterC & b) const

Returns TRUE if (a, b) is a proper internal *or* external diagonal of this polygon. The edges incident to 'a' and 'b' are ignored. Ref.: - O'Rourke,J.: Computatinal geometry in C; Cambridge University Press, 1994, pp. 35-36

BooleanT IsInCone(const Point2dCLIterC & a,const Point2dCLIterC & b) const

Returns TRUE iff the diagonal (a,b) is strictly internal to this polygon in the neighborhood of the 'a' endpoint. Ref.: - O'Rourke,J.: Computatinal geometry in C; Cambridge University Press, 1994, pp. 37-38

BooleanT IsDiagonal(const Point2dCLIterC & a,const Point2dCLIterC & b) const

Returns TRUE iff (a,b) is a proper internal diagonal of this polygon. Ref.: - O'Rourke,J.: Computatinal geometry in C; Cambridge University Press, 1994, pp. 38-39

BooleanT Contains(const Point2dC & p) const

Returns TRUE iff the point 'p' is an internal point of this polygon.

DListC<Line2dPPC> Triangulate()

Returns the set of diagonals of this polygon. The polygon vertexes are supposed to be in the counter-clockwise order and they can be collinear. The polygon is destroyed. Ref.: - O'Rourke,J.: Computatinal geometry in C; Cambridge University Press, 1994, pp. 35-42

void SaveAsGF(ostream & s)

Saves the polygon into the output stream 's' in GF format. private:

Point2dListC & List()

Access to the list of vertexes.
This was private, I'm not clear why...

istream & operator>>(istream & s,Polygon2dC & pol)

ostream & operator<<(ostream & s,const Polygon2dC & pol)