Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::SegmentArrangement::Result Struct Reference

The complete result of the segment arrangement computation. More...

#include <geom_algorithms.H>

Collaboration diagram for Aleph::SegmentArrangement::Result:
[legend]

Public Attributes

Array< Pointvertices
 Unique vertices (endpoints and intersection points).
 
Array< ArrEdgeedges
 Sub-segments forming the arrangement graph.
 
Array< ArrFacefaces
 Faces defined by the arrangement.
 

Detailed Description

The complete result of the segment arrangement computation.

Definition at line 10384 of file geom_algorithms.H.

Member Data Documentation

◆ edges

Array<ArrEdge> Aleph::SegmentArrangement::Result::edges

Sub-segments forming the arrangement graph.

Definition at line 10387 of file geom_algorithms.H.

◆ faces

Array<ArrFace> Aleph::SegmentArrangement::Result::faces

Faces defined by the arrangement.

Definition at line 10388 of file geom_algorithms.H.

◆ vertices

Array<Point> Aleph::SegmentArrangement::Result::vertices

Unique vertices (endpoints and intersection points).

Definition at line 10386 of file geom_algorithms.H.


The documentation for this struct was generated from the following file: