polygon.H File Reference

2D polygon representation and geometric operations. More...

#include <dlink.H>
#include <point.H>
#include <ah-errors.H>
#include <ah-dry.H>
#include <ahDry.H>
#include <ah-iterator.H>
#include <string>
#include <utility>

Include dependency graph for polygon.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::Vertex
	A vertex in a polygon's doubly linked vertex list. More...
class	Aleph::Polygon
	A general (irregular) 2D polygon defined by a sequence of vertices. More...
class	Aleph::Polygon::Iterator
	STL/Aleph-compatible iterator over polygon vertices as Points. More...
struct	Aleph::Polygon::Vertex_Iterator
	Iterator over the vertices of a polygon. More...
class	Aleph::Polygon::Segment_Iterator
	Iterator over the edges (segments) of a polygon. More...
class	Aleph::Regular_Polygon
	A regular polygon defined by center, side length, and vertex count. More...
class	Aleph::Regular_Polygon::Vertex_Iterator
	Iterator over the vertices of a regular polygon. More...
class	Aleph::Regular_Polygon::Segment_Iterator
	Iterator over the edges (segments) of a regular polygon. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Functions
std::ostream &	Aleph::operator<< (std::ostream &o, const Polygon &p)
	Output stream operator for Polygon.
std::ostream &	Aleph::operator<< (std::ostream &o, const Regular_Polygon &p)
	Output stream operator for Regular_Polygon.

Detailed Description

2D polygon representation and geometric operations.

This file provides classes for representing and manipulating 2D polygons:

• Vertex: A point that participates in a doubly linked list of vertices.
• Polygon: General (irregular) polygon defined by a sequence of vertices.
• Regular_Polygon: Regular polygon defined by center, side length, and vertex count.

Key Features

• Dynamic vertex management: Add/remove vertices with automatic validation.
• Self-intersection detection: Prevents creation of self-intersecting polygons.
• Colinearity handling: Automatically merges colinear edges.
• Bounding box tracking: Extreme points (lowest, highest, leftmost, rightmost) are maintained incrementally.
• Point containment: Test if a point lies inside a closed polygon.
• Iterators: Traverse vertices or edges (segments) of the polygon.
• Regular polygon support: Create n-sided regular polygons with rotation.

Usage Example

#include <polygon.H>
 
// Create a square polygon
Polygon square;
square.add_vertex(Point(0, 0));
square.add_vertex(Point(100, 0));
square.add_vertex(Point(100, 100));
square.add_vertex(Point(0, 100));
square.close();
 
// Check if point is inside
Point p(50, 50);
if (square.contains(p))
  std::cout << "Point is inside the square\n";
 
// Create a regular hexagon
Regular_Polygon hexagon(Point(200, 200), 50.0, 6);
std::cout << "Hexagon radius: " << hexagon.radius() << "\n";

Thread Safety

None of the classes in this file are thread-safe. External synchronization is required for concurrent access.

Author

Leandro Rabindranath León

Definition in file polygon.H.