Struct LineArrangement 

pub struct LineArrangement {
    pub lines: Vec<Line2D>,
    pub vertices: Vec<ArrangementVertex>,
}

An arrangement of lines in the plane.

Stores the vertices (pairwise intersections) and adjacency information.

Fields

lines: Vec<Line2D>

The input lines.

vertices: Vec<ArrangementVertex>

All vertices of the arrangement (pairwise intersections).

Implementations

impl LineArrangement

pub fn build(lines: &[Line2D]) -> Self

Construct the arrangement from a set of lines.

Computes all O(n²) pairwise intersections, merging near-coincident ones.

pub fn num_vertices(&self) -> usize

Number of vertices (intersection points).

pub fn euler_face_count(&self) -> usize

By Euler’s formula V - E + F = 2, compute the number of faces (including the unbounded outer face) from V and E.

For n lines in general position: V = n(n-1)/2, E = n(n+1), F = n(n-1)/2 + n + 1.

pub fn vertices_on_line(&self, line_idx: usize) -> Vec<usize>

Sort the vertices along a given line by arc-length parameter.

Trait Implementations

impl Clone for LineArrangement

fn clone(&self) -> LineArrangement

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LineArrangement

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

Formats the value using the given formatter.

impl Default for LineArrangement

fn default() -> LineArrangement

Returns the “default value” for a type.