computeCrossings(const List< edge > &, const node, const DPoint &) | ogdf::davidson_harel::UniformGrid | private |
computeGridGeometry(const node, const DPoint &, DIntersectableRect &) const | ogdf::davidson_harel::UniformGrid | private |
computeGridPoint(const DPoint &dp) const | ogdf::davidson_harel::UniformGrid | inlineprivate |
computeRealPoint(const IPoint &ip) const | ogdf::davidson_harel::UniformGrid | inlineprivate |
crossingTest(const edge, const edge, const node, const DPoint &, const IPoint &) | ogdf::davidson_harel::UniformGrid | private |
DoubleModifiedBresenham(const DPoint &, const DPoint &, SList< IPoint > &) const | ogdf::davidson_harel::UniformGrid | private |
isInt(double d) const | ogdf::davidson_harel::UniformGrid | inlineprivate |
m_cells | ogdf::davidson_harel::UniformGrid | private |
m_CellSize | ogdf::davidson_harel::UniformGrid | private |
m_crossings | ogdf::davidson_harel::UniformGrid | private |
m_crossNum | ogdf::davidson_harel::UniformGrid | private |
m_edgeMultiplier | ogdf::davidson_harel::UniformGrid | privatestatic |
m_epsilon | ogdf::davidson_harel::UniformGrid | privatestatic |
m_graph | ogdf::davidson_harel::UniformGrid | private |
m_grid | ogdf::davidson_harel::UniformGrid | private |
m_layout | ogdf::davidson_harel::UniformGrid | private |
ModifiedBresenham(const IPoint &, const IPoint &, SList< IPoint > &) const | ogdf::davidson_harel::UniformGrid | private |
newGridNecessary(const node v, const DPoint &p) | ogdf::davidson_harel::UniformGrid | inline |
numberOfCrossings() const | ogdf::davidson_harel::UniformGrid | inline |
operator=(const UniformGrid &ug) | ogdf::davidson_harel::UniformGrid | private |
UniformGrid(const GraphAttributes &) | ogdf::davidson_harel::UniformGrid | explicit |
UniformGrid(const GraphAttributes &, const node, const DPoint &) | ogdf::davidson_harel::UniformGrid | |
UniformGrid(const UniformGrid &, const node, const DPoint &) | ogdf::davidson_harel::UniformGrid | |