class BufferSubgraph extends Comparable[BufferSubgraph]
A connected subset of the graph of {link DirectedEdge}s and {link Node}s. Its edges will generate either
- a single polygon in the complete buffer, with zero or more holes, or
- one or more connected holes
- Version
1.7
- Alphabetic
- By Inheritance
- BufferSubgraph
- Comparable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new BufferSubgraph()
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def compareTo(o: BufferSubgraph): Int
BufferSubgraphs are compared on the x-value of their rightmost Coordinate.
BufferSubgraphs are compared on the x-value of their rightmost Coordinate. This defines a partial ordering on the graphs such that:
g1 >= g2 <==> Ring(g2) does not contain Ring(g1)
where Polygon(g) is the buffer polygon that is built from g.
This relationship is used to sort the BufferSubgraphs so that shells are guaranteed to be built before holes.
- Definition Classes
- BufferSubgraph → Comparable
- def computeDepth(outsideDepth: Int): Unit
- def create(node: Node): Unit
Creates the subgraph consisting of all edges reachable from this node.
Creates the subgraph consisting of all edges reachable from this node. Finds the edges in the graph and the rightmost coordinate.
- node
a node to start the graph traversal from
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def findResultEdges(): Unit
Find all edges whose depths indicates that they are in the result area(s).
Find all edges whose depths indicates that they are in the result area(s). Since we want polygon shells to be oriented CW, choose dirEdges with the interior of the result on the RHS. Mark them as being in the result. Interior Area edges are the result of dimensional collapses. They do not form part of the result area boundary.
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getDirectedEdges: ArrayList[DirectedEdge]
- def getEnvelope: Envelope
Computes the envelope of the edges in the subgraph.
Computes the envelope of the edges in the subgraph. The envelope is cached after being computed.
return the envelope of the graph.
- def getNodes: ArrayList[Node]
- def getRightmostCoordinate: Coordinate
Gets the rightmost coordinate in the edges of the subgraph
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()