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

Detailed result of a segment-segment intersection test. More...

#include <geom_algorithms.H>

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

Public Member Functions

bool intersects () const noexcept
 Returns true if any intersection exists.
 

Public Attributes

Kind kind = Kind::NONE
 Type of intersection.
 
Point point = Point(0, 0)
 The intersection point (if kind is POINT).
 
Segment overlap = Segment(Point(0, 0), Point(0, 0))
 The overlap segment (if kind is OVERLAP).
 

Detailed Description

Detailed result of a segment-segment intersection test.

Definition at line 5588 of file geom_algorithms.H.

Member Function Documentation

◆ intersects()

bool Aleph::SegmentSegmentIntersection::Result::intersects ( ) const
inlinenoexcept

Returns true if any intersection exists.

Definition at line 5595 of file geom_algorithms.H.

References kind, and Aleph::SegmentSegmentIntersection::NONE.

Member Data Documentation

◆ kind

Kind Aleph::SegmentSegmentIntersection::Result::kind = Kind::NONE

Type of intersection.

Definition at line 5590 of file geom_algorithms.H.

Referenced by intersects(), Aleph::SegmentSegmentIntersection::operator()(), and print_case().

◆ overlap

Segment Aleph::SegmentSegmentIntersection::Result::overlap = Segment(Point(0, 0), Point(0, 0))

The overlap segment (if kind is OVERLAP).

Definition at line 5592 of file geom_algorithms.H.

Referenced by print_case().

◆ point

Point Aleph::SegmentSegmentIntersection::Result::point = Point(0, 0)

The intersection point (if kind is POINT).

Definition at line 5591 of file geom_algorithms.H.

Referenced by print_case().


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