class GeometryGraph extends PlanarGraph
- Alphabetic
- By Inheritance
- GeometryGraph
- PlanarGraph
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new GeometryGraph(argIndex: Int, parentGeom: Geometry)
- new GeometryGraph(argIndex: Int, parentGeom: Geometry, boundaryNodeRule: BoundaryNodeRule)
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
- def add(e: EdgeEnd): Boolean
- Definition Classes
- PlanarGraph
- def addEdge(e: Edge): Unit
Add an Edge computed externally.
Add an Edge computed externally. The label on the Edge is assumed to be correct.
- def addEdges(edgesToAdd: List[Edge]): Unit
Add a set of edges to the graph.
Add a set of edges to the graph. For each edge two DirectedEdges will be created. DirectedEdges are NOT linked by this method.
- Definition Classes
- PlanarGraph
- def addNode(coord: Coordinate): Node
- Definition Classes
- PlanarGraph
- def addNode(node: Node): Node
- Definition Classes
- PlanarGraph
- def addPoint(pt: Coordinate): Unit
Add a point computed externally.
Add a point computed externally. The point is assumed to be a Point Geometry part, which has a location of INTERIOR.
- var argIndex: Int
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val boundaryNodeRule: BoundaryNodeRule
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def computeEdgeIntersections(g: GeometryGraph, li: LineIntersector, includeProper: Boolean): SegmentIntersector
- def computeSelfNodes(li: LineIntersector, computeRingSelfNodes: Boolean, isDoneIfProperInt: Boolean): SegmentIntersector
Compute self-nodes, taking advantage of the Geometry type to minimize the number of intersection tests.
Compute self-nodes, taking advantage of the Geometry type to minimize the number of intersection tests. (E.g. rings are not tested for self-intersection, since they are assumed to be valid).
- li
the LineIntersector to use
- computeRingSelfNodes
if
false, intersection checks are optimized to not test rings for self-intersection- isDoneIfProperInt
short-circuit the intersection computation if a proper intersection is found return the computed SegmentIntersector containing information about the intersections found
- def computeSelfNodes(li: LineIntersector, computeRingSelfNodes: Boolean): SegmentIntersector
Compute self-nodes, taking advantage of the Geometry type to minimize the number of intersection tests.
Compute self-nodes, taking advantage of the Geometry type to minimize the number of intersection tests. (E.g. rings are not tested for self-intersection, since they are assumed to be valid).
- li
the LineIntersector to use
- computeRingSelfNodes
if
false, intersection checks are optimized to not test rings for self-intersection return the computed SegmentIntersector containing information about the intersections found
- def computeSplitEdges(edgelist: List[Edge]): Unit
- var edgeEndList: ArrayList[EdgeEnd]
- Attributes
- protected
- Definition Classes
- PlanarGraph
- var edges: ArrayList[Edge]
- Attributes
- protected
- Definition Classes
- PlanarGraph
- 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 find(coord: Coordinate): Node
return the node if found; null otherwise
return the node if found; null otherwise
- Definition Classes
- PlanarGraph
- def findEdge(line: LineString): Edge
- def findEdge(p0: Coordinate, p1: Coordinate): Edge
Returns the edge whose first two coordinates are p0 and p1
Returns the edge whose first two coordinates are p0 and p1
return the edge, if found
nullif the edge was not found- Definition Classes
- PlanarGraph
- def findEdgeEnd(e: Edge): EdgeEnd
Returns the EdgeEnd which has edge e as its base edge (MD 18 Feb 2002 - this should return a pair of edges)
Returns the EdgeEnd which has edge e as its base edge (MD 18 Feb 2002 - this should return a pair of edges)
return the edge, if found
nullif the edge was not found- Definition Classes
- PlanarGraph
- def findEdgeInSameDirection(p0: Coordinate, p1: Coordinate): Edge
Returns the edge which starts at p0 and whose first segment is parallel to p1
Returns the edge which starts at p0 and whose first segment is parallel to p1
return the edge, if found
nullif the edge was not found- Definition Classes
- PlanarGraph
- def getBoundaryNodeRule: BoundaryNodeRule
- def getBoundaryNodes: Collection[Node]
- def getBoundaryPoints: Array[Coordinate]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getEdgeEnds: ArrayList[EdgeEnd]
- Definition Classes
- PlanarGraph
- def getEdgeIterator: Iterator[Edge]
- Definition Classes
- PlanarGraph
- def getGeometry: Geometry
- def getInvalidPoint: Coordinate
This constructor is used by clients that wish to add Edges explicitly, rather than adding a Geometry.
This constructor is used by clients that wish to add Edges explicitly, rather than adding a Geometry. (An example is BufferOp).
- def getNodeIterator: Iterator[Node]
- Definition Classes
- PlanarGraph
- def getNodes: Collection[Node]
- Definition Classes
- PlanarGraph
- var hasTooFewPoints: Boolean
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def insertEdge(e: Edge): Boolean
- Attributes
- protected
- Definition Classes
- PlanarGraph
- def isBoundaryNode(geomIndex: Int, coord: Coordinate): Boolean
- Definition Classes
- PlanarGraph
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def linkAllDirectedEdges(): Unit
- Definition Classes
- PlanarGraph
- def linkResultDirectedEdges(): Unit
Link the DirectedEdges at the nodes of the graph.
Link the DirectedEdges at the nodes of the graph. This allows clients to link only a subset of nodes in the graph, for efficiency (because they know that only a subset is of interest).
- Definition Classes
- PlanarGraph
- def locate(pt: Coordinate): Int
Determines the {link Location} of the given {link Coordinate} in this geometry.
Determines the {link Location} of the given {link Coordinate} in this geometry.
- pt
the point to test return the location of the point in the geometry
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- var nodes: NodeMap
- Attributes
- protected
- Definition Classes
- PlanarGraph
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- var parentGeom: Geometry
- def printEdges(out: PrintStream): Unit
- Definition Classes
- PlanarGraph
- 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()