3rd-party/poly2tri
1
0
Fork 0
mirror of https://github.com/jhasse/poly2tri.git synced 2024-11-26 15:26:12 +01:00
Code Issues Projects Releases Wiki Activity

updated types

Browse Source
This commit is contained in:
zzzzrrr 2009-11-12 15:35:42 -05:00
parent 696e99da3c
commit a932c1b709
1 changed files with 11 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
python/framework/triangulator.pyx
View File

@ -534,7 +534,8 @@ cdef class MonotoneMountain:
self.tail = point self.tail = point
self.size += 1 self.size += 1
def remove(self, Point point): cdef void remove(self, Point point):
cdef Point next, prev
next = point.next next = point.next
prev = point.prev prev = point.prev
point.prev.next = next point.prev.next = next
@ -552,7 +553,7 @@ cdef class MonotoneMountain:
p = p.next p = p.next
self.triangulate() self.triangulate()
def triangulate(self): cdef void triangulate(self):
while not len(self.convex_points) > 0: while not len(self.convex_points) > 0:
ear = self.convex_points.remove(0) ear = self.convex_points.remove(0)
a = ear.prev a = ear.prev
@ -565,25 +566,25 @@ cdef class MonotoneMountain:
if self.valid(c): self.convex_points.append(c) if self.valid(c): self.convex_points.append(c)
assert(self.size <= 3, "Triangulation bug, please report") assert(self.size <= 3, "Triangulation bug, please report")
def valid(self, Point p): cdef bool valid(self, Point p):
return p != self.head and p != self.tail and self.is_convex(p) return p != self.head and p != self.tail and self.is_convex(p)
def gen_mono_poly(self): cdef void gen_mono_poly(self):
p = self.head cdef Point p = self.head
while(p is not None): while(p is not None):
self.mono_poly.append(p) self.mono_poly.append(p)
p = p.next p = p.next
def angle(self, Point p): cdef float angle(self, Point p):
cdef Point a = p.next - p cdef Point a = p.next - p
cdef Point b = p.prev - p cdef Point b = p.prev - p
return atan2(a.cross(b), a.dot(b)) return atan2(a.cross(b), a.dot(b))
def angle_sign(self): cdef float angle_sign(self):
a = self.head.next - self.head cdef Point a = self.head.next - self.head
b = self.tail - self.head cdef Point b = self.tail - self.head
return atan2(a.cross(b), a.dot(b)) >= 0 return atan2(a.cross(b), a.dot(b)) >= 0
def is_convex(self, Point p): cdef bool is_convex(self, Point p):
if self.positive != (self.angle(p) >= 0): return False if self.positive != (self.angle(p) >= 0): return False
return True return True