mirror of
https://github.com/3b1b/manim.git
synced 2025-08-05 16:49:03 +00:00
Small cleanups
This commit is contained in:
parent
dda9683fb7
commit
1097f0df96
2 changed files with 14 additions and 14 deletions
|
@ -21,7 +21,7 @@ tex:
|
|||
template_file: "tex_template.tex"
|
||||
intermediate_filetype: "dvi"
|
||||
text_to_replace: "[tex_expression]"
|
||||
# # For ctex, use the following configuration
|
||||
# For ctex, use the following configuration
|
||||
# executable: "xelatex -no-pdf"
|
||||
# template_file: "ctex_template.tex"
|
||||
# intermediate_filetype: "xdv"
|
||||
|
|
|
@ -361,16 +361,15 @@ def earclip_triangulation(verts, rings):
|
|||
n = len(verts)
|
||||
# Establish where loop indices should be connected
|
||||
loop_connections = dict()
|
||||
# for e0, e1 in zip(rings, rings[1:]):
|
||||
e0 = rings[0]
|
||||
for e1 in rings[1:]:
|
||||
# Find closet pair of points with the first
|
||||
# coming from the current ring, and the second
|
||||
# coming from the next ring
|
||||
end0 = rings[0]
|
||||
for end1 in rings[1:]:
|
||||
# Find the closet pair of points with the first
|
||||
# from the current ring, and the second from the
|
||||
# next ring
|
||||
index_pairs = [
|
||||
(i, j)
|
||||
for i in range(0, e0)
|
||||
for j in range(e0, e1)
|
||||
for i in range(0, end0)
|
||||
for j in range(end0, end1)
|
||||
if i not in loop_connections
|
||||
if j not in loop_connections
|
||||
]
|
||||
|
@ -383,14 +382,15 @@ def earclip_triangulation(verts, rings):
|
|||
# it's treated as a single highly-convex ring
|
||||
loop_connections[i] = j
|
||||
loop_connections[j] = i
|
||||
e0 = e1
|
||||
end0 = end1
|
||||
|
||||
# Setup linked list
|
||||
after = []
|
||||
e0 = 0
|
||||
for e1 in rings:
|
||||
after.extend([*range(e0 + 1, e1), e0])
|
||||
e0 = e1
|
||||
end0 = 0
|
||||
for end1 in rings:
|
||||
after.extend(range(end0 + 1, end1))
|
||||
after.append(end0)
|
||||
end0 = end1
|
||||
|
||||
# Find an ordering of indices walking around the polygon
|
||||
indices = []
|
||||
|
|
Loading…
Add table
Reference in a new issue