Skip to content

Polygon Chain Problem #500

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Toulik-Das wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Polygon Chain Problem #500

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions Polygon Chain/POLCHAIN.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
from scipy.optimize import linprog

n=int(input())
polys = [[[int(x) for x in input().split()] for _ in range(int(input()))] for _ in range(n)]
polys.sort(key=lambda p: sum(p1[0]*p2[1] - p1[1]*p2[0] for p1,p2 in zip(p, p[1:] + [p[0]])))

ninc = n*4
a = []
b = []
c = [1]*ninc
for i in range(len(polys)-1):
poly = polys[i+1]
for p in polys[i]:
for i1 in range(len(poly)):
p0, p1 = poly[i1], poly[(i1+1)%len(poly)]
dx, dy = p1[0]-p0[0], p1[1]-p0[1]
eq = [0]*ninc
eq[4*i ] = dy; eq[4*i+1] = -dy
eq[4*i+2] = -dx; eq[4*i+3] = dx
eq[4*i+4] = -dy; eq[4*i+5] = dy
eq[4*i+6] = dx; eq[4*i+7] = -dx
a.append(eq)
b.append(dx*(p[1]-p0[1]) - dy*(p[0]-p0[0]))

res = linprog(c, a, b, method='simplex', options={'maxiter':100000, 'tol':1e-7})
assert res.status == 0 or res.status == 2
print(res.fun if res.status == 0 else -1)
Binary file added Polygon Chain/Polygon Chain.pdf
View file
Open in desktop
Binary file not shown.