dymokomi/luce-cad
Source of release 0.9.3
0.9.3 / tests / contracts / trim_predicates_contract.lucb
## Predicate regressions with exact-rational binary64 signs, not STEP fixtures.
from luce_std import math
from ear_remainder_contract import ear_remainder_contract
from improve_contract import improve_contract
from luce_geocore.geocore import Vector3, invalid
from trim_domain_contract import trim_domains
from trim_seam_contract import trim_seam_contract
from polygons import side, intersects, inside_triangle, ray_crosses
pub func trim_predicate_contracts() -> !:
try trim_seam_contract()
try ear_remainder_contract()
try improve_contract()
try orientations()
try segments()
try membership()
try trim_domains()
func orientations() -> !:
# Python Fraction.from_float evaluated these determinants independently.
# Ordinary subtract/multiply orientation returns zero or the wrong sign.
let cases = [
[-604.7053479925677,194.37486417341597,893.1550667894294,87.08141095047722,370.5546490593406,124.5158760853158,-1.0],
[562.0018212392683,812.2899523077187,-808.5067649102277,-390.8359210339461,-1980.315025733606,-1419.5291021201674,1.0],
[-606.479267540117,673.8996699509219,-858.1099104508298,-17.001917327306387,-934.1944195034039,-225.90695156179223,1.0],
[-715.7166817569636,559.356838378118,-161.63925382668447,-251.1264661333039,-401.83956925618986,100.22938339335879,1.0],
[353.81868419203215,-499.35391933796257,-545.2802699886442,844.3144616336228,1244.8056866496727,-1830.8993042950062,1.0],
[-383.74498344003905,959.9087303607896,376.78653416521865,72.32381130862404,224.94233444095505,249.53490460450243,-1.0],
[189.41638418713774,-908.5073900870813,-137.1820227197311,472.3808319087418,-213.955945350192,796.9880659760322,-1.0],
[493.6812063250036,-651.7850243651319,-127.77726643872472,287.1353204206839,-227.61787934042616,437.9778735399694,-1.0],
[149.79488742117428,394.4450469487772,-147.1482571456546,780.7209254527825,-114.28299548167729,737.9684388108161,-1.0],
[553.6375974749146,662.3992530917085,-576.2829327612806,-487.0949997361578,-234.47035644496657,-139.36117111216024,-1.0],
[-667.6975623050682,175.08694779695475,412.5793125749972,351.98852560482646,1007.1900079499785,449.35946137066713,-1.0],
[-384.215901706712,696.8023776268842,695.8304320034867,-697.4716469162909,558.8075364740333,-520.5834356965744,-1.0]]
for values in cases:
for exponent in [-20,0,20]:
let scale = math.scalbn(1.0,(i32)exponent)
for axis in 0..<3:
let a = embed(Vector3(values[0]*scale,values[1]*scale,0.0),axis)
let b = embed(Vector3(values[2]*scale,values[3]*scale,0.0),axis)
let c = embed(Vector3(values[4]*scale,values[5]*scale,0.0),axis)
let n = normal(axis)
let wanted = (i64)values[6]
if side(a,b,c,n) != wanted or side(b,c,a,n) != wanted or side(c,a,b,n) != wanted:
error(invalid,"filtered orientation disagrees with exact binary64 determinant")
if side(b,a,c,n) != -wanted or side(a,b,c,n.multiply_scalar(-1.0)) != -wanted:
error(invalid,"orientation must reverse with winding or plane normal")
if side(a,b,a,n) != 0: error(invalid,"coincident determinant must be exactly zero")
func segments() -> !:
for scale in [0.00000095367431640625,1.0,1048576.0]:
for axis in 0..<3:
for reverse in [false,true]:
let n = normal(axis).multiply_scalar(-1.0 if reverse else 1.0)
for variant in 0..<6:
let tiny = 1.0/1099511627776.0
let a = Vector3()
let b = Vector3(1.0,0.0,0.0)
let c = Vector3(0.5,-1.0,0.0) if variant == 0 else (Vector3(1.0,0.0,0.0) if variant == 1 else (Vector3(0.5,0.0,0.0) if variant == 2 else (Vector3(1.0+tiny,0.0,0.0) if variant == 3 else Vector3(0.25,tiny,0.0))))
let d = Vector3(0.5,1.0,0.0) if variant == 0 else (Vector3(2.0,0.0,0.0) if variant < 4 else (Vector3(0.75,tiny,0.0) if variant == 4 else Vector3(0.75,-tiny,0.0)))
let expected = variant < 3 or variant == 5
let pa = embed(a.multiply_scalar(scale),axis)
let pb = embed(b.multiply_scalar(scale),axis)
let pc = embed(c.multiply_scalar(scale),axis)
let pd = embed(d.multiply_scalar(scale),axis)
if intersects(pa,pb,pc,pd,n) != expected or intersects(pd,pc,pb,pa,n) != expected:
error(invalid,"trim intersection confused nearness with crossing or touching")
# The caller accepts small planarity residuals. Predicate boxes must use
# the same projection as orientation, not reject disjoint discarded Zs.
if not intersects(Vector3(0.0,0.0,1e-10),Vector3(1.0,1.0,1e-10),Vector3(0.0,1.0,-1e-10),Vector3(1.0,0.0,-1e-10),Vector3(0.0,0.0,1.0)):
error(invalid,"planar intersection used the discarded coordinate")
func embed(p: Vector3, axis: i64) -> Vector3:
return Vector3(0.0,p.x,p.y) if axis == 0 else (Vector3(p.y,0.0,p.x) if axis == 1 else p)
func normal(axis: i64) -> Vector3:
return Vector3(1.0,0.0,0.0) if axis == 0 else (Vector3(0.0,1.0,0.0) if axis == 1 else Vector3(0.0,0.0,1.0))
func membership() -> !:
for scale in [0.00000095367431640625,1.0,1048576.0]:
for axis in 0..<3:
for reverse in [false,true]:
let n = normal(axis).multiply_scalar(-1.0 if reverse else 1.0)
let a = embed(Vector3(),axis)
let b = embed(Vector3(scale,0.0,0.0),axis)
let c = embed(Vector3(0.0,scale,0.0),axis)
let tiny = scale/1099511627776.0
let locations = [Vector3(scale*0.25,scale*0.25,0.0),Vector3(scale*0.5,scale*0.5,0.0),Vector3(scale*0.5,scale*0.5+tiny,0.0),Vector3(scale*0.5,-tiny,0.0)]
for at in 0..<locations.length:
if inside_triangle(a,c if reverse else b,b if reverse else c,embed(locations[at],axis),n) != (at < 2):
error(invalid,"ear membership confused a nearby outside point with an inside point")
let x = embed(Vector3(scale,-scale,0.0),axis)
let y = embed(Vector3(scale,scale,0.0),axis)
for offset in [-tiny,tiny]:
let p = embed(Vector3(scale+offset,0.0,0.0),axis)
if ray_crosses(x,y,p,n) != (offset < 0.0) or ray_crosses(y,x,p,n) != (offset < 0.0):
error(invalid,"ray crossing confused sides or changed with edge direction")
if ray_crosses(x,y,y,n): error(invalid,"ray crossing must exclude the upper endpoint")