|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Represents an edge in the Voronoi diagram. More...
#include <geom_algorithms.H>
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. | |
Represents an edge in the Voronoi diagram.
Definition at line 3687 of file geom_algorithms.H.
| Point Aleph::VoronoiDiagramFromDelaunay::Edge::direction |
Direction vector for unbounded rays.
Definition at line 3694 of file geom_algorithms.H.
| size_t Aleph::VoronoiDiagramFromDelaunay::Edge::site_u |
Index of the first site sharing this edge.
Definition at line 3689 of file geom_algorithms.H.
| size_t Aleph::VoronoiDiagramFromDelaunay::Edge::site_v |
Index of the second site sharing this edge.
Definition at line 3690 of file geom_algorithms.H.
| Point Aleph::VoronoiDiagramFromDelaunay::Edge::src |
Source point of the edge.
Definition at line 3691 of file geom_algorithms.H.
| Point Aleph::VoronoiDiagramFromDelaunay::Edge::tgt |
Target point of the edge (only if not unbounded).
Definition at line 3692 of file geom_algorithms.H.
| bool Aleph::VoronoiDiagramFromDelaunay::Edge::unbounded |
True if the edge is an unbounded ray.
Definition at line 3693 of file geom_algorithms.H.