trait NonPosQuad extends TwoComplex

Self Type
NonPosQuad
Linear Supertypes
TwoComplex, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonPosQuad
  2. TwoComplex
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract val edges: Set[Edge]
    Definition Classes
    TwoComplex
  2. abstract val faces: Set[Polygon]
    Definition Classes
    TwoComplex
  3. abstract val vertices: Set[Vertex]
    Definition Classes
    TwoComplex

Concrete 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 L(e: Edge): Edge

    Forced version of turnLeft, for geodesics and edgepaths

    Forced version of turnLeft, for geodesics and edgepaths

    Definition Classes
    TwoComplex
  5. def R(e: Edge): Edge

    Forced version of turnRight, for geodesics and edgepaths

    Forced version of turnRight, for geodesics and edgepaths

    Definition Classes
    TwoComplex
  6. def SL(e: Edge): Edge

    Forced version of slightLeft, for geodesics and edgepaths

    Forced version of slightLeft, for geodesics and edgepaths

    Definition Classes
    TwoComplex
  7. def SR(e: Edge): Edge

    Forced version of slightRight, for geodesics and edgepaths

    Forced version of slightRight, for geodesics and edgepaths

    Definition Classes
    TwoComplex
  8. def SwL(e: Edge): Edge

    Forced swivelLeft, for geodesics and edgepaths

    Forced swivelLeft, for geodesics and edgepaths

    Definition Classes
    TwoComplex
  9. def SwR(e: Edge): Edge

    Forced swivelRight, for geodesics and edgepaths

    Forced swivelRight, for geodesics and edgepaths

    Definition Classes
    TwoComplex
  10. def addEdges(eds: Set[Edge]): TwoComplex

    Given a set of edges eds gives the TwoComplex got by adding eds and there flips to the existing twoComplex.

    Given a set of edges eds gives the TwoComplex got by adding eds and there flips to the existing twoComplex.

    Definition Classes
    TwoComplex
  11. def addFaces(fcs: Set[Polygon]): TwoComplex

    Given a set of faces fcs gives the TwoComplex got by adding fcs to the existing twoComplex.

    Given a set of faces fcs gives the TwoComplex got by adding fcs to the existing twoComplex.

    Definition Classes
    TwoComplex
  12. def addTwoComplexes(complexes: Set[TwoComplex]): TwoComplex

    Gives the result of adding the given set of twocomplexes to the existing one.

    Gives the result of adding the given set of twocomplexes to the existing one.

    Definition Classes
    TwoComplex
  13. def addVertices(vs: Set[Vertex]): TwoComplex

    Given a set of vertices vs gives the TwoComplex got by adding vs to the existing twoComplex.

    Given a set of vertices vs gives the TwoComplex got by adding vs to the existing twoComplex. If vs is already inside gives the same twoComplex

    Definition Classes
    TwoComplex
  14. def allEdgesToTheLeftOf(e: Edge): Set[Edge]

    all edges to the left of the edge e including itself

    all edges to the left of the edge e including itself

    Definition Classes
    TwoComplex
  15. def allEdgesToTheRightOf(e: Edge): Set[Edge]

    all edges to the left of the edge e including itself

    all edges to the left of the edge e including itself

    Definition Classes
    TwoComplex
  16. def angleBetween(e1: Edge, e2: Edge): Int

    Given two edges e1 and e2 says what is the angle between them.

    Given two edges e1 and e2 says what is the angle between them. Where angle is the number of turns to reach e2 from e1. Left turns are considered positive and right turns are considered negative. For this method to work both e1 and e2 need to end at the same vertex

    Definition Classes
    TwoComplex
  17. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  18. def checkComplex: Boolean
    Definition Classes
    TwoComplex
  19. lazy val chi: Int
    Definition Classes
    TwoComplex
  20. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  21. def collapseEdge(e: Edge): (TwoComplex, ((EdgePath) => EdgePath, (EdgePath) => EdgePath))
    Definition Classes
    TwoComplex
  22. def connectedComponent(v: Vertex): Set[Vertex]

    Finds the connected component of a vertex

    Finds the connected component of a vertex

    v

    the starting vertex

    returns

    set of initial neighbours

    Definition Classes
    TwoComplex
  23. def degree(v: Vertex): Int

    The degree of a vertex

    The degree of a vertex

    Definition Classes
    TwoComplex
  24. def edgeIndex(edge: Edge): Option[(Int, Boolean)]
    Definition Classes
    TwoComplex
  25. def edgeIndices(edge: Edge): Set[(Polygon, Index, Boolean)]
    Definition Classes
    TwoComplex
  26. def edgeOccurences(e: Edge): Int

    Occurences of edges in faces, counting multiplicity

    Occurences of edges in faces, counting multiplicity

    Definition Classes
    TwoComplex
  27. def edgesEndingAt(v: Vertex): Set[Edge]

    set of all edges ending at v

    set of all edges ending at v

    Definition Classes
    TwoComplex
  28. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  30. def facesWithEdge(edge: Edge): Set[Polygon]
    Definition Classes
    TwoComplex
  31. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  32. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  33. lazy val halfEdges: Set[Edge]
    Definition Classes
    TwoComplex
  34. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  35. lazy val indexedVertices: Set[(Vertex, Int)]
    Definition Classes
    TwoComplex
  36. def isClosedSurface: Boolean
    Definition Classes
    TwoComplex
  37. def isConnectedComplex: Boolean

    Checks if the complex is connected

    Checks if the complex is connected

    returns

    connectivity

    Definition Classes
    TwoComplex
  38. def isEdgeAtBoundary(e: Edge): Boolean

    Checks if the given edge is at the boundary.

    Checks if the given edge is at the boundary. That is exactly one of e and e.flip is inside a face of the twocomplex

    Definition Classes
    TwoComplex
  39. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  40. def isSurfaceWithBoundary: Boolean

    Checks if the twoComplex is a surface with boundary

    Checks if the twoComplex is a surface with boundary

    Definition Classes
    TwoComplex
  41. def maxSetNbr(s: Set[Vertex]): Set[Vertex]
    Definition Classes
    TwoComplex
  42. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  43. def normalArcs: Set[NormalArc]
    Definition Classes
    TwoComplex
  44. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  45. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  46. def orbit(e: Edge, steps: Int, opt: (Edge) => Option[Edge], accum: Set[Edge]): Set[Edge]

    auxilliary function to start with an edge and take all edges by rotating left

    auxilliary function to start with an edge and take all edges by rotating left

    Definition Classes
    TwoComplex
  47. lazy val positiveEdges: Vector[OrientedEdge]
    Definition Classes
    TwoComplex
  48. def predOpt(e: Edge): Option[Edge]

    given an edge, find a face whose boundary contains e (if it exists, it is unique); take the previous edge along the boundary

    given an edge, find a face whose boundary contains e (if it exists, it is unique); take the previous edge along the boundary

    Definition Classes
    TwoComplex
  49. def rotateLeftOpt(e: Edge): Option[Edge]

    gives the edge with same terminal vertex obtained by left rotation.

    gives the edge with same terminal vertex obtained by left rotation.

    Definition Classes
    TwoComplex
  50. def rotateRightOpt(e: Edge): Option[Edge]

    gives the edge with same terminal vertex obtained by right rotation.

    gives the edge with same terminal vertex obtained by right rotation.

    Definition Classes
    TwoComplex
  51. def setNbr(s: Set[Vertex]): Set[Vertex]
    Definition Classes
    TwoComplex
  52. def slightLeft(e: Edge): Option[Edge]

    Given e rotates left twice and flips it.

    Given e rotates left twice and flips it. This is same as rotating left once and then taking the successor.

    Definition Classes
    TwoComplex
  53. def slightRight(e: Edge): Option[Edge]

    Given e takes two right rotations and flips it.

    Given e takes two right rotations and flips it.

    Definition Classes
    TwoComplex
  54. def subComplex(vs: Set[Vertex]): TwoComplex

    Given a set of vertices gives the subcomplex on the vertices

    Given a set of vertices gives the subcomplex on the vertices

    Definition Classes
    TwoComplex
  55. def succOpt(e: Edge): Option[Edge]

    given an edge, find a face whose boundary contains e (if it exists, it is unique); take the next edge along the boundary

    given an edge, find a face whose boundary contains e (if it exists, it is unique); take the next edge along the boundary

    Definition Classes
    TwoComplex
  56. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  57. def toString(): String
    Definition Classes
    AnyRef → Any
  58. def transitiveRotations(v: Vertex): Boolean

    checks if we start with an edge e with v == e.terminal, using left rotations, (by iterating) we should get all edges with terminal vertex v.

    checks if we start with an edge e with v == e.terminal, using left rotations, (by iterating) we should get all edges with terminal vertex v. The naming is slightly misleading. Do give suggestions for better names

    Definition Classes
    TwoComplex
  59. def turnEdge(e: Edge, t: Int): Edge

    Gives the succeeding edge associated to a previous edge and a turning index

    Gives the succeeding edge associated to a previous edge and a turning index

    Definition Classes
    NonPosQuadTwoComplex
  60. def turnIndex(e1: Edge, e2: Edge): Int

    Gives the designated index (1 L, 2 SL, -1 R, -2 SR, higher values by turn distance) associated to a turn

    Gives the designated index (1 L, 2 SL, -1 R, -2 SR, higher values by turn distance) associated to a turn

    Definition Classes
    NonPosQuadTwoComplex
  61. def turnLeft(e: Edge): Option[Edge]

    Turns left in an EdgePath

    Turns left in an EdgePath

    Definition Classes
    TwoComplex
  62. def turnRight(e: Edge): Option[Edge]

    Turns right in an EdgePath

    Turns right in an EdgePath

    Definition Classes
    TwoComplex
  63. def vectorEdgesToTheLeftOf(e: Edge): Vector[Edge]

    Vector of edges to the left of an edge

    Vector of edges to the left of an edge

    Definition Classes
    TwoComplex
  64. def vectorEdgesToTheRightOf(e: Edge): Vector[Edge]

    Vector of edges to the right of an edge

    Vector of edges to the right of an edge

    Definition Classes
    TwoComplex
  65. def vectorLeftTurns(e: Edge): Vector[Edge]

    Vector of flips of edges to the left of an edge

    Vector of flips of edges to the left of an edge

    Definition Classes
    TwoComplex
  66. def vectorOrbit(e: Edge, opt: (Edge) => Option[Edge], accum: Vector[Edge]): Vector[Edge]

    Vector of edges related by a function opt to an edge, modified version of orbit

    Vector of edges related by a function opt to an edge, modified version of orbit

    Definition Classes
    TwoComplex
  67. def vectorOrbitFin(e: Edge, opt: (Edge) => Option[Edge], accum: Vector[Edge], n: Int): Vector[Edge]
    Definition Classes
    TwoComplex
  68. def vectorRightTurns(e: Edge): Vector[Edge]

    Vector of flips of edges to the right of an edge

    Vector of flips of edges to the right of an edge

    Definition Classes
    TwoComplex
  69. def vertexIndex(v: Vertex): Option[Int]
    Definition Classes
    TwoComplex
  70. def vertexNbr(v: Vertex): Set[Vertex]

    Finds neighbours of a vertex

    Finds neighbours of a vertex

    v

    the vertex

    returns

    set of neighbours

    Definition Classes
    TwoComplex
  71. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  72. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  73. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from TwoComplex

Inherited from AnyRef

Inherited from Any

Ungrouped