public BufferSubgraph() { finder = new RightmostEdgeFinder(); }
private int getRightmostSide(DirectedEdge de, int index) { int side = getRightmostSideOfSegment(de, index); if (side < 0) side = getRightmostSideOfSegment(de, index - 1); if (side < 0) { // reaching here can indicate that segment is horizontal //Assert.shouldNeverReachHere("problem with finding rightmost side of segment at " + de.getCoordinate()); // testing only minCoord = null; checkForRightmostCoordinate(de); } return side; }
/** * Creates the subgraph consisting of all edges reachable from this node. * Finds the edges in the graph and the rightmost coordinate. * * @param node a node to start the graph traversal from */ public void create(Node node) { addReachable(node); finder.findEdge(dirEdgeList); rightMostCoord = finder.getCoordinate(); }
if (! de.isForward()) continue; checkForRightmostCoordinate(de); findRightmostEdgeAtNode(); findRightmostEdgeAtVertex(); int rightmostSide = getRightmostSide(minDe, minIndex); if (rightmostSide == Position.LEFT) { orientedDe = minDe.getSym();
public void computeDepth(int outsideDepth) { clearVisitedEdges(); // find an outside edge to assign depth to DirectedEdge de = finder.getEdge(); Node n = de.getNode(); Label label = de.getLabel(); // right side of line returned by finder is on the outside de.setEdgeDepths(Position.RIGHT, outsideDepth); copySymDepths(de); //computeNodeDepth(n, de); computeDepths(de); }
if (! de.isForward()) continue; checkForRightmostCoordinate(de); findRightmostEdgeAtNode(); findRightmostEdgeAtVertex(); int rightmostSide = getRightmostSide(minDe, minIndex); if (rightmostSide == Position.LEFT) { orientedDe = minDe.getSym();
public void computeDepth(int outsideDepth) { clearVisitedEdges(); // find an outside edge to assign depth to DirectedEdge de = finder.getEdge(); Node n = de.getNode(); Label label = de.getLabel(); // right side of line returned by finder is on the outside de.setEdgeDepths(Position.RIGHT, outsideDepth); copySymDepths(de); //computeNodeDepth(n, de); computeDepths(de); }
/** * Creates the subgraph consisting of all edges reachable from this node. * Finds the edges in the graph and the rightmost coordinate. * * @param node a node to start the graph traversal from */ public void create(Node node) { addReachable(node); finder.findEdge(dirEdgeList); rightMostCoord = finder.getCoordinate(); }
private int getRightmostSide(DirectedEdge de, int index) { int side = getRightmostSideOfSegment(de, index); if (side < 0) side = getRightmostSideOfSegment(de, index - 1); if (side < 0) { // reaching here can indicate that segment is horizontal //Assert.shouldNeverReachHere("problem with finding rightmost side of segment at " + de.getCoordinate()); // testing only minCoord = null; checkForRightmostCoordinate(de); } return side; }
public BufferSubgraph() { finder = new RightmostEdgeFinder(); }