object EdgePath
- Alphabetic
- By Inheritance
- EdgePath
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
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 apply(v: Vector[Edge]): EdgePath
Constructing EdgePaths from vectors of edges
Constructing EdgePaths from vectors of edges
- returns
EdgePath
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def boundary(poly: Polygon): EdgePath
Converts the boundary of a polygon to an EdgePath
Converts the boundary of a polygon to an EdgePath
- returns
EdgePath
- def canoniciseLoop(loop: EdgePath, nonposQuad: NonPosQuad): EdgePath
- def canoniciseLoopHelper(loop: EdgePath, n: Int, nonposQuad: NonPosQuad): EdgePath
- def canoniciseVectorLoop(eVect: Vector[Edge], nonposQuad: NonPosQuad): Vector[Edge]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def combinePaths(pathVect: Vector[EdgePath]): EdgePath
combines edgePaths in a vector of paths to build a edgePath
- def edgePathReduce(path: EdgePath, twoComplex: TwoComplex): EdgePath
Reduces an EdgePath
- def edgePathToGeodesic(path: EdgePath, twoComplex: TwoComplex): EdgePath
Homotopes an EdgePath to a geodesic
- def edgeVectors(path: EdgePath): Vector[Edge]
Gives a vector of edges corresponding to an EdgePath
- def enumerate(complex: TwoComplex, length: Int, predicate: (EdgePath) => Boolean = (_) => true): LazyList[EdgePath]
Enumerate all edge-paths of a given length in a complex satisfying a predicate, assumed hereditary, i.e., if an edge-path satisfies a predicate so should sub-paths.
Enumerate all edge-paths of a given length in a complex satisfying a predicate, assumed hereditary, i.e., if an edge-path satisfies a predicate so should sub-paths. Typical use is generating reduced paths.
- complex
the two complex in which we consider paths
- length
length of paths to generate
- predicate
condition to be satisfied
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def findFirstLeftBracketTurnPath(v: Vector[Int]): Option[(Int, Int)]
Finds indices of the beginning and end (the left turns) of the first left bracket in an EdgePath
- def findFirstRightBracketTurnPath(v: Vector[Int]): Option[(Int, Int)]
Finds indices of the beginning and end (the right turns) of the first right bracket in an EdgePath
- def findQuad(e1: Edge, e2: Edge, nonposQuad: NonPosQuad): Polygon
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def isCanonicalGeodesicLoop(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
- def isGeodesic(path: EdgePath, twoComplex: TwoComplex): Boolean
Checks if an EdgePath is a geodesic in a non positive quadrangulation
- def isGeodesicLoop(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isReduced(path: EdgePath): Boolean
Checks if an EdgePath is reduced
- def length(path: EdgePath): Int
Finds the length of an EdgePath
Finds the length of an EdgePath
- returns
length of path
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def shiftRightwards(e1: Edge, e2: Edge, nonposQuad: NonPosQuad): Vector[Edge]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- def turnPath(path: EdgePath, twoComplex: TwoComplex): (Edge, Vector[Int])
Gives a vector of integers corresponding to turns in a non-trivial EdgePath
- def turnPathReduce(edge: Edge, turnVect1: Vector[Int], twoComplex: TwoComplex): (Edge, Vector[Int])
Reduces a turnPath
- def turnPathStandardForm(edge: Edge, turnVect: Vector[Int], twoComplex: TwoComplex): Vector[Int]
Converts a turnPath to standard form, with (1,2,-1,-2) <-> (L,SL,R,SR)
- def turnPathToEdgePath(edge: Edge, v: Vector[Int], twoComplex: TwoComplex): EdgePath
Gives an EdgePath from an initial edge and a vector of turn directions
- def turnPathToGeodesic(e: Edge, turnVect: Vector[Int], twoComplex: TwoComplex): (Edge, Vector[Int])
Converts a turnPath to a geodesic
- def turnPathToGeodesicHelper(edge: Edge, turnVect: Vector[Int], twoComplex: TwoComplex): (Edge, Vector[Int], TwoComplex)
Helper function for turning a turnPath into a geodesic
- 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()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated