- centerLine(PShape) - Static method in class micycle.pgs.PGS_Contour
-
Calculates the longest center line passing through a given shape (using
default straightness weighting and smoothing parameters).
- centerLine(PShape, double, double) - Static method in class micycle.pgs.PGS_Contour
-
Calculates the longest center line passing through a given shape.
- centroid(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Computes the centroid of a shape.
- centroidQuadrangulation(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Generates a quadrangulation from a triangulation by "inverting" triangles
(for each triangle, create edges joining its centroid to each of its
vertices).
- chaikin(PShape, float, int) - Static method in class micycle.pgs.commons.ChaikinCut
-
- ChaikinCut - Class in micycle.pgs.commons
-
Chaikin’s corner-cutting algorithm, which is used to perform polygon
smoothing.
- chaikinCut(PShape, double, int) - Static method in class micycle.pgs.PGS_Morphology
-
Smoothes a shape by recursively cutting its corners, a technique introduced
by George Chaikin in 1974.
- chordalAxis(PShape) - Static method in class micycle.pgs.PGS_Contour
-
Computes the chordal axis of a shape, which provides a characterization of
the skeleton of a shape.
- circleCoverage(PShape, int) - Static method in class micycle.pgs.PGS_Optimisation
-
Covers a polygon with n circles such that no circle’s center lies outside the
polygon.
- circleCoverage(PShape, int, long) - Static method in class micycle.pgs.PGS_Optimisation
-
Covers a polygon with n circles such that no circle’s center lies outside the
polygon.
- circularity(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Calculates the Miller circularity index for a shape.
- cleanCoverage(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
Removes gaps and overlaps from meshes/polygon collections that are intended
to satisfy the following conditions:
Vector-clean - edges between neighbouring polygons must either be
identical or intersect only at endpoints.
Non-overlapping - No two polygons may overlap.
- closestPoint(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
Returns the nearest point of the shape to the given point.
- ClosestPointPair - Class in micycle.pgs.commons
-
An implementation of a divide-and-conquer algorithm for computing the closest
pair of elements of a set of points.
- ClosestPointPair(Collection<PVector>) - Constructor for class micycle.pgs.commons.ClosestPointPair
-
Construct an instance of the algorithm for the specified point Collection.
- closestPointPair(Collection<PVector>) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the closest pair of points in a set of points.
- closestPoints(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
Returns the nearest point for each "island" / separate polygon in the GROUP
input shape.
- cluster(Collection<PVector>, int) - Static method in class micycle.pgs.PGS_PointSet
-
Clusters points into N groups, using k-means clustering.
- cluster(Collection<PVector>, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
Clusters points into N groups, using k-means clustering.
- colorMesh(PShape, PGS_Coloring.ColoringAlgorithm) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given mesh shape, returning a color class for each
mesh face.
- colorMesh(Collection<PShape>, PGS_Coloring.ColoringAlgorithm) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given mesh shape, returning a color class for each
mesh face.
- colorMesh(PShape, PGS_Coloring.ColoringAlgorithm, int[]) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given mesh shape and colors its faces using the
colors provided.
- colorMesh(PShape, PGS_Coloring.ColoringAlgorithm, String[]) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given mesh shape and colors its faces using the
colors provided.
- colorNonMesh(PShape, PGS_Coloring.ColoringAlgorithm) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given non-conforming mesh shape, returning a color
class for each face of the pre-processed (noded) mesh.
- colorNonMesh(PShape, PGS_Coloring.ColoringAlgorithm, int[]) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given non-conforming mesh shape and colors the
faces of its noded representation using the colors provided.
- colorNonMesh(PShape, PGS_Coloring.ColoringAlgorithm, String[]) - Static method in class micycle.pgs.PGS_Coloring
-
Computes a coloring of the given non-conforming mesh shape and colors the
faces of its noded representation using the colors provided.
- complement(PShape, double, double) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Calculates the complement (or inverse) of the provided shape within a
rectangular boundary of specified width and height.
- compoundVoronoi(PShape) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram for a set of disjoint shapes.
- compoundVoronoi(PShape, double[]) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram for a set of disjoint shapes.
- computeEFDDistance(double[], double[]) - Static method in class micycle.pgs.commons.EllipticFourierDesc
-
Computes pairwise euclidean distance between two descriptors (of equal
length).
- computeMIR() - Method in class micycle.pgs.commons.MaximumInscribedRectangle
-
Computes the Returns the
- concaveHull(PShape, double, boolean) - Static method in class micycle.pgs.PGS_Hull
-
Constructs a concave hull of a set of polygons, respecting the polygons as
constraints (i.e.
- concaveHullBFS(List<PVector>, double) - Static method in class micycle.pgs.PGS_Hull
-
Computes the concave hull of a point set using a breadth-first method.
- concaveHullBFS2(List<PVector>, double) - Static method in class micycle.pgs.PGS_Hull
-
Computes the concave hull of a point set using a different algorithm.
- concaveHullDFS(List<PVector>, double) - Static method in class micycle.pgs.PGS_Hull
-
Computes the concave hull of a point set using a depth-first method.
- contains(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether the outer shape fully contains the inner shape.
- containsAllPoints(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether a shape contains every point from a list of points.
- containsPoint(PShape, PVector) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether a shape contains a point.
- containsPoints(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Measures for each point in the input whether it is contained in the given
shape.
- convexHull(List<PVector>) - Static method in class micycle.pgs.commons.FastConvexHull
-
- convexHull(Collection<PVector>) - Static method in class micycle.pgs.PGS_Hull
-
Computes the convex hull of a point set (the smallest convex polygon that
contains all the points).
- convexHull(PShape) - Static method in class micycle.pgs.PGS_Hull
-
Computes the convex hull of the vertices from the input shape (the smallest
convex polygon that contains all the shape's vertices).
- convexity(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Computes the convexity of a shape using a simple area-based measure of
convexity.
- convexPartition(PShape) - Static method in class micycle.pgs.PGS_Processing
-
Partitions shape(s) into convex (simple) polygons.
- copy() - Method in class micycle.pgs.commons.PEdge
-
- copy(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Produces a deep copy / clone of the input shape.
- CornerRounding - Class in micycle.pgs.commons
-
Corner rounding for PShape polygons.
- createArbelos(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates an Arbelos shape, a mathematical figure bounded by three semicircles.
- createArc(double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates an elliptical arc polygon (a slice of a circle).
- createBlobbie(double, double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a "blob"-like shape.
- createFermatSpiral(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates Fermat's spiral, a parabolic spiral which is symmetrical about the
origin.
- createGear(double, double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
Creates a gear shape from a parametric gear curve.
- createHeart(double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a heart shape.
- createHilbertCurve(double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
Creates a Hilbert Curve shape, a type of plane-filling curve.
- createKochSnowflake(double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
Creates a Koch Snowflake shape, a fractal curve.
- createLinearSpiral(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates an linear/archimedean spiral shape, where the distance between any 2
successive windings is constant.
- createPolygon() - Method in class micycle.pgs.commons.EllipticFourierDesc
-
Returns the polygon computed using all of this instance's EFD coefficients.
- createPolygon(int) - Method in class micycle.pgs.commons.EllipticFourierDesc
-
Creates the polygon corresponding to the nth harmonic.
- createRandomBezierPolygon(int, double, double, double, long) - Static method in class micycle.pgs.PGS_Construction
-
Generates a smooth or spiky random polygon comprising Bezier curves.
- createRandomPolygon(int, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Generates a random simple convex polygon (n-gon).
- createRandomPolygon(int, double, double, long) - Static method in class micycle.pgs.PGS_Construction
-
Generates a random simple convex polygon (n-gon), having a given random seed.
- createRandomPolygonExact(int, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Generates a random simple convex polygon (n-gon), where the output's bounding
box has the dimensions of those specified.
- createRandomPolygonExact(int, double, double, long) - Static method in class micycle.pgs.PGS_Construction
-
Generates a random simple convex polygon (n-gon), where the output's bounding
box has the dimensions of those specified.
- createRandomSFCurve(int, int, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a random space-filling curve.
- createRandomSFCurve(int, int, double, double, long) - Static method in class micycle.pgs.PGS_Construction
-
Creates a random space-filling curve, having a specific random seed.
- createRectangularSpiral(float, float, float, float, float) - Static method in class micycle.pgs.PGS_Construction
-
Creates a rectangular-shaped spiral shape.
- createRing(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a joined ring (a "donut") shape.
- createRing(double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates an (un)joined ring shape.
- createSierpinskiCarpet(double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
Creates a Sierpiński Carpet shape, a type of plane fractal.
- createSierpinskiCurve(double, double, double, int) - Static method in class micycle.pgs.PGS_Construction
-
Creates a closed Sierpiński curve (a recursive space-filling curve), having a
user-defined degree/order.
- createSierpinskiTriCurve(PGS_Construction.SierpinskiTriCurveType, double, int) - Static method in class micycle.pgs.PGS_Construction
-
Creates one of a family of trifurcating Sierpinski curves.
- createSponge(double, double, int, double, double, int, long) - Static method in class micycle.pgs.PGS_Construction
-
Creates a sponge-like porous structure.
- createStar(double, double, int, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a star shape, having a specified number of rays.
- createStarShape(double, double, double, double, int, double) - Static method in class micycle.pgs.commons.Star
-
Create a star shape from the given parameters.
- createSupercircle(double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a supercircle shape.
- createSuperRandomPolygon(double, int, double, int, int, boolean, boolean, long) - Static method in class micycle.pgs.PGS_Construction
-
Generates a highly customisable random polygon based on a square grid of NxN
cells.
- createSuperShape(double, double, double, double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a supershape PShape.
- createTaijitu(double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a Taijitu shape (a geometric representation of the Taoist
symbol of yin and yang).
- createTeardrop(double, double, double, double) - Static method in class micycle.pgs.PGS_Construction
-
Creates a teardrop shape from a parametric curve.
- decompose(Polygon) - Static method in class micycle.pgs.commons.PolygonDecomposition
-
- delaunayTriangulation(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a constrained Delaunay Triangulation from the given shape.
- delaunayTriangulation(PShape, Collection<PVector>, boolean, int, boolean) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a Delaunay Triangulation from the given shape.
- delaunayTriangulation(Collection<PVector>) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a Delaunay Triangulation from a collection of points.
- delaunayTriangulationMesh(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a constrained Delaunay Triangulation from the given shape.
- delaunayTriangulationMesh(PShape, Collection<PVector>, boolean, int, boolean) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a Delaunay Triangulation of the given shape and returns it in raw
form as a Triangulated Irregular Network (mesh).
- delaunayTriangulationMesh(Collection<PVector>) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a Delaunay Triangulation from a collection of points.
- delaunayTriangulationPoints(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a constrained Delaunay Triangulation from a collection of points.
- delaunayTriangulationPoints(PShape, Collection<PVector>, boolean, int, boolean) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a Delaunay Triangulation from the given shape.
- delaunayTriangulationPoints(Collection<PVector>) - Static method in class micycle.pgs.PGS_Triangulation
-
Generates a Delaunay Triangulation from a collection of points.
- densify(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
Densifies a shape by inserting additional vertices along its line segments.
- density(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Computes the ratio (density) of the shape's area compared to the area of it's
envelope.
- diameter(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Returns the diameter of a shape.
- dilationErosion(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Applies a positive followed by a negative buffer (in a single operation), the
effect of which is small holes and gaps are filled in, while the general
structure of the shape is preserved.
- disableAllFill(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Calls setFill(false) on a PShape and all its children.
- disableAllStroke(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Calls setStroke(false) on a PShape and all its children.
- DiscreteCurveEvolution - Class in micycle.pgs.commons
-
The DiscreteCurveEvolution class is used to simplify polygonal curves while
maintaining their perceptual appearance.
- DiscreteCurveEvolution(int) - Constructor for class micycle.pgs.commons.DiscreteCurveEvolution
-
Initialises an instance of the DiscreteCurveEvolution class.
- dissolve(Collection<PEdge>) - Static method in class micycle.pgs.PGS_SegmentSet
-
Dissolves the edges from a collection of
PEdges into a set of maximal-length LineStrings in which each unique segment
appears only once.
- distance(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Computes the minimum distance between two shapes.
- distanceField(PShape, double) - Static method in class micycle.pgs.PGS_Contour
-
Generates a contour map based on a distance field of a shape.
- divide() - Method in class micycle.pgs.commons.RectangularSubdivision
-
Produces a new rectangular subdivision using the configured parameters.
- divide() - Method in class micycle.pgs.commons.TriangleSubdivision
-
- DoyleSpiral - Class in micycle.pgs.commons
-
Doyle spirals are patterns of non-crossing circles in the plane, each tangent
to six others.
- DoyleSpiral(int, int, double) - Constructor for class micycle.pgs.commons.DoyleSpiral
-
- doyleSpiral(double, double, int, int, double) - Static method in class micycle.pgs.PGS_Tiling
-
Generates a Doyle spiral.
- dualFaces(IIncrementalTin) - Static method in class micycle.pgs.PGS_Meshing
-
Generates a (mesh-like) shape consisting of polygonal faces of the dual graph
of the given triangulation.
- earCutTriangulation(PShape) - Static method in class micycle.pgs.PGS_Triangulation
-
Computes a triangulation of the shape according to the ear clipping
("earcut") method.
- edgeCollapseQuadrangulation(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Generates a quadrangulation from a triangulation by selectively removing (or
"collapsing") the edges shared by neighboring triangles (via edge coloring).
- edgeDuals - Variable in class micycle.pgs.commons.IncrementalTinDual
-
Maps triangulation edges to their dual edge.
- edges - Variable in class micycle.pgs.commons.IncrementalTinDual
-
List of all edges in the dual graph.
- efdSimilarity(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Quantifies the similarity between two shapes, by using the pairwise euclidean
distance between each shape's Elliptic Fourier Descriptors (EFD).
- either() - Method in class micycle.pgs.commons.FarthestPointPair
-
Returns one of the points in the farthest pair of points.
- eliminateSlivers(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
Removes narrow areas ("slivers") from a shape while preserving the geometry
of the remaining parts.
- EllipticFourierDesc - Class in micycle.pgs.commons
-
Implements Elliptic Fourier Descriptors (EFD).
- EllipticFourierDesc(LinearRing, int) - Constructor for class micycle.pgs.commons.EllipticFourierDesc
-
Constructs a descriptor object for a given polygon and computes the
Elliptical Fourier Descriptors for it.
- EllipticFourierDesc(LinearRing) - Constructor for class micycle.pgs.commons.EllipticFourierDesc
-
Constructs a descriptor object for a given polygon and computes
#vertices/2 Elliptical Fourier Descriptors for it.
- elongation(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Measures the elongation of a shape; the ratio of a shape's bounding box
length to its width.
- envelope(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the shape's envelope (bounding box).
- equalPartition(PShape, int) - Static method in class micycle.pgs.PGS_Processing
-
Randomly partitions a shape into N approximately equal-area polygonal cells.
- equalPartition(PShape, int, long) - Static method in class micycle.pgs.PGS_Processing
-
Randomly (with a given seed) partitions a shape into N approximately
equal-area polygonal cells.
- equals(Object) - Method in class micycle.pgs.commons.IncrementalTinDual.DualEdge
-
- equals(Object) - Method in class micycle.pgs.commons.PEdge
-
- equalsExact(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Tests two shapes for structural equality.
- equalsNorm(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Tests two shapes for normalised structural equality.
- equalsTopo(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Tests two shapes for topological equality.
- erosionDilation(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Applies a negative followed by a positive buffer (in a single operation), the
effect of which is small edges/islands are removed, while the general
structure of the shape is preserved.
- execute() - Method in class micycle.pgs.commons.ClosestPointPair
-
Execute the algorithm.
- extractHoles(PShape) - Static method in class micycle.pgs.PGS_Processing
-
Extracts all the holes from a shape, returning them as if they are polygons.
- extractInnerEdges(PShape) - Static method in class micycle.pgs.PGS_Meshing
-
Extracts all inner edges from a mesh.
- extractPerimeter(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
Extracts a portion/subline of the perimeter of a shape between two locations
on the perimeter.
- FarthestPointPair - Class in micycle.pgs.commons
-
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.
- FarthestPointPair(Collection<PVector>) - Constructor for class micycle.pgs.commons.FarthestPointPair
-
Computes the farthest pair of points in the specified array of points.
- farthestPointPair(Collection<PVector>) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the farthest pair of points (the "diametral pair") in a set of n
points.
- FastAtan2 - Class in micycle.pgs.commons
-
Fast, high-quality polynomial-based atan2 approximation.
- FastConvexHull - Class in micycle.pgs.commons
-
An optimised implementation of Andrew's monotone chain algorithm for
constructing convex hulls.
- FastPolygonizer - Class in micycle.pgs.commons
-
This class solves the problem of finding polygons formed by a collection of
edges.
- fieldWarp(PShape, double, double, boolean) - Static method in class micycle.pgs.PGS_Morphology
-
Warps/perturbs a shape by displacing vertices according to a 2D noise vector
field.
- fieldWarp(PShape, double, double, double, boolean, int) - Static method in class micycle.pgs.PGS_Morphology
-
Warps/perturbs a shape by displacing vertices according to a 2D noise vector
field.
- filterAxisAligned(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
Removes axis-aligned (horizontal and vertical) segments (within a given angle
tolerance) from a collection of segments.
- filterByAverageLength(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
Removes segments having a length either less than some fraction or more than
1/fraction of the mean segment length from a collection of
segments.
- filterByMinLength(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
Removes segments having a length less than the given length from a collection
of segmensts.
- filterChildren(PShape, Predicate<PShape>) - Static method in class micycle.pgs.PGS_Processing
-
Filters out the children of a given PShape object based on a given Predicate
function.
- findContainedPoints(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Tests for each point in the input whether it is contained in/inside the given
shape; if it is, then the point is included in the output list.
- findContainingShape(PShape, PVector) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Finds the single child shape/cell (if any) that contains the query point from
a GROUP shape input (a shape that has non-overlapping children).
- findLECs(int) - Method in class micycle.pgs.commons.LargestEmptyCircles
-
Computes the (next) N largest empty circles.
- findNextLEC() - Method in class micycle.pgs.commons.LargestEmptyCircles
-
Computes the next largest empty circle.
- fixSegments() - Method in class micycle.pgs.commons.VisibilityPolygon
-
- flatten(Collection<PShape>) - Static method in class micycle.pgs.PGS_Conversion
-
Flattens a collection of PShapes into a single GROUP PShape which has the
input shapes as its children.
- flatten(PShape...) - Static method in class micycle.pgs.PGS_Conversion
-
Flattens a collection of PShapes into a single GROUP PShape which has the
input shapes as its children.
- flipHorizontal(PShape) - Static method in class micycle.pgs.PGS_Transformation
-
Flips the shape horizontally based on its centre point.
- flipHorizontal(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Flips the shape horizontally based on a line given by its Y location.
- flipVertical(PShape) - Static method in class micycle.pgs.PGS_Transformation
-
Flips the shape vertically based on its centre point.
- flipVertical(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Flips the shape vertically based on a line given by its X location.
- fromArray(double[][], boolean) - Static method in class micycle.pgs.PGS_Conversion
-
Creates a PShape from an array of doubles representing coordinates.
- fromChildren(Collection<PShape>) - Static method in class micycle.pgs.PGS_Conversion
-
Creates a single GROUP shape whose children shapes are the list given.
- fromCubicBezier(PVector, PVector, PVector, PVector) - Static method in class micycle.pgs.PGS_Conversion
-
Creates a PATH PShape representing a cubic bezier curve, given by its
parameters.
- fromEncodedPolyline(String) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a geometry in Encoded Polyline format into a PShape.
- fromGeoJSON(String) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a GeoJSON representation of a shape into its PShape counterpart.
- fromGraph(SimpleGraph<PVector, PEdge>) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a given SimpleGraph consisting of PVectors and PEdges into a PShape
by polygonizing its edges.
- fromGraph(SimpleGraph<V, E>, double, double, double) - Static method in class micycle.pgs.PGS_Conversion
-
Takes as input a graph and computes a layout for the graph vertices using a
Force-Directed placement algorithm (not vertex coordinates, if any exist).
- fromHexWKB(String) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a geometry in Well-Known Binary hex format into a PShape.
- fromJava2D(Shape) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a Java2D/java.awt Shape to a Processing PShape.
- fromPShape(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Transforms a PShape into a corresponding JTS Geometry.
- fromPShape(PShape) - Static method in class micycle.pgs.PGS_SegmentSet
-
Extracts a list of unique PEdge segments representing the given shape.
- fromPVector(Collection<PVector>) - Static method in class micycle.pgs.PGS_Conversion
-
Generates a shape from a list of vertices.
- fromPVector(PVector...) - Static method in class micycle.pgs.PGS_Conversion
-
Generates a shape from a list of vertices.
- fromPVector(List<PVector>, List<List<PVector>>) - Static method in class micycle.pgs.PGS_Conversion
-
Generates a polygonal shape from lists of vertices representing its shell and
holes.
- fromQuadraticBezier(PVector, PVector, PVector) - Static method in class micycle.pgs.PGS_Conversion
-
Creates a PATH PShape representing a quadratic bezier curve, given by its
parameters.
- fromWKB(byte[]) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a geometry in Well-Known Binary format into a PShape.
- fromWKB(String) - Static method in class micycle.pgs.PGS_Conversion
-
Reads a shape from a (binary) file containing the Well-Known Binary
representation of it.
- fromWKT(String) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a geometry in Well-Known Text format into a PShape.
- frontChainPack(PShape, double, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a random circle packing of tangential circles with varying radii
that overlap the given shape.
- FrontChainPacker - Class in micycle.pgs.commons
-
Circle packing of rectangle boundaries using the front-chain packing
algorithm from 'Visualization of Large Hierarchical Data by Circle Packing'.
- FrontChainPacker(float, float, float, float) - Constructor for class micycle.pgs.commons.FrontChainPacker
-
Creates a FrontChainPacker instance.
- FrontChainPacker(float, float, float, float, float, float) - Constructor for class micycle.pgs.commons.FrontChainPacker
-
Creates a FrontChainPacker instance.
- gabrielFaces(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Generates a shape consisting of polygonal faces of a Gabriel graph.
- gaussian(double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of random points having a gaussian/normal distribution.
- gaussian(double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of random points having a gaussian/normal distribution, using
the specified seed.
- GaussianLineSmoothing - Class in micycle.pgs.commons
-
Line gaussian smoothing.
- generate(boolean, boolean, double, long) - Method in class micycle.pgs.commons.BezierShapeGenerator
-
Generates a shape's curve based on the control points.
- generate(double, double, double, double, double, int) - Method in class micycle.pgs.commons.PoissonDistribution
-
Deprecated.
Generates a random point set, having a poisson/blue noise distribution.
- generate(double, double, double, double, double, int) - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
Generates a random point set, having a poisson/blue noise distribution.
- generate(double, double, double, double, double) - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
Generates a random point set, having a poisson/blue noise distribution.
- generate(double, double, double, double, int) - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
Generates a poisson point set having N points.
- generateRandomConvexPolygon(int, double, double, long) - Static method in class micycle.pgs.commons.RandomPolygon
-
- generateRandomGridPoints(PShape, int, boolean, double) - Static method in class micycle.pgs.PGS_Processing
-
Generates up to maxPoints number of random points that are
contained within the shape region.
- generateRandomGridPoints(PShape, int, boolean, double, long) - Static method in class micycle.pgs.PGS_Processing
-
Generates up to maxPoints number of random points that are
contained within the shape region.
- generateRandomPoints(PShape, int) - Static method in class micycle.pgs.PGS_Processing
-
Generates N random points that lie within the shape region.
- generateRandomPoints(PShape, int, long) - Static method in class micycle.pgs.PGS_Processing
-
Generates N random points that are contained within the shape region.
- GeneticColoring<V,E> - Class in micycle.pgs.commons
-
Finds a solution to a graph coloring using a genetic algorithm.
- GeneticColoring(Graph<V, E>) - Constructor for class micycle.pgs.commons.GeneticColoring
-
Creates with a population size of 50; "the value was chosen after testing a
number of different population sizes.
- GeneticColoring(Graph<V, E>, int, int, int) - Constructor for class micycle.pgs.commons.GeneticColoring
-
- GeometricMedian - Class in micycle.pgs.commons
-
Computes 2D/3D weighted geometric median.
- get(LineString, double) - Static method in class micycle.pgs.commons.GaussianLineSmoothing
-
- get(LineString, double, double) - Static method in class micycle.pgs.commons.GaussianLineSmoothing
-
Line gaussian smoothing.
- getBoundingCoordinates(int) - Method in class micycle.pgs.commons.MinimumBoundingEllipse
-
Returns a list of coordinates that can be used to render the ellipse.
- getCenter() - Method in class micycle.pgs.commons.MinimumBoundingEllipse
-
Returns the center point of the ellipse
- getChildren(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Recurses a GROUP PShape, finding all of its non-GROUP child PShapes.
- getCircles() - Method in class micycle.pgs.commons.DoyleSpiral
-
Returns a list of circles comprising the spriral.
- getCircles() - Method in class micycle.pgs.commons.FrontChainPacker
-
- getColoring() - Method in class micycle.pgs.commons.GeneticColoring
-
- getColoring() - Method in class micycle.pgs.commons.RLFColoring
-
- getCurve(float, float) - Method in class micycle.pgs.commons.RandomSpaceFillingCurve
-
- getEdges() - Method in class micycle.pgs.commons.PenroseTiling
-
Returns the edge work of the tiling.
- getEFD() - Method in class micycle.pgs.commons.EllipticFourierDesc
-
Returns the elliptic fourier descriptors, which are computed upon
initialisation.
- getEpsilon() - Method in class micycle.pgs.commons.VisibilityPolygon
-
- getFillColor(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Retrieves the fill color of a PShape.
- getGeometry() - Method in class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
- getInscribedRectangle() - Method in class micycle.pgs.commons.MaximumInscribedAARectangle
-
Returns the largest rectangle that will fit inside a convex hull
- getIsovist(Collection<Coordinate>, boolean) - Method in class micycle.pgs.commons.VisibilityPolygon
-
Returns a polygonal geometry that represents the isovist for a collection of
view points.
- getIsovist(Coordinate, boolean) - Method in class micycle.pgs.commons.VisibilityPolygon
-
Computes an isovist, the area of the input visible from a given point in
space.
- getMatrix() - Method in class micycle.pgs.commons.MinimumBoundingEllipse
-
Returns a matrix containing all the information regarding the shape of the
ellipsoid.
- getMesh() - Method in class micycle.pgs.commons.IncrementalTinDual
-
Generate mesh of polygonal dual faces.
- getMesh() - Method in class micycle.pgs.commons.PMesh
-
Returns a PShape object representing the smoothed mesh, with vertices moved
to their smoothed positions.
- getPacking() - Method in class micycle.pgs.commons.RepulsionCirclePack
-
- getPoints() - Method in class micycle.pgs.commons.PoissonDistribution
-
Deprecated.
- getPoints() - Method in class micycle.pgs.commons.PoissonDistributionJRUS
-
Returns the point set generated by most recent call to
generate().
- getPolygonInteriorSegments(List<PEdge>, PShape) - Static method in class micycle.pgs.PGS_SegmentSet
-
Retains line segments from a set of line segments that are wholly contained
within a given shape.
- getQuadrangulationEdges() - Method in class micycle.pgs.commons.SpiralQuadrangulation
-
- getSkeleton(float, float) - Method in class micycle.pgs.commons.RandomSpaceFillingCurve
-
- getTiling(long) - Method in class micycle.pgs.commons.HatchTiling
-
- getTiling() - Method in class micycle.pgs.commons.HatchTiling
-
- getTiling() - Method in class micycle.pgs.commons.SquareTriangleTiling
-
- getTiling(long) - Method in class micycle.pgs.commons.SquareTriangleTiling
-
- getTriangle() - Method in class micycle.pgs.commons.MinimumBoundingTriangle
-
Gets a geometry which represents the Minimium Bounding Triangle.
- getTriangles() - Method in class micycle.pgs.commons.PenroseTiling
-
Returns raw triangles from the penrose tiling.
- graphMatchedSegments(double, double, int, long) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates N non-intersecting segments via a Perfect matching algorithm
applied to a triangulation populated with random points.
- graphMatchedSegments(List<PVector>) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates non-intersecting segments via a Perfect matching algorithm
applied to a triangulation populated with the given points.
- graphMatchedSegments(IIncrementalTin) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates non-intersecting segments via a Perfect matching algorithm
applied to the given triangulation.
- IncrementalTinDual - Class in micycle.pgs.commons
-
Produces a (barycentric) dual graph from a TinFour Delaunay Triangulation.
- IncrementalTinDual(IIncrementalTin) - Constructor for class micycle.pgs.commons.IncrementalTinDual
-
- IncrementalTinDual.DualEdge - Class in micycle.pgs.commons
-
- innerVoronoi(PShape, boolean) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram for a single shape, where shape vertices are
voronoi point sites.
- innerVoronoi(PShape, int) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates an inner Voronoi diagram of a given shape with a specified number
of relaxations.
- innerVoronoi(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates an inner Voronoi diagram of a given shape with additional sites.
- innerVoronoi(PShape, Collection<PVector>, int) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates an inner Voronoi diagram of a given shape with additional sites and
relaxation.
- innerVoronoi(PShape, boolean, double[], Collection<PVector>, int) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram of a given shape, where shape vertices are
voronoi point sites.
- innerVoronoi(Collection<PVector>) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram for a set of points.
- innerVoronoi(Collection<PVector>, int) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram for a set of points, with relaxation.
- innerVoronoi(Collection<PVector>, double[], int) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a boundary-constrained Voronoi diagram for a set of points, with
relaxation.
- innerVoronoi(Collection<PVector>, double[]) - Static method in class micycle.pgs.PGS_Voronoi
-
Generates a Voronoi diagram for a set of points.
- interpolate(PShape, PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Generates an intermediate shape between two shapes by interpolating between
them.
- interpolate(PShape, PShape, int) - Static method in class micycle.pgs.PGS_Morphology
-
Generates intermediate shapes (frames) between two shapes by interpolating
between them.
- intersect(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Calculates the intersection of two shapes, producing a new shape representing
the shared area.
- intersect(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether the shapes intersect/overlap (meaning that have at least
one point in common).
- intersectMesh(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Performs an intersection operation between a mesh-like shape (a polygonal
coverage) and a polygonal area, while preserving the individual features of
the mesh during the operation.
- isConformingMesh(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether a GROUP shape forms a conforming mesh / valid polygon
coverage.
- isConvex(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether a shape is convex.
- islamicTiling(double, double, double, double) - Static method in class micycle.pgs.PGS_Tiling
-
Generates an "islamic-style" (Girih) tiling of the plane.
- isolines(PShape, PVector, double) - Static method in class micycle.pgs.PGS_Contour
-
Generates a topographic-like isoline contour map from the shape's vertices.
- isolines(Collection<PVector>, double, double, double) - Static method in class micycle.pgs.PGS_Contour
-
Generates a topographic-like isoline contour map from the given points.
- isolines(Collection<PVector>, double, double, double, int) - Static method in class micycle.pgs.PGS_Contour
-
Generates a topographic-like isoline contour map from the given points.
- isSimple(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Checks whether a shape is simple.
- isValid(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Checks if a PShape is valid, and reports the validation error if it is
invalid.
- MaximumInscribedAARectangle - Class in micycle.pgs.commons
-
Computes the largest inscribed axis-aligned rectangle within a convex hull.
- MaximumInscribedAARectangle(Geometry, double) - Constructor for class micycle.pgs.commons.MaximumInscribedAARectangle
-
- maximumInscribedAARectangle(PShape, boolean) - Static method in class micycle.pgs.PGS_Optimisation
-
Finds the rectangle with a maximum area whose sides are parallel to the
x-axis and y-axis ("axis-aligned"), contained/insribed within a convex shape.
- maximumInscribedCircle(PShape, double) - Static method in class micycle.pgs.PGS_Optimisation
-
The Maximum Inscribed Circle is determined by a point in the interior of the
area which has the farthest distance from the area boundary, along with a
boundary point at that distance.
- maximumInscribedCircle(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
Return the maximum circle (at a given centerpoint inside/outside the circle)
- maximumInscribedPack(PShape, int, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
Packs a specified number of maximum inscribed circles within the given shape
using the Largest Empty Circle (LEC) algorithm.
- maximumInscribedPack(PShape, double, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
Packs maximum inscribed circles within the given shape using the Largest
Empty Circle (LEC) algorithm.
- MaximumInscribedRectangle - Class in micycle.pgs.commons
-
Finds an approximate largest area rectangle of arbitrary orientation in a
polygon via particle swarm optimisation.
- MaximumInscribedRectangle(Polygon) - Constructor for class micycle.pgs.commons.MaximumInscribedRectangle
-
- maximumInscribedRectangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Finds an approximate largest area rectangle (of arbitrary orientation)
contained within a polygon.
- maximumInteriorAngle(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Computes the maximum/largest interior angle of a polygon.
- maximumPerimeterSquare(PShape, double) - Static method in class micycle.pgs.PGS_Optimisation
-
Finds the largest area perimeter square of the input.
- medialAxis(PShape, double, double, double) - Static method in class micycle.pgs.PGS_Contour
-
Computes the medial axis of the given shape, providing a characterization of
the skeleton of a shape.
- median(Point4d[], double, int) - Static method in class micycle.pgs.commons.GeometricMedian
-
Computes the median point of the input point set.
- median(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Computes the geometric median location of a shape's vertices.
- micycle.pgs - package micycle.pgs
-
Processing Geometry Suite is a software project that provides easy access to
geometric algorithms in the form of a Processing library.
- micycle.pgs.commons - 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).
- midpoint() - Method in class micycle.pgs.commons.PEdge
-
- minimumAreaRectangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the minimum-area rectangle that encloses a shape.
- minimumBoundingCircle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the Minimum Bounding Circle (MBC) for the points in a Geometry.
- MinimumBoundingEllipse - Class in micycle.pgs.commons
-
Minimum Volume Enclosing Ellipsoid
- MinimumBoundingEllipse(double[][], double) - Constructor for class micycle.pgs.commons.MinimumBoundingEllipse
-
Khachiyan’s Algorithm for the Computation of Minimum Volume Enclosing
Ellipsoids.
- minimumBoundingEllipse(PShape, double) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the minimum bounding ellipse that encloses a shape.
- MinimumBoundingTriangle - Class in micycle.pgs.commons
-
Computes the Minimum Bounding Triangle (MBT) for the points in a Geometry.
- MinimumBoundingTriangle(Geometry) - Constructor for class micycle.pgs.commons.MinimumBoundingTriangle
-
Creates a new instance of a Maximum Inscribed Triangle computation.
- minimumBoundingTriangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the minimum-area bounding triangle that encloses a shape.
- minimumDiameter(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the minimum diameter of a shape.
- minimumSpanningTree(List<PVector>) - Static method in class micycle.pgs.PGS_PointSet
-
Computes the Euclidean minimum spanning tree (EMST) of a set of
points.
- minimumWidthRectangle(PShape) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes the minimum-width bounding rectangle that encloses a shape.
- minkDifference(PShape, PShape) - Static method in class micycle.pgs.PGS_Morphology
-
Computes a Minkowski difference (a.k.a erosion) of the two source
shapes.
- minkSum(PShape, PShape) - Static method in class micycle.pgs.PGS_Morphology
-
Computes a Minkowski sum (a.k.a dilation) of the two source shapes.
- pack() - Method in class micycle.pgs.commons.TangencyPack
-
Computes and returns a circle packing for the configuration of tangencies
given by the triangulation.
- parallelSegments(double, double, double, double, double, int) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates a set of N straight parallel segments, centered on a given point.
- PEdge - Class in micycle.pgs.commons
-
An undirected edge / line segment joining 2 PVectors.
- PEdge(PVector, PVector) - Constructor for class micycle.pgs.commons.PEdge
-
- PEdge(double, double, double, double) - Constructor for class micycle.pgs.commons.PEdge
-
- PenroseTiling - Class in micycle.pgs.commons
-
Generates a Penrose tiling of the plane.
- PenroseTiling(double, double, double, int) - Constructor for class micycle.pgs.commons.PenroseTiling
-
- penroseTiling(double, double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
Generates a Penrose Tiling (consisting of rhombi).
- PGS_CirclePacking - Class in micycle.pgs
-
Circle packings of shapes, subject to varying constraints and patterns of
tangencies.
- PGS_Coloring - Class in micycle.pgs
-
This class provides methods to color meshes and mesh-like shapes.
- PGS_Coloring.ColoringAlgorithm - Enum in micycle.pgs
-
Specifies the algorithm/heuristic used by the underlying graph coloring
process to find a coloring for mesh faces.
- PGS_Construction - Class in micycle.pgs
-
Construct uncommon/interesting 2D geometries.
- PGS_Construction.SierpinskiTriCurveType - Enum in micycle.pgs
-
- PGS_Contour - Class in micycle.pgs
-
Methods for producing different kinds of shape contours.
- PGS_Contour.OffsetStyle - Enum in micycle.pgs
-
Specifies the join style for offset curves.
- PGS_Conversion - Class in micycle.pgs
-
Facilitates conversion between Processing's PShapes and
JTS's Geometries, along with various other formats.
- PGS_Hull - Class in micycle.pgs
-
Convex and concave hulls (amongst other variations) of polygons and point
sets.
- PGS_Meshing - Class in micycle.pgs
-
Mesh generation (excluding triangulation) and processing.
- PGS_Morphology - Class in micycle.pgs
-
Methods that affect the geometry or topology of shapes.
- PGS_Optimisation - Class in micycle.pgs
-
Solve geometric optimisation problems, such as bounding volumes, inscribed
areas, optimal distances, etc.
- PGS_Optimisation.RectPackHeuristic - Enum in micycle.pgs
-
- PGS_PointSet - Class in micycle.pgs
-
Generation of random sets of 2D points having a variety of different
distributions and constraints (and associated functions).
- PGS_Processing - Class in micycle.pgs
-
Geometry Processing -- methods that process a shape in some way: compute
hulls, partition, slice, etc.
- PGS_SegmentSet - Class in micycle.pgs
-
Generation of random sets of non-intersecting line segments (and
associated functions).
- PGS_ShapeBoolean - Class in micycle.pgs
-
Boolean set-operations for 2D shapes.
- PGS_ShapePredicates - Class in micycle.pgs
-
Various shape metrics, predicates and descriptors.
- PGS_Tiling - Class in micycle.pgs
-
Tiling, tessellation and subdivision of the plane using periodic or
non-periodic geometric shapes.
- PGS_Transformation - Class in micycle.pgs
-
Various geometric and affine transformations for PShapes that affect vertex
coordinates.
- PGS_Triangulation - Class in micycle.pgs
-
Delaunay and earcut triangulation of shapes and point sets.
- PGS_Voronoi - Class in micycle.pgs
-
Voronoi Diagrams of shapes and point sets.
- phyllotaxis(double, double, int, double) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of points arranged in a phyllotaxis pattern (an arrangement
similar to the florets in the head of a sunflower), using the golden ratio
(the most irrational number) to position points with the least possible
aliasing (which is arguably the "best" arrangement).
- phyllotaxis(double, double, int, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of points arranged in a phyllotaxis pattern (an arrangement
similar to the florets in the head of a sunflower), using a user-defined
theta.
- plasticJitteredLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of deterministic stratified points (bounded by a rectangle)
from a low discrepancy sequence (LDS) based on an irrational number.
- plasticJitteredLDS(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of deterministic stratified points (bounded by a rectangle)
from a low discrepancy sequence (LDS) based on an irrational number.
- plasticLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of deterministic stratified points (bounded by a rectangle)
from a low discrepancy sequence (LDS) based on an irrational number (the
plastic constant).
- PMesh - Class in micycle.pgs.commons
-
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.
- PMesh(PShape) - Constructor for class micycle.pgs.commons.PMesh
-
- pointOnExterior(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
Extracts a point from the perimeter (exterior) of the given shape at a
specific position along its perimeter.
- pointOnExteriorByDistance(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
Extracts a point from the perimeter (exterior) of the given shape at some
distance along its perimeter.
- pointsOnExterior(PShape, int, double) - Static method in class micycle.pgs.PGS_Processing
-
Efficiently extracts multiple points from the perimeter of a shape, evenly
distributed along its boundary.
- pointsOnExterior(PShape, double, double) - Static method in class micycle.pgs.PGS_Processing
-
Generates a list of points that lie on the exterior/perimeter of the given
shape.
- poisson(double, double, double, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of random points (constrained within a rectangular region)
via Poisson Disk Sampling.
- poisson(double, double, double, double, double, long) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of random points (constrained within a rectangular region)
via Poisson Disk Sampling, using the specified seed.
- PoissonDistribution - Class in micycle.pgs.commons
-
- PoissonDistribution() - Constructor for class micycle.pgs.commons.PoissonDistribution
-
Deprecated.
- PoissonDistribution(long) - Constructor for class micycle.pgs.commons.PoissonDistribution
-
Deprecated.
- PoissonDistributionJRUS - Class in micycle.pgs.commons
-
Generates sets of random points via Poisson Disk Sampling.
- PoissonDistributionJRUS() - Constructor for class micycle.pgs.commons.PoissonDistributionJRUS
-
- PoissonDistributionJRUS(long) - Constructor for class micycle.pgs.commons.PoissonDistributionJRUS
-
- poissonN(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a poisson point set having N points constrained within a
rectangular region.
- poissonTriangulation(PShape, double) - Static method in class micycle.pgs.PGS_Triangulation
-
Creates a Delaunay triangulation of the shape where additional steiner
points, populated by poisson sampling, are included.
- poissonTriangulationMesh(PShape, double) - Static method in class micycle.pgs.PGS_Triangulation
-
Creates a Delaunay triangulation of the shape where additional steiner
points, populated by poisson sampling, are included.
- poissonTriangulationPoints(PShape, double) - Static method in class micycle.pgs.PGS_Triangulation
-
Creates a Delaunay triangulation of the shape where additional steiner
points, populated by poisson sampling, are included.
- PolygonDecomposition - Class in micycle.pgs.commons
-
Implementation of the Bayazit convex decomposition algorithm for simple
polygons.
- polygonize(Collection<PEdge>) - Static method in class micycle.pgs.commons.FastPolygonizer
-
Polygonizes a set of edges which represent linework that forms some polygonal
arrangement (a planar graph).
- polygonizeLines(List<PVector>) - Static method in class micycle.pgs.PGS_Processing
-
Finds the polygonal faces formed by a set of intersecting line segments.
- PRESERVE_STYLE - Static variable in class micycle.pgs.PGS_Conversion
-
A boolean flag that affects whether a PShape's style (fillColor, strokeColor,
strokeWidth) is preserved during PShape->Geometry->PShape
conversion (i.e.
- process(LineString) - Method in class micycle.pgs.commons.DiscreteCurveEvolution
-
- process(Coordinate[]) - Method in class micycle.pgs.commons.DiscreteCurveEvolution
-
Processes an array of coordinates and applies the Discrete Curve Evolution
algorithm.
- ProcrustesAlignment - Class in micycle.pgs.commons
-
The ProcrustesAlignment class provides methods for performing
ProcrustesAlignment analysis, which is a technique for aligning and comparing
geometric shapes.
- prunePointsWithinDistance(List<PVector>, double) - Static method in class micycle.pgs.PGS_PointSet
-
Returns a filtered copy of the input, containing no points that are within
the distanceTolerance of each other.
- radialWarp(PShape, double, double, boolean) - Static method in class micycle.pgs.PGS_Morphology
-
Distorts a polygonal shape by radially displacing its vertices along the line
connecting each vertex with the shape's centroid, creating a warping or
perturbing effect.
- random(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of random (uniform) points that lie within a bounding
rectangle.
- random(double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of random (uniform) points that lie within a bounding
rectangle, using the specified seed.
- RandomPolygon - Class in micycle.pgs.commons
-
Random Convex Polygons
- RandomSpaceFillingCurve - Class in micycle.pgs.commons
-
Generates random space-filling curves.
- RandomSpaceFillingCurve(int, int) - Constructor for class micycle.pgs.commons.RandomSpaceFillingCurve
-
Instantiates a random space-filling curve.
- RandomSpaceFillingCurve(int, int, long) - Constructor for class micycle.pgs.commons.RandomSpaceFillingCurve
-
Instantiates a random space-filling curve, having a given random seed.
- RectangularSubdivision - Class in micycle.pgs.commons
-
Random rectangle subdivision.
- RectangularSubdivision(double, double, long) - Constructor for class micycle.pgs.commons.RectangularSubdivision
-
- RectangularSubdivision(double, double, int, long) - Constructor for class micycle.pgs.commons.RectangularSubdivision
-
- rectPack(List<PVector>, int, int, PGS_Optimisation.RectPackHeuristic) - Static method in class micycle.pgs.PGS_Optimisation
-
Packs a collection of rectangles, according to the given packing heuristic,
into rectangular 2D bin(s).
- rectSubdivision(double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
Recursively and randomly subdivides the given/bounded plane into rectangles.
- rectSubdivision(double, double, int, long) - Static method in class micycle.pgs.PGS_Tiling
-
Recursively and randomly subdivides the given/bounded plane into rectangles.
- reducePrecision(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Reduces the precision of a shape, whilst ensuring the output shape is valid.
- relativeNeighborFaces(IIncrementalTin, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Generates a shape consisting of polygonal faces of a Relative neighborhood
graph (RNG).
- removeHiddenLines(PShape) - Static method in class micycle.pgs.PGS_Processing
-
Removes overlap between polygons contained in a GROUP shape,
preserving only visible line segments suitable for pen plotting and similar
applications.
- removeSmallHoles(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
Returns a copy of the shape where holes having an area less than the
specified threshold are removed.
- reorderChildren(PShape, Comparator<PShape>) - Static method in class micycle.pgs.PGS_Conversion
-
Reorders the child shapes of a given shape.
- RepulsionCirclePack - Class in micycle.pgs.commons
-
Repulsion Packing attempts to arrange a set of circles of specified radii
within a rectangle such that there is no-overlap between circles.
- RepulsionCirclePack(List<PVector>, double, double, double, double, boolean) - Constructor for class micycle.pgs.commons.RepulsionCirclePack
-
- repulsionPack(PShape, double, double, long) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a random circle packing of circles with varying radii that overlap
the given shape.
- repulsionPack(PShape, List<PVector>) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a circle packing of a shape using a given collection of
(overlapping) circles.
- resize(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Resizes a shape (based on its envelope) to the given dimensions, relative to
its center point.
- resizeByHeight(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Resizes a shape (based on its envelope) to the given height relative to its
center point; the width is resized accordingly to maintain the shape's aspect
ratio.
- resizeByMajorAxis(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Resizes a shape (based on the longest axis of its envelope) to the given size
relative to its center point.
- resizeByWidth(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Resizes a shape (based on its envelope) to the given width relative to its
center point; the height is resized accordingly to maintain the shape's
aspect ratio.
- ring(double, double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of n points that are randomly distributed on a ring
(annulus).
- ring(double, double, double, double, double, int, long) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a set of points that are randomly distributed on a ring (annulus).
- RLFColoring<V,E> - Class in micycle.pgs.commons
-
The Recursive Largest First (RLF) algorithm for graph coloring.
- RLFColoring(Graph<V, E>) - Constructor for class micycle.pgs.commons.RLFColoring
-
- RLFColoring(Graph<V, E>, long) - Constructor for class micycle.pgs.commons.RLFColoring
-
- rotate(PShape, PVector, double) - Static method in class micycle.pgs.PGS_Transformation
-
Rotates a shape around a given point.
- rotateAroundCenter(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Rotates a shape around its centroid.
- round(PShape, double) - Static method in class micycle.pgs.commons.CornerRounding
-
- round() - Method in class micycle.pgs.commons.PEdge
-
Rounds (mutates) the vertex coordinates of this PEdge to their closest ints.
- round(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Modifies the corners of a specified shape by replacing each angular corner
with a smooth, circular arc.
- roundVertexCoords(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Rounds the x and y coordinates (to the closest int) of all vertices belonging
to the shape, mutating the shape.
- scale(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Scales the dimensions of the shape by a scaling factor relative to its center
point.
- scale(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Scales the shape relative to its center point.
- scaleArea(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Scales the area of a given shape by a specified scale factor.
- scaleAreaTo(PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Scales the given PShape to the target area, relative to its center point.
- SeededRandomPointsInGridBuilder - Class in micycle.pgs.commons
-
An extension to the
RandomPointsInGridBuilder class that accepts a random seed for repeatable
outputs.
- SeededRandomPointsInGridBuilder(long) - Constructor for class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
Create a builder which will create shapes using the default
GeometryFactory.
- SeededRandomPointsInGridBuilder(long, GeometryFactory) - Constructor for class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
Create a builder which will create shapes using the given
GeometryFactory.
- setAllFillColor(PShape, int) - Static method in class micycle.pgs.PGS_Conversion
-
Sets the fill color for the PShape and all of its children recursively (and
disables stroke).
- setAllStrokeColor(PShape, int, double) - Static method in class micycle.pgs.PGS_Conversion
-
Sets the stroke color for the PShape and all of its children recursively.
- setAllStrokeToFillColor(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Sets the stroke color equal to the fill color for the PShape and all of its
descendent shapes individually (that is, each child shape belonging to the
shape (if any) will have its stroke color set to its own fill color,
and not the parent-most shape's fill color).
- setAllStrokeToFillColor(PShape, double) - Static method in class micycle.pgs.PGS_Conversion
-
Sets the stroke color equal to the fill color, and the strokeWeight to the
specified value, for the PShape and all of its descendent shapes individually
(that is, each child shape belonging to the shape (if any) will have its
stroke color set to its own fill color, and not the parent-most
shape's fill color).
- setConstrainedToCircle(boolean) - Method in class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
Sets whether generated points are constrained to lie within a circle
contained within each grid cell.
- setEpsilon(double) - Method in class micycle.pgs.commons.VisibilityPolygon
-
- setGutterFraction(double) - Method in class micycle.pgs.commons.SeededRandomPointsInGridBuilder
-
Sets the fraction of the grid cell side which will be treated as a gutter, in
which no points will be created.
- setNumPoints(int) - Method in class micycle.pgs.commons.VisibilityPolygon
-
- ShapeInterpolation - Class in micycle.pgs.commons
-
Best-guess interpolation between any two linear rings.
- ShapeInterpolation(Geometry, Geometry) - Constructor for class micycle.pgs.commons.ShapeInterpolation
-
- ShapeInterpolation(LinearRing, LinearRing) - Constructor for class micycle.pgs.commons.ShapeInterpolation
-
- shapeIntersection(PShape, PShape) - Static method in class micycle.pgs.PGS_Processing
-
Computes all points of intersection between the perimeters of
two shapes.
- shear(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Shears a given shape by specified angles along the x and y axis and returns
the result as a new PShape.
- similarity(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Measures the degree of similarity between two shapes using the Hausdorff
distance metric.
- simpleSubtract(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Subtracts holes from the shell, without geometric
processing.
- simplify(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Simplifies a shape using the Douglas-Peucker algorithm, reducing the
complexity and number of vertices of the shape.
- simplifyDCE(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Simplifies a shape via Discrete Curve Evolution.
- simplifyDCE(PShape, int) - Static method in class micycle.pgs.PGS_Morphology
-
Simplifies a shape via Discrete Curve Evolution.
- simplifyHobby(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
- simplifyMesh(PShape, double, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Simplifies the boundaries of the faces in a mesh while preserving the
original mesh topology.
- simplifyTopology(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Simplifies a shape, whilst preserving the topological structure of the shape
(holes, etc.).
- simplifyVW(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Simplifies a shape using the Visvalingam-Whyatt area-based algorithm,
reducing the complexity and number of vertices of the shape.
- sineWarp(PShape, double, double, double) - Static method in class micycle.pgs.PGS_Morphology
-
Warps/perturbs a shape by displacing vertices (both positively and
negatively) according to the magnitude of a sine wave which follows the shape
perimeter at some frequency.
- slice(double, double) - Method in class micycle.pgs.commons.PEdge
-
Calculates the subsection of this PEdge as a new PEdge.
- slice(PShape, PVector, PVector) - Static method in class micycle.pgs.PGS_Processing
-
Slices a shape using a line given by its start and endpoints.
- smooth(boolean) - Method in class micycle.pgs.commons.PMesh
-
Performs one pass of simple laplacian smoothing on the mesh.
- smooth(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Smoothes a shape.
- smoothEllipticFourier(PShape, int) - Static method in class micycle.pgs.PGS_Morphology
-
Calculates the Elliptic Fourier Descriptors (EFD) of a specified shape,
yielding a simplified/smoothed shape representation based on the specified
number of descriptors.
- smoothGaussian(PShape, double) - Static method in class micycle.pgs.PGS_Morphology
-
Smoothes a shape by applying a gaussian filter to vertex coordinates.
- smoothMesh(PShape, int, boolean, double, double) - Static method in class micycle.pgs.PGS_Meshing
-
Smoothes a mesh via iterative weighted Laplacian smoothing.
- smoothMesh(PShape, double, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Smoothes a mesh via iterative weighted Laplacian smoothing.
- smoothTaubin(double, double, boolean) - Method in class micycle.pgs.commons.PMesh
-
Performs a single pass of Taubin smoothing.
- smoothWeighted(boolean) - Method in class micycle.pgs.commons.PMesh
-
Performs one pass of weighted laplacian smoothing on the mesh.
- snapHull(PShape, double) - Static method in class micycle.pgs.PGS_Hull
-
Computes a hull, having a variable level of convexity, of a shape.
- sobolLDS(double, double, double, double, int) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a 2D set of deterministic stratified points (bounded by a
rectangle) from the Sobol low discrepancy sequence (LDS).
- solveApollonius(PVector, PVector, PVector, int, int, int) - Static method in class micycle.pgs.PGS_Optimisation
-
Solves the Problem of Apollonius (finding a circle tangent to three other
circles in the plane).
- spannerFaces(IIncrementalTin, int, boolean) - Static method in class micycle.pgs.PGS_Meshing
-
Generates a shape consisting of polygonal faces formed by edges returned by a
greedy sparse spanner applied to a triangulation.
- sphericity(PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Measures the sphericity of a shape; the ratio of the maximum inscribed circle
to the minimum bounding circle.
- SpiralQuadrangulation - Class in micycle.pgs.commons
-
Quadrangulations of Planar Point Sets via the Spiraling Rotating Calipers
Algorithm.
- SpiralQuadrangulation(List<PVector>) - Constructor for class micycle.pgs.commons.SpiralQuadrangulation
-
Instantiates a Spiral Quadrangulation.
- spiralQuadrangulation(List<PVector>) - Static method in class micycle.pgs.PGS_Meshing
-
Produces a quadrangulation from a point set.
- split(PShape) - Static method in class micycle.pgs.PGS_Processing
-
Splits a shape into four equal quadrants (based on the envelope of the
shape).
- split(PShape, int) - Static method in class micycle.pgs.PGS_Processing
-
Splits a shape into 4^(1+recursions) rectangular partitions.
- splitEdges(PShape, int) - Static method in class micycle.pgs.PGS_Meshing
-
Splits each edge of a given mesh shape into a specified number of
equal-length parts and creates a new shape from the resulting smaller edges.
- splitQuadrangulation(IIncrementalTin) - Static method in class micycle.pgs.PGS_Meshing
-
Produces a quadrangulation from a triangulation, by splitting each triangle
into three quadrangles (using the Catmull and Clark technique).
- squareGrid(double, double, double, double, double) - Static method in class micycle.pgs.PGS_PointSet
-
Generates a square grid/lattice of points that lie within a bounding
rectangle.
- squareLatticePack(PShape, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a tiled circle packing consisting of equal-sized circles arranged
in a square lattice (or grid) bounded by the input shape.
- SquareTriangleTiling - Class in micycle.pgs.commons
-
A non-periodic (quasiperiodic?) tiling, comprising squares and equilateral
triangles.
- SquareTriangleTiling(double, double, double) - Constructor for class micycle.pgs.commons.SquareTriangleTiling
-
- squareTriangleTiling(double, double, double) - Static method in class micycle.pgs.PGS_Tiling
-
Generates a non-periodic tiling, comprising squares and equilateral
triangles.
- squareTriangleTiling(double, double, double, long) - Static method in class micycle.pgs.PGS_Tiling
-
Generates a non-periodic tiling, comprising squares and equilateral
triangles, having a given seed.
- Star - Class in micycle.pgs.commons
-
Methods to create star shapes
- stochasticMerge(PShape, int, long) - Static method in class micycle.pgs.PGS_Meshing
-
Randomly merges together / dissolves adjacent faces of a mesh.
- stochasticPack(PShape, int, double, boolean) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a random circle packing of the input shape by generating random
points one-by-one and calculating the maximum radius a circle at each point
can have (such that it's tangent to its nearest circle or a shape vertex).
- stochasticPack(PShape, int, double, boolean, long) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a seeded random circle packing within the input shape.
- stochasticSegments(double, double, int) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates a set of N random non-intersecting line segments via brute-forcing.
- stochasticSegments(double, double, int, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates a set of N random non-intersecting line segments of the given
length via brute-forcing.
- stochasticSegments(double, double, int, double, double, long) - Static method in class micycle.pgs.PGS_SegmentSet
-
Generates a set of N random non-intersecting line segments via brute-forcing.
- straightSkeleton(PShape) - Static method in class micycle.pgs.PGS_Contour
-
Computes the straight skeleton for a shape.
- stretch(List<PEdge>, double) - Static method in class micycle.pgs.PGS_SegmentSet
-
Stretches each PEdge segment in the provided list by a specified factor.
- subdivideMesh(PShape, double) - Static method in class micycle.pgs.PGS_Meshing
-
Subdivides the faces of a mesh using the Catmull-Clark split approach,
wherein each face is divided into N parts, where N is the number of vertices
in the shape.
- subtract(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Subtracts one shape (b) from another shape (a) and returns the resulting
shape.
- subtractMesh(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Subtracts a polygonal area from a mesh-like shape or polygonal coverage,
ensuring each individual face or feature of the mesh is preserved during the
operation.
- symDifference(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapeBoolean
-
Calculates the symmetric difference between two shapes.
- TangencyPack - Class in micycle.pgs.commons
-
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.
- TangencyPack(IIncrementalTin, double) - Constructor for class micycle.pgs.commons.TangencyPack
-
Creates a circle packing using tangancies specified by a triangulation.
- TangencyPack(IIncrementalTin, List<Double>) - Constructor for class micycle.pgs.commons.TangencyPack
-
Creates a circle packing using tangancies specified by a triangulation.
- TangencyPack(IIncrementalTin, double[]) - Constructor for class micycle.pgs.commons.TangencyPack
-
Creates a circle packing using tangancies specified by a triangulation.
- tangencyPack(IIncrementalTin, double) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a circle packing having a pattern of tangencies specified by a
triangulation.
- tangencyPack(IIncrementalTin, double[]) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a circle packing having a pattern of tangencies specified by a
triangulation.
- tangentAngle(PShape, double) - Static method in class micycle.pgs.PGS_Processing
-
Calculates the angle of the line tangent to the shape at a specific point on
its perimeter.
- toArray(PShape, boolean) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a simple PShape into an array of its coordinates.
- toCentroidDualGraph(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a mesh-like PShape into its centroid-based undirected dual-graph.
- toCircles(Collection<PVector>) - Static method in class micycle.pgs.PGS_Conversion
-
Creates a PShape having circle geometries representing a collection of
circles.
- toDualGraph(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a mesh-like PShape into its undirected, unweighted dual-graph.
- toDualGraph(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
Finds the dual-graph of a triangulation.
- toEncodedPolyline(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Writes a single holeless shape into the string representation of its
Google Encoded Polyline format.
- toGeoJSON(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Writes a shape into the string representation of its GeoJSON format.
- toGraph(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Transforms a given PShape into a simple graph representation.
- toGraph(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
Finds the graph equivalent to a triangulation.
- toHexWKB(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Writes a shape into the hexadecimal string representation of its
Well-Known Binary format.
- toJava2D(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Creates a Java2D/java.awt Shape representing a PShape.
- toPointsPShape(PVector...) - Static method in class micycle.pgs.PGS_Conversion
-
Transforms a variable arg list of points into a POINTS PShape.
- toPointsPShape(Collection<PVector>) - Static method in class micycle.pgs.PGS_Conversion
-
Transforms a list of points into a POINTS PShape.
- toPShape(Geometry) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a JTS Geometry into a corresponding PShape.
- toPShape(Collection<? extends Geometry>) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a collection of JTS Geometries into a corresponding GROUP PShape.
- toPShape(Collection<PEdge>) - Static method in class micycle.pgs.PGS_SegmentSet
-
Converts a collection of
PEdges into a
LINES shape.
- toPShape(Collection<PEdge>, Integer, Integer, Integer) - Static method in class micycle.pgs.PGS_SegmentSet
-
Converts a collection of
PEdges into a
LINES shape, having the (optional) styling provided.
- toPShape(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
Converts a triangulated mesh object to a PShape representing the
triangulation.
- toPVector(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Extracts the vertices of a PShape into a list of PVectors.
- toString() - Method in class micycle.pgs.commons.PEdge
-
- toTinfourGraph(IIncrementalTin) - Static method in class micycle.pgs.PGS_Triangulation
-
Finds the graph equivalent to a triangulation.
- touch(PShape, PShape) - Static method in class micycle.pgs.PGS_ShapePredicates
-
Determines whether the have at least one point in common, but where their
interiors do not intersect.
- touchScale(PShape, PShape, double) - Static method in class micycle.pgs.PGS_Transformation
-
Scales a shape (based on its centroid) so that it touches the boundary of
another shape.
- toWKB(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Writes a shape into Well-Known Binary format.
- toWKB(PShape, String) - Static method in class micycle.pgs.PGS_Conversion
-
Converts a shape into Well-Known Binary format and writes the bytes to
a file.
- toWKT(PShape) - Static method in class micycle.pgs.PGS_Conversion
-
Writes the Well-Known Text representation of a shape.
- transform(Polygon, Polygon) - Static method in class micycle.pgs.commons.ProcrustesAlignment
-
Performs ProcrustesAlignment Analysis to align two polygons.
- translate(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Translates a shape by the given coordinates.
- translateCentroidTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Translates a shape such that its centroid aligns with the specified
(x, y) coordinates.
- translateCornerTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Translates the given shape such that the upper-left corner of its bounding
box aligns with the specified (x, y) coordinates.
- translateEnvelopeTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
Translates a shape such that the centroid of its bounding box
is equivalent to the given coordinates.
- translateTo(PShape, double, double) - Static method in class micycle.pgs.PGS_Transformation
-
- translateToOrigin(PShape) - Static method in class micycle.pgs.PGS_Transformation
-
Translates the given shape such that the upper-left corner of its bounding
box aligns with the origin point (0, 0) of the Processing coordinate system.
- trapezoidPartition(PShape) - Static method in class micycle.pgs.PGS_Processing
-
Decomposes/partitions a shape into axis-aligned (stip-like) trazepoids.
- TriangleSubdivision - Class in micycle.pgs.commons
-
Balanced triangle subdivision.
- TriangleSubdivision(double, double, int, long) - Constructor for class micycle.pgs.commons.TriangleSubdivision
-
- triangleSubdivision(double, double, int) - Static method in class micycle.pgs.PGS_Tiling
-
Recursively and randomly subdivides the given/bounded plane into triangles.
- triangleSubdivision(double, double, int, long) - Static method in class micycle.pgs.PGS_Tiling
-
Recursively and randomly subdivides the given/bounded plane into triangles.
- trinscribedPack(PShape, int, int) - Static method in class micycle.pgs.PGS_CirclePacking
-
Generates a circle packing of the input shape, using the inscribed circles
(or incircles) of triangles from a triangulation of the shape.
- tween(double) - Method in class micycle.pgs.commons.ShapeInterpolation
-
- valueOf(String) - Static method in enum micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum micycle.pgs.PGS_Contour.OffsetStyle
-
Returns the enum constant of this type with the specified name.
- valueOf(String) - Static method in enum micycle.pgs.PGS_Optimisation.RectPackHeuristic
-
Returns the enum constant of this type with the specified name.
- values() - Static method in enum micycle.pgs.PGS_Coloring.ColoringAlgorithm
-
Returns an array containing the constants of this enum type, in
the order they are declared.
- values() - Static method in enum micycle.pgs.PGS_Construction.SierpinskiTriCurveType
-
Returns an array containing the constants of this enum type, in
the order they are declared.
- values() - Static method in enum micycle.pgs.PGS_Contour.OffsetStyle
-
Returns an array containing the constants of this enum type, in
the order they are declared.
- values() - Static method in enum micycle.pgs.PGS_Optimisation.RectPackHeuristic
-
Returns an array containing the constants of this enum type, in
the order they are declared.
- variableBuffer(PShape, double, double) - Static method in class micycle.pgs.PGS_Morphology
-
Buffers a shape with a varying buffer distance (interpolated between a start
distance and an end distance) along the shape's perimeter.
- vertexDuals - Variable in class micycle.pgs.commons.IncrementalTinDual
-
Maps triangulation vertices to their corresponding/surrounding face in the
dual graph.
- VisibilityPolygon - Class in micycle.pgs.commons
-
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.
- VisibilityPolygon(double) - Constructor for class micycle.pgs.commons.VisibilityPolygon
-
- VisibilityPolygon() - Constructor for class micycle.pgs.commons.VisibilityPolygon
-
- visibilityPolygon(PShape, PVector) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes a visibility polygon / isovist, the area visible from a given point
in a space, considering occlusions caused by obstacles.
- visibilityPolygon(PShape, Collection<PVector>) - Static method in class micycle.pgs.PGS_Optimisation
-
Computes a visibility polygon / isovist, the area visible from a set of given
points in space, considering occlusions caused by obstacles.