object EdgePath

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. EdgePath
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. final case class Append(init: EdgePath, last: Edge) extends EdgePath with Product with Serializable

    Inductive constructor for EdgePaths

  2. final case class Constant(initial: Vertex) extends EdgePath with Product with Serializable

    Constructor for a constant EdgePath

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply(v: Vector[Edge]): EdgePath

    Constructing EdgePaths from vectors of edges

    Constructing EdgePaths from vectors of edges

    returns

    EdgePath

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. 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

  7. def canoniciseLoop(loop: EdgePath, nonposQuad: NonPosQuad): EdgePath
  8. def canoniciseVectorLoop(eVect: Vector[Edge], nonposQuad: NonPosQuad): Vector[Edge]
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  10. def edgePathReduce(path: EdgePath, twoComplex: TwoComplex): EdgePath

    Reduces an EdgePath

  11. def edgePathToGeodesic(path: EdgePath, twoComplex: TwoComplex): EdgePath

    Homotopes an EdgePath to a geodesic

  12. def edgeVectors(path: EdgePath): Vector[Edge]

    Gives a vector of edges corresponding to an EdgePath

  13. 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

  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  17. 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

  18. 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

  19. def findQuad(e1: Edge, e2: Edge, nonposQuad: NonPosQuad): Polygon
  20. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. def isCanonicalGeodesicLoop(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
  23. def isGeodesic(path: EdgePath, twoComplex: TwoComplex): Boolean

    Checks if an EdgePath is a geodesic in a non positive quadrangulation

  24. def isGeodesicLoop(loop: EdgePath, nonposQuad: NonPosQuad): Boolean
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def isReduced(path: EdgePath): Boolean

    Checks if an EdgePath is reduced

  27. def length(path: EdgePath): Int

    Finds the length of an EdgePath

    Finds the length of an EdgePath

    returns

    length of path

  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. def shiftRightwards(e1: Edge, e2: Edge, nonposQuad: NonPosQuad): Vector[Edge]
  32. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  33. def toString(): String
    Definition Classes
    AnyRef → Any
  34. def turnPath(path: EdgePath, twoComplex: TwoComplex): (Edge, Vector[Int])

    Gives a vector of integers corresponding to turns in a non-trivial EdgePath

  35. def turnPathReduce(edge: Edge, turnVect1: Vector[Int], twoComplex: TwoComplex): (Edge, Vector[Int])

    Reduces a turnPath

  36. 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)

  37. def turnPathToEdgePath(edge: Edge, v: Vector[Int], twoComplex: TwoComplex): EdgePath

    Gives an EdgePath from an initial edge and a vector of turn directions

  38. def turnPathToGeodesic(e: Edge, turnVect: Vector[Int], twoComplex: TwoComplex): (Edge, Vector[Int])

    Converts a turnPath to a geodesic

  39. def turnPathToGeodesicHelper(edge: Edge, turnVect: Vector[Int], twoComplex: TwoComplex): (Edge, Vector[Int], TwoComplex)

    Helper function for turning a turnPath into a geodesic

  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  41. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  42. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped