case class QuadFace(face: Polygon, flipFace: Polygon, indexOfEdge: Int, indexOfFlip: Int) extends Polygon with Product with Serializable
- Alphabetic
- By Inheritance
- QuadFace
- Serializable
- Product
- Equals
- Polygon
- TwoComplex
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
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 L(e: Edge): Edge
Forced version of turnLeft, for geodesics and edgepaths
Forced version of turnLeft, for geodesics and edgepaths
- Definition Classes
- TwoComplex
- def R(e: Edge): Edge
Forced version of turnRight, for geodesics and edgepaths
Forced version of turnRight, for geodesics and edgepaths
- Definition Classes
- TwoComplex
- def SL(e: Edge): Edge
Forced version of slightLeft, for geodesics and edgepaths
Forced version of slightLeft, for geodesics and edgepaths
- Definition Classes
- TwoComplex
- def SR(e: Edge): Edge
Forced version of slightRight, for geodesics and edgepaths
Forced version of slightRight, for geodesics and edgepaths
- Definition Classes
- TwoComplex
- def SwL(e: Edge): Edge
Forced swivelLeft, for geodesics and edgepaths
Forced swivelLeft, for geodesics and edgepaths
- Definition Classes
- TwoComplex
- def SwR(e: Edge): Edge
Forced swivelRight, for geodesics and edgepaths
Forced swivelRight, for geodesics and edgepaths
- Definition Classes
- TwoComplex
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- lazy val basePoint: Vertex
- Definition Classes
- Polygon
- val boundary: Vector[Edge]
- def boundaryIndex(e: Edge): Set[(Int, Boolean)]
- Definition Classes
- Polygon
- def checkBoundary: Boolean
- Definition Classes
- Polygon
- def checkComplex: Boolean
- Definition Classes
- TwoComplex
- def checkPoly: Boolean
- Definition Classes
- Polygon
- lazy val chi: Int
- Definition Classes
- TwoComplex
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def collapseEdge(e: Edge): (TwoComplex, ((EdgePath) => EdgePath, (EdgePath) => EdgePath))
- Definition Classes
- TwoComplex
- 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
- def degree(v: Vertex): Int
The degree of a vertex
The degree of a vertex
- Definition Classes
- TwoComplex
- def del: FormalSum[Edge]
the boundary as a formal sum
the boundary as a formal sum
- Definition Classes
- Polygon
- def edgeIndex(edge: Edge): Option[(Int, Boolean)]
- Definition Classes
- TwoComplex
- def edgeIndices(edge: Edge): Set[(Polygon, Index, Boolean)]
- Definition Classes
- TwoComplex
- def edgeOccurences(e: Edge): Int
Occurences of edges in faces, counting multiplicity
Occurences of edges in faces, counting multiplicity
- Definition Classes
- TwoComplex
- lazy val edges: Set[Edge]
the set of edges
the set of edges
- Definition Classes
- Polygon → TwoComplex
- def edgesEndingAt(v: Vertex): Set[Edge]
set of all edges ending at v
set of all edges ending at v
- Definition Classes
- TwoComplex
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val face: Polygon
- lazy val faces: Set[Polygon]
- Definition Classes
- Polygon → TwoComplex
- def facesWithEdge(edge: Edge): Set[Polygon]
- Definition Classes
- TwoComplex
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- val flipFace: Polygon
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- lazy val halfEdges: Set[Edge]
- Definition Classes
- TwoComplex
- val indexOfEdge: Int
- val indexOfFlip: Int
- lazy val indexedVertices: Set[(Vertex, Int)]
- Definition Classes
- TwoComplex
- lazy val indices: Vector[Index]
- Definition Classes
- Polygon
- def isClosedSurface: Boolean
- Definition Classes
- TwoComplex
- def isConnectedComplex: Boolean
Checks if the complex is connected
- 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
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isSurfaceWithBoundary: Boolean
Checks if the twoComplex is a surface with boundary
Checks if the twoComplex is a surface with boundary
- Definition Classes
- TwoComplex
- def maxSetNbr(s: Set[Vertex]): Set[Vertex]
- Definition Classes
- TwoComplex
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def normalArcs: Set[NormalArc]
- Definition Classes
- TwoComplex
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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
- lazy val positiveEdges: Vector[OrientedEdge]
- Definition Classes
- TwoComplex
- 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
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- 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
- 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
- def setNbr(s: Set[Vertex]): Set[Vertex]
- Definition Classes
- TwoComplex
- val sides: Int
- 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
- 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
- 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
- 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
- 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
- TwoComplex
- 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
- TwoComplex
- def turnLeft(e: Edge): Option[Edge]
Turns left in an EdgePath
Turns left in an EdgePath
- Definition Classes
- TwoComplex
- def turnRight(e: Edge): Option[Edge]
Turns right in an EdgePath
Turns right in an EdgePath
- Definition Classes
- TwoComplex
- 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
- 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
- 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
- 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
- def vectorOrbitFin(e: Edge, opt: (Edge) => Option[Edge], accum: Vector[Edge], n: Int): Vector[Edge]
- Definition Classes
- TwoComplex
- 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
- def vertexIndex(v: Vertex): Option[Int]
- Definition Classes
- TwoComplex
- def vertexNbr(v: Vertex): Set[Vertex]
Finds neighbours of a vertex
- val vertices: Set[Vertex]
the set of vertices
the set of vertices
- Definition Classes
- QuadFace → Polygon → TwoComplex
- 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()