Struct ArcArrangement

pub struct ArcArrangement { /* private fields */ }

The plane cut by several simple arc rings.

Built once, queried many times: Self::regions selects any set of faces by a predicate over ring membership and links them into regions, all over the same vertices.

Implementations

impl ArcArrangement

pub fn new( rings: &[ArcRing], tolerance: Tolerance, ) -> Result<Self, OverlayError>

Subdivide the plane by rings.

Each ring must pass validate_arc_ring and be simple; its winding does not matter (each is read as the region it encloses). Rings may cross, touch and share boundary pieces with each other.

Errors

Any validate_arc_ring refusal, with the ring’s own reason.

pub fn vertices(&self) -> &[Point2]

Distinct vertices, each an exact point rounded once.

pub fn edges(&self) -> &[ArrangementEdge]

Pieces of the subdivision.

pub fn ring_count(&self) -> usize

Number of input rings.

pub fn regions( &self, inside: impl Fn(&[bool]) -> bool, ) -> Result<Vec<ArrangementRegion>, OverlayError>

The regions where inside holds, as linked boundaries.

inside receives one flag per input ring (whether a point lies in that ring) and says whether the point belongs to the wanted set. A piece bounds the set exactly when inside differs across it; it is traversed so that the set lies on its left.

Errors

OverlayError::SelfIntersection if the boundary cannot be linked, which simple input rings cannot produce.

pub fn ring(&self, uses: &[EdgeUse]) -> ArcRing

A region boundary as an ArcRing over the rounded vertices.

Trait Implementations

impl Debug for ArcArrangement

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.