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

Represents an edge in the Voronoi diagram. More...

#include <geom_algorithms.H>

Collaboration diagram for Aleph::VoronoiDiagramFromDelaunay::Edge:
[legend]

Public Attributes

size_t site_u
 Index of the first site sharing this edge.
 
size_t site_v
 Index of the second site sharing this edge.
 
Point src
 Source point of the edge.
 
Point tgt
 Target point of the edge (only if not unbounded).
 
bool unbounded
 True if the edge is an unbounded ray.
 
Point direction
 Direction vector for unbounded rays.
 

Detailed Description

Represents an edge in the Voronoi diagram.

Definition at line 3687 of file geom_algorithms.H.

Member Data Documentation

◆ direction

Point Aleph::VoronoiDiagramFromDelaunay::Edge::direction

Direction vector for unbounded rays.

Definition at line 3694 of file geom_algorithms.H.

◆ site_u

size_t Aleph::VoronoiDiagramFromDelaunay::Edge::site_u

Index of the first site sharing this edge.

Definition at line 3689 of file geom_algorithms.H.

◆ site_v

size_t Aleph::VoronoiDiagramFromDelaunay::Edge::site_v

Index of the second site sharing this edge.

Definition at line 3690 of file geom_algorithms.H.

◆ src

Point Aleph::VoronoiDiagramFromDelaunay::Edge::src

Source point of the edge.

Definition at line 3691 of file geom_algorithms.H.

◆ tgt

Point Aleph::VoronoiDiagramFromDelaunay::Edge::tgt

Target point of the edge (only if not unbounded).

Definition at line 3692 of file geom_algorithms.H.

◆ unbounded

bool Aleph::VoronoiDiagramFromDelaunay::Edge::unbounded

True if the edge is an unbounded ray.

Definition at line 3693 of file geom_algorithms.H.


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