orx-shapes/org.openrndr.extra.shapes.arrangement/Arrangement

Arrangement

data class Arrangement(val shapes: List<ShapeProvider>, val maxIters: Int = 1000, val epsilon: Double? = null)(source)

Create an arrangement of a list of ShapeProvider objects, like Shapes or ShapeContours.

Constructors

constructor(shapes: List<ShapeProvider>, maxIters: Int = 1000, epsilon: Double? = null)

constructor(vararg shapes: ShapeProvider)

Properties

val boundaries: List<ShapeContour>

The outer boundary contours of each connected component.

val boundedFaces: List<BoundedFace>

val components: List<XHalfEdge>

A list containing an arbitrary half-edge for each connected component.

val cVertsMap: MutableMap<ShapeContour, MutableList<Pair<XVertex, Double>>>

Maps a contour to the vertices incident to it.

val edges: List<XEdge>

All edges of the arrangement.

val epsilon: Double?

Distance below which intersection points are considered to be the same vertex. When null it is derived from the size of the input, see vertexEpsilon.

val faces: MutableList<XFace>

All faces of the arrangement.

val halfEdges: List<XHalfEdge>

All half-edges of the arrangement.

val hEdgesMap: MutableMap<ShapeProvider, MutableList<XEdge>>

Maps a shape to the edges incident to it.

val hFacesMap: MutableMap<ShapeProvider, MutableList<XFace>>

Maps a shape to the faces that it is a superset of.

val holes: List<BoundedFace>

The bounded faces that are not a subset of any input shape.

val maxIters: Int

The maximum number of edges incident to a face, used to detect infinite loops so that an error is thrown instead.

val originFaces: List<BoundedFace>

The faces that are a subset of some input shape.

val shapes: List<ShapeProvider>

val unboundedFaces: List<XFace>

val vertexEpsilon: Double

The distance below which points are merged into a single vertex. Kartifex finds intersections with an absolute tolerance of 1e-5, so this never goes below that; otherwise it scales with the input.

val vertices: List<XVertex>

All vertices of the arrangement.