import bpy, bmesh, json
from mathutils import Vector
from mathutils.bvhtree import BVHTree

dg = bpy.context.evaluated_depsgraph_get()
tris, names, verts = [], [], []
bm = bmesh.new()
owner = []
for ob in bpy.data.objects:
    if ob.type != 'MESH':
        continue
    me = ob.evaluated_get(dg).to_mesh()
    base = len(bm.verts)
    for v in me.vertices:
        bm.verts.new(ob.matrix_world @ v.co)
    bm.verts.ensure_lookup_table()
    for p in me.polygons:
        vs = [bm.verts[base + i] for i in p.vertices]
        try:
            bm.faces.new(vs)
        except ValueError:
            pass
        owner.append(ob.name)
    ob.evaluated_get(dg).to_mesh_clear()
bmesh.ops.triangulate(bm, faces=bm.faces[:])
bm.faces.ensure_lookup_table()
# owner per triangle is lost after triangulate: rebuild by per-object BVH instead
bm.free()

trees = {}
for ob in bpy.data.objects:
    if ob.type != 'MESH':
        continue
    e = ob.evaluated_get(dg)
    me = e.to_mesh()
    vs = [ob.matrix_world @ v.co for v in me.vertices]
    ps = [tuple(p.vertices) for p in me.polygons]
    trees[ob.name] = BVHTree.FromPolygons(vs, ps)
    e.to_mesh_clear()

def first_hit(origin, d, maxd=400):
    best = None
    for n, t in trees.items():
        h = t.ray_cast(origin, d, maxd)
        if h[0] is not None and (best is None or h[3] < best[0]):
            best = (h[3], n, h[0].y)
    return best

out = []
for z in (1.0, 1.7, 3.0, 4.4):
    for x in (-4, -2, 0, 2, 4):
        h = first_hit(Vector((x, -100.0, z)), Vector((0, 1, 0)))
        out.append({"x": x, "z": z, "hit_obj": h[1] if h else None, "hit_y": round(h[2], 2) if h else None})
# also check a wider gap at portal height for blocking objects between y=-100 and the lobby back wall
back = {o["hit_obj"] for o in out}
res = {"hits": out, "distinct_first_hit_objects": sorted(str(b) for b in back)}
json.dump(res, open(r"C:\q2\out\entry_ray_independent.json", "w"), indent=1)
print("RAYDONE", sorted(str(b) for b in back), set(o["hit_y"] for o in out))
