#include <ogdf/energybased/davidson_harel/UniformGrid.h>
|
void | computeCrossings (const List< edge > &, const node, const DPoint &) |
|
void | computeGridGeometry (const node, const DPoint &, DIntersectableRect &) const |
|
IPoint | computeGridPoint (const DPoint &dp) const |
|
DPoint | computeRealPoint (const IPoint &ip) const |
|
bool | crossingTest (const edge, const edge, const node, const DPoint &, const IPoint &) |
|
void | DoubleModifiedBresenham (const DPoint &, const DPoint &, SList< IPoint > &) const |
|
bool | isInt (double d) const |
|
void | ModifiedBresenham (const IPoint &, const IPoint &, SList< IPoint > &) const |
|
UniformGrid & | operator= (const UniformGrid &ug) |
|
Definition at line 47 of file UniformGrid.h.
◆ UniformGrid() [1/3]
◆ UniformGrid() [2/3]
◆ UniformGrid() [3/3]
◆ computeCrossings()
◆ computeGridGeometry()
◆ computeGridPoint()
IPoint ogdf::davidson_harel::UniformGrid::computeGridPoint |
( |
const DPoint & |
dp | ) |
const |
|
inlineprivate |
◆ computeRealPoint()
DPoint ogdf::davidson_harel::UniformGrid::computeRealPoint |
( |
const IPoint & |
ip | ) |
const |
|
inlineprivate |
◆ crossingTest()
◆ DoubleModifiedBresenham()
◆ isInt()
bool ogdf::davidson_harel::UniformGrid::isInt |
( |
double |
d | ) |
const |
|
inlineprivate |
◆ ModifiedBresenham()
◆ newGridNecessary()
◆ numberOfCrossings()
int ogdf::davidson_harel::UniformGrid::numberOfCrossings |
( |
| ) |
const |
|
inline |
◆ operator=()
◆ m_cells
◆ m_CellSize
double ogdf::davidson_harel::UniformGrid::m_CellSize |
|
private |
◆ m_crossings
◆ m_crossNum
int ogdf::davidson_harel::UniformGrid::m_crossNum |
|
private |
◆ m_edgeMultiplier
const double ogdf::davidson_harel::UniformGrid::m_edgeMultiplier |
|
staticprivate |
◆ m_epsilon
const double ogdf::davidson_harel::UniformGrid::m_epsilon |
|
staticprivate |
◆ m_graph
const Graph& ogdf::davidson_harel::UniformGrid::m_graph |
|
private |
◆ m_grid
◆ m_layout
The documentation for this class was generated from the following file: