def example_graph2():
"""
Same as graph1, but with some pendent nodes added.
"""
G = openpg.openpg(name='square6-extras')
fouter = openpg.face(
[00, 10, 20, 30, 31, 32, 22, 12, 2, 1, 70, 71, 70, 1, 60, 1],
visible=False,
outer=True)
f1 = openpg.face([00, 1, 11, 90, 11, 10], visible=True)
f2 = openpg.face([10, 11, 21, 20], visible=True)
f3 = openpg.face([20, 21, 31, 30])
f4 = openpg.face([1, 2, 12, 11, 80, 11])
f5 = openpg.face([11, 12, 22, 21], visible=True)
f6 = openpg.face([21, 22, 32, 31], visible=True)
G.add_face(fouter)
G.add_face(f1)
G.add_face(f2)
G.add_face(f3)
G.add_face(f4)
G.add_face(f5)
G.add_face(f6)
return G
def test_outer_face(self):
g = openpg.openpg()
f1 = openpg.face([], outer=True)
f2 = openpg.face([], visible=True)
g.add_face(f1)
g.add_face(f2)
self.assertIs(g.outer_face(), f1)
def example_graph3(name=''):
G = openpg.openpg(name=name)
fouter = openpg.face([-1, -2, -3, -4], visible=False, outer=True)
ftop = openpg.face([-3, -2, -1, 00, 10, 20, 30, 31, 32], visible=True)
fbottom = openpg.face([00, -1, -4, -3, 32, 22, 12, 2, 1], visible=True)
f1 = openpg.face([00, 1, 11, 90, 11, 10], visible=True)
f2 = openpg.face([10, 11, 21, 20], visible=True)
f3 = openpg.face([20, 21, 31, 30])
f4 = openpg.face([1, 2, 12, 11])
f5 = openpg.face([11, 12, 22, 21])
f6 = openpg.face([21, 22, 32, 31], visible=True)
G.add_face(fouter)
G.add_face(ftop)
G.add_face(fbottom)
G.add_face(f1)
G.add_face(f2)
G.add_face(f3)
G.add_face(f4)
G.add_face(f5)
G.add_face(f6)
return G
def example_graph1(name='square6'): """ Returns a simple graph: o---o---o---o | 1 | 2 | 3 | Nodes numbered on grid from 0,0 to 3,2. left to right, o---o---o---o top to bottom. | 4 | 5 | 6 | f1, f2, f5, f6 are visible. o---o---o---o """ G = openpg.openpg(name=name) fouter = openpg.face([0,10,20,30,31,32,22,12,2,1], visible=False, outer=True) f1 = openpg.face([00,1,11,90,11,10], visible=True) f2 = openpg.face([10,11,21,20], visible=True) f3 = openpg.face([20,21,31,30]) f4 = openpg.face([1,2,12,11]) f5 = openpg.face([11,12,22,21], visible=True) f6 = openpg.face([21,22,32,31], visible=True) G.add_face(fouter) G.add_face(f1) G.add_face(f2) G.add_face(f3) G.add_face(f4) G.add_face(f5) G.add_face(f6) return G
def example_graph1(name='square6'):
"""
Returns a simple graph:
o---o---o---o
| 1 | 2 | 3 | Nodes numbered on grid from 0,0 to 3,2. left to right,
o---o---o---o top to bottom.
| 4 | 5 | 6 | f1, f2, f5, f6 are visible.
o---o---o---o
"""
G = openpg.openpg(name=name)
fouter = openpg.face([0, 10, 20, 30, 31, 32, 22, 12, 2, 1],
visible=False,
outer=True)
f1 = openpg.face([00, 1, 11, 90, 11, 10], visible=True)
f2 = openpg.face([10, 11, 21, 20], visible=True)
f3 = openpg.face([20, 21, 31, 30])
f4 = openpg.face([1, 2, 12, 11])
f5 = openpg.face([11, 12, 22, 21], visible=True)
f6 = openpg.face([21, 22, 32, 31], visible=True)
G.add_face(fouter)
G.add_face(f1)
G.add_face(f2)
G.add_face(f3)
G.add_face(f4)
G.add_face(f5)
G.add_face(f6)
return G
def example_graph3(name=''): G = openpg.openpg(name=name) fouter = openpg.face([-1,-2,-3,-4], visible=False, outer=True) ftop = openpg.face([-3,-2,-1,00,10,20,30,31,32], visible=True) fbottom = openpg.face([00,-1,-4,-3,32,22,12,2,1], visible=True) f1 = openpg.face([00,1,11,90,11,10], visible=True) f2 = openpg.face([10,11,21,20], visible=True) f3 = openpg.face([20,21,31,30]) f4 = openpg.face([1,2,12,11]) f5 = openpg.face([11,12,22,21]) f6 = openpg.face([21,22,32,31], visible=True) G.add_face(fouter) G.add_face(ftop) G.add_face(fbottom) G.add_face(f1) G.add_face(f2) G.add_face(f3) G.add_face(f4) G.add_face(f5) G.add_face(f6) return G
def test_outer_face(self): g = openpg.openpg() f1 = openpg.face([], outer=True) f2 = openpg.face([], visible=True) g.add_face(f1) g.add_face(f2) self.assertIs(g.outer_face(), f1)
def test_remove_face(self):
g = openpg.openpg()
f1 = openpg.face([], outer=True)
f2 = openpg.face([], visible=True)
g.add_face(f1)
g.add_face(f2)
self.assertEqual(len(g.faces), 2)
g.remove_face(f1)
self.assertEqual(len(g.faces), 1)
def test_remove_face(self): g = openpg.openpg() f1 = openpg.face([], outer=True) f2 = openpg.face([], visible=True) g.add_face(f1) g.add_face(f2) self.assertEqual(len(g.faces), 2) g.remove_face(f1) self.assertEqual(len(g.faces), 1)
def example_graph4(name=''): G = openpg.openpg(name=name) fouter = openpg.face([0,10,20,30,31,32,22,12,2,1], visible=False, outer=True) f1 = openpg.face([00,1,11,90,11,10], visible=True) f2 = openpg.face([10,11,21,20], visible=True) f3 = openpg.face([20,21,31,30]) f4 = openpg.face([1,2,12,11]) f5 = openpg.face([11,12,22,21], visible=True) f6 = openpg.face([21,22,32,31], visible=False) G.add_face(fouter) G.add_face(f1) G.add_face(f2) G.add_face(f3) G.add_face(f4) G.add_face(f5) G.add_face(f6) return G
def example_graph4(name=''):
G = openpg.openpg(name=name)
fouter = openpg.face([0, 10, 20, 30, 31, 32, 22, 12, 2, 1],
visible=False,
outer=True)
f1 = openpg.face([00, 1, 11, 90, 11, 10], visible=True)
f2 = openpg.face([10, 11, 21, 20], visible=True)
f3 = openpg.face([20, 21, 31, 30])
f4 = openpg.face([1, 2, 12, 11])
f5 = openpg.face([11, 12, 22, 21], visible=True)
f6 = openpg.face([21, 22, 32, 31], visible=False)
G.add_face(fouter)
G.add_face(f1)
G.add_face(f2)
G.add_face(f3)
G.add_face(f4)
G.add_face(f5)
G.add_face(f6)
return G
def check_pattern(P, G):
if len(P.faces) == len(G.faces):
if check_plane_isomorphism(P, G):
return True
parcs = [
x for x in P.graph.edges_iter() if P.graph[x[0]][x[1]]['face'].visible
]
arc0 = parcs[0]
other_arcs = [
x for x in G.graph.edges_iter() if G.graph[x[0]][x[1]]['face'].visible
]
for arc in other_arcs:
f = _traverse_visible_and_build_matching(P, G, arc0, arc)
W = set()
for a in parcs:
fa = f[a]
W.add(G.graph[fa[0]][fa[1]]['face'])
visible_faces = {x for x in G.faces if x.visible}
if W <= visible_faces and \
W <= G.contiguous_visible_faces(list(W)[0]):
Gprime = openpg.openpg()
for face in G.faces:
nface = face.copy()
Gprime.add_face(nface)
found = False
for f in W:
if face.equiv(f):
found = True
if not found:
nface.visible = False
Gprime.normalize()
if check_plane_isomorphism(P, Gprime):
return True
return False
def check_pattern(P, G):
if len(P.faces) == len(G.faces):
if check_plane_isomorphism(P, G):
return True
parcs = [x for x in P.graph.edges_iter() if
P.graph[x[0]][x[1]]['face'].visible]
arc0 = parcs[0]
other_arcs = [x for x in G.graph.edges_iter() if
G.graph[x[0]][x[1]]['face'].visible]
for arc in other_arcs:
f = _traverse_visible_and_build_matching(P,G,arc0,arc)
W = set()
for a in parcs:
fa = f[a]
W.add(G.graph[fa[0]][fa[1]]['face'])
visible_faces = {x for x in G.faces if x.visible}
if W <= visible_faces and \
W <= G.contiguous_visible_faces(list(W)[0]):
Gprime = openpg.openpg()
for face in G.faces:
nface = face.copy()
Gprime.add_face(nface)
found = False
for f in W:
if face.equiv(f):
found = True
if not found:
nface.visible = False
Gprime.normalize()
if check_plane_isomorphism(P, Gprime):
return True
return False
def example_graph2(): """ Same as graph1, but with some pendent nodes added. """ G = openpg.openpg(name='square6-extras') fouter = openpg.face([00,10,20,30,31,32,22,12,2,1,70,71,70,1,60,1], visible=False, outer=True) f1 = openpg.face([00,1,11,90,11,10], visible=True) f2 = openpg.face([10,11,21,20], visible=True) f3 = openpg.face([20,21,31,30]) f4 = openpg.face([1,2,12,11,80,11]) f5 = openpg.face([11,12,22,21], visible=True) f6 = openpg.face([21,22,32,31], visible=True) G.add_face(fouter) G.add_face(f1) G.add_face(f2) G.add_face(f3) G.add_face(f4) G.add_face(f5) G.add_face(f6) return G
