Crate linesweeper

linesweeper: a robust sweep-line algorithm

This rust crate implements a “robust” version of the Bentley-Ottmann sweep-line algorithm, and uses it to provide various two-dimensional geometric primitives like boolean operations on sets. It is currently in a pre-alpha state.

Modules

• sweep
  The sweep-line implementation.
• topology
  Utilities for computing topological properties of closed polylines.

Structs

• Point
  A two-dimensional point.
• SegIdx
  An index into our segment arena.
• Segment
  A line segment, in sweep-line order.
• Segments
  An arena of line segments.

Enums

• BooleanOp
  Binary operations between sets.
• Error
  The input points were faulty.
• FillRule
  A fill rule tells us how to decide whether a point is “inside” a polyline.

Traits

• Float
  A trait for abstracting over the properties we need from numerical types.

Functions

• boolean_op
  Computes a boolean operation between two sets, each of which is described as a collection of closed polylines.