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

Entry in the priority queue for vertex removal. More...

Collaboration diagram for Aleph::VisvalingamWhyattSimplification::VWEntry:
[legend]

Public Member Functions

bool operator< (const VWEntry &o) const
 Comparison based on effective area.
 
bool operator> (const VWEntry &o) const
 Comparison based on effective area.
 

Public Attributes

size_t idx
 Index of the vertex in the polyline.
 
Geom_Number area
 Effective area of the triangle formed with its neighbors.
 

Detailed Description

Entry in the priority queue for vertex removal.

Definition at line 12580 of file geom_algorithms.H.

Member Function Documentation

◆ operator<()

bool Aleph::VisvalingamWhyattSimplification::VWEntry::operator< ( const VWEntry o) const
inline

Comparison based on effective area.

Definition at line 12586 of file geom_algorithms.H.

References area, and Aleph::divide_and_conquer_partition_dp().

◆ operator>()

bool Aleph::VisvalingamWhyattSimplification::VWEntry::operator> ( const VWEntry o) const
inline

Comparison based on effective area.

Definition at line 12588 of file geom_algorithms.H.

References area, and Aleph::divide_and_conquer_partition_dp().

Member Data Documentation

◆ area

Geom_Number Aleph::VisvalingamWhyattSimplification::VWEntry::area

Effective area of the triangle formed with its neighbors.

Definition at line 12583 of file geom_algorithms.H.

Referenced by operator<(), and operator>().

◆ idx

size_t Aleph::VisvalingamWhyattSimplification::VWEntry::idx

Index of the vertex in the polyline.

Definition at line 12582 of file geom_algorithms.H.


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