dymokomi/luce-cad
Source of release 0.9.2
0.9.2 / tests / contracts / flow_admission_contract.lucb
## Late smooth-seam vertices must remain stitched without forcing sliver rows.
from luce_std import math
import memory
from luce_geocore.geocore import Vector3, invalid
from geometry import Surface, Curve, BrepFace
from extruded_flow_contract import extruded_flow_contract
from polygons import TrimGrid
from layout import GridLayout, Stations, UVChain, cached, accept_plane_row
from tessellation import reconcile
pub func flow_admission_contract() -> !:
try extruded_flow_contract()
for scale in [0.1, 1.0, 10.0]:
for swap in [false, true]:
for reverse in [false, true]:
for crowded in [false, true]:
for independent in [false, true]: try late_row(scale, swap, reverse, crowded, independent)
var along = Stations()
var across = Stations()
try along.open(16)
defer along.close()
try across.open(16)
defer across.close()
for value in [0.0, 500.0]: _ = try along.insert(value, 1e-12)
for value in [0.0, 1.0]: _ = try across.insert(value, 1e-12)
# A near-end subdivision that improves an already long cell stays useful.
if not accept_plane_row(along, across, 10.0, 0.0, 500.0, 0.0, 1.0, 1e-12):
error(invalid, "flow admission rejected an improving subdivision")
for scale in [0.001, 1.0, 1000.0]:
along.count = 0
across.count = 0
for value in [0.0, 0.15 * scale]: _ = try along.insert(value, scale * 1e-12)
for value in [0.0, 0.01 * scale, 0.4 * scale]: _ = try across.insert(value, scale * 1e-12)
for value in [0.014 * scale, 0.136 * scale]:
if accept_plane_row(along, across, value, 0.0, 0.15 * scale, 0.0, 0.4 * scale, scale * 1e-12):
error(invalid, "an unrelated skinny rectangle masked damage to a healthy row")
func late_row(scale: f64, swap: bool, reverse: bool, crowded: bool, independent: bool) -> !:
var empty_points: Vector3[]
var empty_numbers: f64[]
let vertices = [Vector3(), Vector3(10.0 * scale, 0.0, 0.0), Vector3(10.0 * scale, 0.5 * scale, 0.0), Vector3(0.0, 0.5 * scale, 0.0)]
let edges = [try line(vertices, 0), try line(vertices, 1), try line(vertices, 2), try line(vertices, 3)]
defer:
for edge in edges: edge.close()
let face = try BrepFace(0, [-4, -3, -2, -1] if reverse else [1, 2, 3, 4], [4], not reverse)
defer face.close()
let s = try Surface(0, Vector3(), Vector3(0.0, 1.0, 0.0) if swap else Vector3(1.0, 0.0, 0.0), Vector3(0.0, 0.0, 1.0), 0.0, 0.0, empty_points, empty_numbers, empty_numbers, empty_numbers, 0, 0, 0, 0)
defer s.close()
var cuts = [Stations(), Stations(), Stations(), Stations()]
defer:
for cut in cuts: cut.close()
for at in 0..<(usize)4:
try cuts[at].open(128)
for t in [0.0, 1.0]: _ = try cuts[at].insert(t, 1e-12)
let late = 0.02 if crowded else 0.5
_ = try cuts[3].insert(late, 1e-12)
var plan = GridLayout()
defer plan.close()
plan.valid = true
plan.independent_phase = independent
plan.epsilon = scale * 1e-9
plan.trim_low = Vector3(0.0, -10.0 * scale, 0.0) if swap else Vector3()
plan.trim_high = Vector3(0.5 * scale, 0.0, 0.0) if swap else Vector3(10.0 * scale, 0.5 * scale, 0.0)
plan.chains = try new UVChain[4] --- in memory.heap
plan.flow = try new bool[4] --- in memory.heap
for at in 0..<(usize)4:
plan.chains[at] = UVChain()
plan.flow[at] = at == (0 if reverse else (usize)3)
try plan.u.open(128)
try plan.v.open(128)
for x in [-0.1, 0.0, 2.0, 4.0, 6.0, 8.0, 10.0, 10.1]:
if swap: _ = try plan.v.insert(-x * scale, plan.epsilon)
else: _ = try plan.u.insert(x * scale, plan.epsilon)
for y in [-0.005, 0.0, 0.5, 0.505]:
if swap: _ = try plan.u.insert(y * scale, plan.epsilon)
else: _ = try plan.v.insert(y * scale, plan.epsilon)
_ = try reconcile(&plan, face, s, vertices, edges, cuts, scale * 1e-8, true)
let rows = plan.u if swap else plan.v
if rows.count != (4 if crowded and independent else (usize)5): error(invalid, "late planar flow must reject sliver rows and retain useful rows")
if cuts[3].count != 3 or cuts[3].values[1] != late: error(invalid, "rejected interior flow must preserve the canonical edge cut")
let points = try new Vector3[128] --- in memory.heap
defer free(points) in memory.heap
var length: usize = 0
for signed in face.uses:
let index = (usize)(-signed - 1 if signed < 0 else signed - 1)
let uv = try cached(&plan.chains[index if not reverse else 3 - index], s, vertices, edges[index], cuts[index], scale * 1e-8)
for at in 0..<uv.length - 1:
points[length] = uv[at if signed > 0 else uv.length - 1 - at]
length += 1
let mesh = try TrimGrid.clip(points[..<length], [(i64)length], plan.u.values[..<plan.u.count], plan.v.values[..<plan.v.count])
defer mesh.release()
for at in 0..<length:
if (try mesh.value().point((i64)at)).subtract(points[at]).length() != 0.0: error(invalid, "flow termination moved a canonical boundary vertex")
# Retaining a point in the array is insufficient: every exact boundary
# segment must also belong to one polygon, including the late cut.
let a = (i64)at
let b = (i64)((at + 1) % length)
var uses: usize = 0
for polygon in 0..<mesh.value().face_count():
let count = try mesh.value().face_size(polygon)
for corner in 0..<count:
let x = try mesh.value().face_point(polygon, corner)
let y = try mesh.value().face_point(polygon, (corner + 1) % count)
if (x == a and y == b) or (x == b and y == a): uses += 1
if uses != 1: error(invalid, "flow termination lost an exact boundary segment")
var area: f64 = 0.0
for triangle in 0..<mesh.value().index_count() // 3:
var p = [Vector3(), Vector3(), Vector3()]
for at in 0..<(usize)3:
let index = mesh.value().index(triangle * 3 + (i64)at)
defer index.release()
p[at] = try mesh.value().point(try mesh.value().corner_point(try index.get()))
let signed = p[1].subtract(p[0]).cross(p[2].subtract(p[0])).z * 0.5
if signed <= 0.0: error(invalid, "flow termination inverted a display triangle")
area += signed
if math.abs(area - 5.0 * scale * scale) > 1e-10 * scale * scale: error(invalid, "flow termination changed trimmed area")
func line(vertices: const Vector3[], at: usize) -> Curve!:
var numbers: f64[]
return try Curve(0, (i64)at, (i64)((at + 1) % 4), Vector3(), Vector3(), Vector3(), 0.0, [vertices[at], vertices[(at + 1) % 4]], numbers, numbers, 0, true)