|
Methods
|
|
|
|
|
|
FPP
|
FPP ( self )
|
|
|
FPPstep
|
FPPstep ( self )
|
|
|
Schnyder
|
Schnyder ( self )
we need to compute p1, p2, p3 and t1, t2, t3 and
r1, r2, r3 for each vertex
|
|
|
__init__
|
__init__ ( self )
|
|
|
adjacentVertex
|
adjacentVertex (
self,
v,
e,
)
|
|
|
calculateP
|
calculateP ( self, path123 )
|
|
|
checkIndex
|
checkIndex (
self,
index,
p1,
)
|
|
|
consider
|
consider ( self )
|
|
|
findIndexOfVk
|
findIndexOfVk ( self, k )
|
|
|
initFPP
|
initFPP ( self )
|
|
|
initLabel
|
initLabel ( self )
|
|
|
initOrder
|
initOrder ( self )
|
|
|
isEdge
|
isEdge (
self,
u,
w,
)
|
|
|
labelEdge
|
labelEdge (
self,
indexP1,
indexP2,
label,
)
label label if the edge is indexP1 -> indexP2
-label if the edge is indexP2 -> indexP1
|
|
|
labelStep
|
labelStep ( self )
|
|
|
labelling
|
labelling ( self )
|
|
|
order
|
order ( self )
Now, remove Vn from the graph, and let Vn-1 be the vertex
that is on the outerface and not incident to a chord
|
|
|
ordering
|
ordering ( self )
|
|
|
printGraph
|
printGraph ( self )
|
|
|
storeEdge
|
storeEdge (
self,
indexP1,
indexP2,
p1,
p2,
tf,
)
|
|
|
traverse
|
traverse (
self,
label,
v,
count,
)
|
|
|
triangulate
|
triangulate ( self )
|
|