t

superficial

# Quadrilateral

#### traitQuadrilateral extends Polygon

a quadrilateral is a polygon with four edges.

Linear Supertypes
Polygon, TwoComplex, AnyRef, Any
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. Quadrilateral
2. Polygon
3. TwoComplex
4. AnyRef
5. Any
1. Hide All
2. Show All
Visibility
1. Public
2. Protected

### Abstract Value Members

1. abstract val boundary: Vector[Edge]

a vector of (oriented) edges giving the boundary in the correct order

a vector of (oriented) edges giving the boundary in the correct order

Definition Classes
Polygon
2. abstract val vertices: Set[Vertex]

the set of vertices

the set of vertices

Definition Classes
PolygonTwoComplex

### 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])

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])

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])

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])

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. lazy val basePoint
Definition Classes
Polygon
19. def boundaryIndex(e: Edge): Set[(Int, Boolean)]
Definition Classes
Polygon
20. def checkBoundary: Boolean
Definition Classes
Polygon
21. def checkComplex: Boolean
Definition Classes
TwoComplex
22. def checkPoly: Boolean
Definition Classes
Polygon
23. lazy val chi: Int
Definition Classes
TwoComplex
24. def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
25. def collapseEdge(e: Edge): (TwoComplex, ((EdgePath) => EdgePath, (EdgePath) => EdgePath))
Definition Classes
TwoComplex
26. 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
27. def degree(v: Vertex): Int

The degree of a vertex

The degree of a vertex

Definition Classes
TwoComplex
28. def del

the boundary as a formal sum

the boundary as a formal sum

Definition Classes
Polygon
29. def edgeIndex(edge: Edge): Option[(Int, Boolean)]
Definition Classes
TwoComplex
30. def edgeIndices(edge: Edge): Set[(Polygon, Index, Boolean)]
Definition Classes
TwoComplex
31. def edgeOccurences(e: Edge): Int

Occurences of edges in faces, counting multiplicity

Occurences of edges in faces, counting multiplicity

Definition Classes
TwoComplex
32. lazy val edges: Set[Edge]

the set of edges

the set of edges

Definition Classes
PolygonTwoComplex
33. def edgesEndingAt(v: Vertex): Set[Edge]

set of all edges ending at v

set of all edges ending at v

Definition Classes
TwoComplex
34. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
35. def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
36. lazy val faces: Set[Polygon]
Definition Classes
PolygonTwoComplex
37. def facesWithEdge(edge: Edge): Set[Polygon]
Definition Classes
TwoComplex
38. final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
39. lazy val halfEdges: Set[Edge]
Definition Classes
TwoComplex
40. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
41. lazy val indexedVertices: Set[(Vertex, Int)]
Definition Classes
TwoComplex
42. lazy val indices: Vector[Index]
Definition Classes
Polygon
43. def isClosedSurface: Boolean
Definition Classes
TwoComplex
44. def isConnectedComplex: Boolean

Checks if the complex is connected

Checks if the complex is connected

returns

connectivity

Definition Classes
TwoComplex
45. 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
46. final def isInstanceOf[T0]: Boolean
Definition Classes
Any
47. def isSurfaceWithBoundary: Boolean

Checks if the twoComplex is a surface with boundary

Checks if the twoComplex is a surface with boundary

Definition Classes
TwoComplex
48. def maxSetNbr(s: Set[Vertex]): Set[Vertex]
Definition Classes
TwoComplex
49. final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
50. def normalArcs: Set[NormalArc]
Definition Classes
TwoComplex
51. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
52. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
53. 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
54. lazy val positiveEdges: Vector[OrientedEdge]
Definition Classes
TwoComplex
55. 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
56. 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
57. 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
58. def setNbr(s: Set[Vertex]): Set[Vertex]
Definition Classes
TwoComplex
59. val sides: Int
Definition Classes
QuadrilateralPolygon
60. 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
61. 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
62. def subComplex(vs: Set[Vertex])

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
63. 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
64. final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
65. def toString()
Definition Classes
AnyRef → Any
66. 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
67. 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
68. 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
69. def turnLeft(e: Edge): Option[Edge]

Turns left in an EdgePath

Turns left in an EdgePath

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

Turns right in an EdgePath

Turns right in an EdgePath

Definition Classes
TwoComplex
71. 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
72. 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
73. 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
74. 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
75. def vectorOrbitFin(e: Edge, opt: (Edge) => Option[Edge], accum: Vector[Edge], n: Int): Vector[Edge]
Definition Classes
TwoComplex
76. 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
77. def vertexIndex(v: Vertex): Option[Int]
Definition Classes
TwoComplex
78. 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
79. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
80. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
81. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])

### Deprecated Value Members

1. def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated