Package micycle.pgs.commons

The commons package contains all non-core PGS classes (of varying authorship and either not worth putting in separate package or too long to include within the calling PGS method itself).

See: Description

Class Summary

Class	Description
AreaMerge	The AreaMerge class provides a method to recursive merge smaller faces of a mesh into their adjacent faces.
BezierShapeGenerator	2D random shape generator using Bezier curves.
ChaikinCut	Chaikin’s corner-cutting algorithm, which is used to perform polygon smoothing.
ClosestPointPair	An implementation of a divide-and-conquer algorithm for computing the closest pair of elements of a set of points.
CornerRounding	Corner rounding for PShape polygons.
DiscreteCurveEvolution	The DiscreteCurveEvolution class is used to simplify polygonal curves while maintaining their perceptual appearance.
DoyleSpiral	Doyle spirals are patterns of non-crossing circles in the plane, each tangent to six others.
EllipticFourierDesc	Implements Elliptic Fourier Descriptors (EFD).
FarthestPointPair	The FarthestPair data type computes the farthest pair of points in a set of n points in the plane and provides accessor methods for getting the farthest pair of points and the distance between them.
FastAtan2	Fast, high-quality polynomial-based atan2 approximation.
FastConvexHull	An optimised implementation of Andrew's monotone chain algorithm for constructing convex hulls.
FastPolygonizer	This class solves the problem of finding polygons formed by a collection of edges.
FrontChainPacker	Circle packing of rectangle boundaries using the front-chain packing algorithm from 'Visualization of Large Hierarchical Data by Circle Packing'.
GaussianLineSmoothing	Line gaussian smoothing.
GeneticColoring<V,E>	Finds a solution to a graph coloring using a genetic algorithm.
GeometricMedian	Computes 2D/3D weighted geometric median.
HatchTiling	Port of https://openprocessing.org/sketch/1523350/
IncrementalTinDual	Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation.
LargestEmptyCircles	Adapts LargestEmptyCircle, allowing for repeated calls to find the N largest empty circles in an optimised manner.
MaximumInscribedAARectangle	Computes the largest inscribed axis-aligned rectangle within a convex hull.
MaximumInscribedRectangle	Finds an approximate largest area rectangle of arbitrary orientation in a polygon via particle swarm optimisation.
MinimumBoundingEllipse	Minimum Volume Enclosing Ellipsoid
MinimumBoundingTriangle	Computes the Minimum Bounding Triangle (MBT) for the points in a Geometry.
PEdge	An undirected edge / line segment joining 2 PVectors.
PenroseTiling	Generates a Penrose tiling of the plane.
PMesh	Models a GROUP PShape comprising faces of a 2D mesh as a topological entity, ready for mesh optimisation via Laplacian smoothing, a form of diffusion smoothing.
PoissonDistribution	Deprecated in favour of PoissonDistributionJRUS
PoissonDistributionJRUS	Generates sets of random points via Poisson Disk Sampling.
PolygonDecomposition	Implementation of the Bayazit convex decomposition algorithm for simple polygons.
ProcrustesAlignment	The ProcrustesAlignment class provides methods for performing ProcrustesAlignment analysis, which is a technique for aligning and comparing geometric shapes.
RandomPolygon	Random Convex Polygons
RandomSpaceFillingCurve	Generates random space-filling curves.
RectangularSubdivision	Random rectangle subdivision.
RepulsionCirclePack	Repulsion Packing attempts to arrange a set of circles of specified radii within a rectangle such that there is no-overlap between circles.
RLFColoring<V,E>	The Recursive Largest First (RLF) algorithm for graph coloring.
SeededRandomPointsInGridBuilder	An extension to the RandomPointsInGridBuilder class that accepts a random seed for repeatable outputs.
ShapeInterpolation	Best-guess interpolation between any two linear rings.
SpiralQuadrangulation	Quadrangulations of Planar Point Sets via the Spiraling Rotating Calipers Algorithm.
SquareTriangleTiling	A non-periodic (quasiperiodic?) tiling, comprising squares and equilateral triangles.
Star	Methods to create star shapes
TangencyPack	Implements a circle packing algorithm described by Collins and Stephenson (2003) to find an arrangement of circles which corresponds to a graph of desired circle tangencies.
TriangleSubdivision	Balanced triangle subdivision.
VisibilityPolygon	This class computes an isovist, which is the volume of space visible from a specific point in space, based on a given set of original segments.

Annotation Types Summary

Annotation Type	Description
Nullable	An element annotated with Nullable claims null value is perfectly valid to return (for methods), pass to (parameters) and hold (local variables and fields).

Package micycle.pgs.commons Description

The commons package contains all non-core PGS classes (of varying authorship and either not worth putting in separate package or too long to include within the calling PGS method itself).