Files
ClaudeandClaude Opus 5.5 dfe2c65b9b G1 band25 blind review v1: 24 unrelated, 1 UNRESOLVED (frozen before custody join)
Inputs: anonymous package 3864d341 only (ZIP/manifest SHA256 re-verified).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
2026-11-14 17:27:13 +00:00

103 lines
5.4 KiB
Python

import sys, math, random, os, json
def readply(p):
L=open(p).read().split('\n'); i=0; nv=nf=0
while True:
s=L[i]; i+=1
if s.startswith('element vertex'): nv=int(s.split()[2])
if s.startswith('element face'): nf=int(s.split()[2])
if s=='end_header': break
V=[tuple(map(float,L[i+k].split())) for k in range(nv)]; i+=nv
F=[tuple(map(int,L[i+k].split()[1:4])) for k in range(nf)]
return V,F
def jacobi(A):
n=len(A); A=[r[:] for r in A]; Vv=[[float(i==j) for j in range(n)] for i in range(n)]
for _ in range(100):
off=sum(A[i][j]**2 for i in range(n) for j in range(n) if i!=j)
if off<1e-30: break
for p in range(n):
for q in range(p+1,n):
if abs(A[p][q])<1e-300: continue
th=(A[q][q]-A[p][p])/(2*A[p][q]); t=(1 if th>=0 else -1)/(abs(th)+math.sqrt(th*th+1))
c=1/math.sqrt(t*t+1); s=t*c
for k in range(n):
akp,akq=A[k][p],A[k][q]; A[k][p]=c*akp-s*akq; A[k][q]=s*akp+c*akq
for k in range(n):
apk,aqk=A[p][k],A[q][k]; A[p][k]=c*apk-s*aqk; A[q][k]=s*apk+c*aqk
for k in range(n):
vkp,vkq=Vv[k][p],Vv[k][q]; Vv[k][p]=c*vkp-s*vkq; Vv[k][q]=s*vkp+c*vkq
ev=[A[i][i] for i in range(n)]; o=sorted(range(n),key=lambda i:-ev[i])
return [ev[i] for i in o],[[Vv[k][i] for k in range(n)] for i in o]
def sub(a,b): return (a[0]-b[0],a[1]-b[1],a[2]-b[2])
def cross(a,b): return (a[1]*b[2]-a[2]*b[1],a[2]*b[0]-a[0]*b[2],a[0]*b[1]-a[1]*b[0])
def info(V,F,rng,N):
E=set();
for a,b,c in F:
for u,v in ((a,b),(b,c),(c,a)): E.add((min(u,v),max(u,v)))
par=list(range(len(V)))
def f(x):
while par[x]!=x: par[x]=par[par[x]]; x=par[x]
return x
for u,v in E: par[f(u)]=f(v)
comps=len({f(i) for i in range(len(V))})
areas=[]; vol=0
for a,b,c in F:
A,B,C=V[a],V[b],V[c]; n=cross(sub(B,A),sub(C,A)); areas.append(0.5*math.sqrt(n[0]**2+n[1]**2+n[2]**2))
vol+=(A[0]*(B[1]*C[2]-B[2]*C[1])-A[1]*(B[0]*C[2]-B[2]*C[0])+A[2]*(B[0]*C[1]-B[1]*C[0]))/6
S=sum(areas); cum=[];t=0
for x in areas: t+=x; cum.append(t)
import bisect
P=[]
for _ in range(N):
k=min(bisect.bisect_left(cum,rng.random()*S),len(F)-1); a,b,c=F[k]; r1,r2=rng.random(),rng.random()
if r1+r2>1: r1,r2=1-r1,1-r2
A,B,C=V[a],V[b],V[c]; P.append(tuple(A[i]+r1*(B[i]-A[i])+r2*(C[i]-A[i]) for i in range(3)))
m=[sum(p[i] for p in P)/N for i in range(3)]; Q=[sub(p,m) for p in P]
Cv=[[sum(q[i]*q[j] for q in Q)/N for j in range(3)] for i in range(3)]
ev,vec=jacobi(Cv)
return dict(nv=len(V),nf=len(F),ne=len(E),chi=len(V)-len(E)+len(F),comps=comps,area=S,absvol=abs(vol),rg=math.sqrt(sum(ev)),ev=ev,vec=vec,Q=Q)
def proj(Q,vec): return [tuple(sum(q[k]*vec[i][k] for k in range(3)) for i in range(3)) for q in Q]
def nn(P,Q):
out=[]
for p in P:
out.append(math.sqrt(min((p[0]-q[0])**2+(p[1]-q[1])**2+(p[2]-q[2])**2 for q in Q)))
return out
def p95(d): d=sorted(d); return d[int(0.95*(len(d)-1))]
def horn(P,Q):
S=[[sum(p[i]*q[j] for p,q in zip(P,Q)) for j in range(3)] for i in range(3)]
Sxx,Sxy,Sxz=S[0];Syx,Syy,Syz=S[1];Szx,Szy,Szz=S[2]
N=[[Sxx+Syy+Szz,Syz-Szy,Szx-Sxz,Sxy-Syx],[Syz-Szy,Sxx-Syy-Szz,Sxy+Syx,Szx+Sxz],[Szx-Sxz,Sxy+Syx,-Sxx+Syy-Szz,Syz+Szy],[Sxy-Syx,Szx+Sxz,Syz+Szy,-Sxx-Syy+Szz]]
ev,vec=jacobi(N); w,x,y,z=vec[0]
return [[w*w+x*x-y*y-z*z,2*(x*y-w*z),2*(x*z+w*y)],[2*(x*y+w*z),w*w-x*x+y*y-z*z,2*(y*z-w*x)],[2*(x*z-w*y),2*(y*z+w*x),w*w-x*x-y*y+z*z]]
def rot(R,P): return [tuple(sum(R[i][k]*p[k] for k in range(3)) for i in range(3)) for p in P]
def align(A,B,iters=6):
# A,B already in own PCA frames; try sign flips (det +1 and -1), ICP refine on proper ones
res=[]
for sx in (1,-1):
for sy in (1,-1):
for sz in (1,-1):
Bs=[(sx*p[0],sy*p[1],sz*p[2]) for p in B]
det=sx*sy*sz
cur=Bs
for _ in range(iters):
# match cur->A nearest, then Horn (rotation only; centroids already ~0)
idx=[min(range(len(A)),key=lambda j:(c[0]-A[j][0])**2+(c[1]-A[j][1])**2+(c[2]-A[j][2])**2) for c in cur]
R=horn(cur,[A[j] for j in idx]); cur=rot(R,cur)
d=max(p95(nn(A,cur)),p95(nn(cur,A)))
res.append((d,det))
return res
if __name__=='__main__':
root=sys.argv[1]; pid=sys.argv[2]; N=int(sys.argv[3]) if len(sys.argv)>3 else 400
rng=random.Random(20261115)
R={}
for side in ('left','right'):
V,F=readply(os.path.join(root,'pairs',pid,side+'.ply')); R[side]=info(V,F,rng,N)
a,b=R['left'],R['right']
A=proj(a['Q'],a['vec']); B=proj(b['Q'],b['vec'])
al=align(A,B)
rg=(a['rg']+b['rg'])/2
bp=min(d for d,det in al if det>0)/rg; bi=min(d for d,det in al if det<0)/rg
def s(x): return {k:(round(v,4) if isinstance(v,float) else v) for k,v in x.items() if k in('nv','nf','chi','comps','area','absvol','rg')}
k=a['rg']/b['rg']; Bk=[(p[0]*k,p[1]*k,p[2]*k) for p in B]; al2=align(A,Bk)
sp=min(d for d,det in al2 if det>0)/a['rg']; si=min(d for d,det in al2 if det<0)/a['rg']
print(json.dumps(dict(sf_proper=round(sp,4),sf_improper=round(si,4),pid=pid[:8],L=s(a),R=s(b),sqrtev_L=[round(math.sqrt(max(e,0)),3) for e in a['ev']],sqrtev_R=[round(math.sqrt(max(e,0)),3) for e in b['ev']],p95_proper_over_rg=round(bp,4),p95_improper_over_rg=round(bi,4))))