-#include <assert.h>
+#include <stdlib.h>
#include <float.h>
#include <algorithm>
#include "geom.h"
+#include "app.h"
+
+#define SPHERE(ptr) ((Sphere*)ptr)
+#define AABOX(ptr) ((AABox*)ptr)
+#define BOX(ptr) ((Box*)ptr)
+#define PLANE(ptr) ((Plane*)ptr)
+
+GeomObject::GeomObject()
+{
+ type = GOBJ_UNKNOWN;
+}
GeomObject::~GeomObject()
{
}
+bool GeomObject::valid() const
+{
+ return true;
+}
+
+void GeomObject::invalidate()
+{
+}
+
+float GeomObject::distance(const Vec3 &v) const
+{
+ return sqrt(distance_sq(v));
+}
+
+float GeomObject::signed_distance(const Vec3 &v) const
+{
+ return sqrt(signed_distance_sq(v));
+}
Sphere::Sphere()
{
+ type = GOBJ_SPHERE;
radius = 1.0;
}
Sphere::Sphere(const Vec3 ¢, float radius)
: center(cent)
{
+ type = GOBJ_SPHERE;
this->radius = radius;
}
-void Sphere::set_union(const GeomObject *obj1, const GeomObject *obj2)
+bool Sphere::valid() const
{
- const Sphere *sph1 = dynamic_cast<const Sphere*>(obj1);
- const Sphere *sph2 = dynamic_cast<const Sphere*>(obj2);
-
- if(!sph1 || !sph2) {
- fprintf(stderr, "Sphere::set_union: arguments must be spheres");
- return;
- }
-
- float dist = length(sph1->center - sph2->center);
- float surf_dist = dist - (sph1->radius + sph2->radius);
- float d1 = sph1->radius + surf_dist / 2.0;
- float d2 = sph2->radius + surf_dist / 2.0;
- float t = d1 / (d1 + d2);
-
- if(t < 0.0) t = 0.0;
- if(t > 1.0) t = 1.0;
-
- center = sph1->center * t + sph2->center * (1.0 - t);
- radius = std::max(dist * t + sph2->radius, dist * (1.0f - t) + sph1->radius);
+ return radius >= 0.0f;
}
-void Sphere::set_intersection(const GeomObject *obj1, const GeomObject *obj2)
+void Sphere::invalidate()
{
- fprintf(stderr, "Sphere::intersection undefined\n");
+ center = Vec3(0, 0, 0);
+ radius = -1;
}
bool Sphere::intersect(const Ray &ray, HitPoint *hit) const
return true;
}
+bool Sphere::contains(const Vec3 &pt) const
+{
+ return length_sq(pt - center) <= radius * radius;
+}
+
+float Sphere::distance_sq(const Vec3 &v) const
+{
+ return std::max(length_sq(v - center) - radius * radius, 0.0f);
+}
+
+float Sphere::signed_distance_sq(const Vec3 &v) const
+{
+ return length_sq(v - center) - radius * radius;
+}
AABox::AABox()
{
+ type = GOBJ_AABOX;
}
AABox::AABox(const Vec3 &vmin, const Vec3 &vmax)
: min(vmin), max(vmax)
{
+ type = GOBJ_AABOX;
}
-void AABox::set_union(const GeomObject *obj1, const GeomObject *obj2)
+bool AABox::valid() const
{
- const AABox *box1 = dynamic_cast<const AABox*>(obj1);
- const AABox *box2 = dynamic_cast<const AABox*>(obj2);
-
- if(!box1 || !box2) {
- fprintf(stderr, "AABox::set_union: arguments must be AABoxes too\n");
- return;
- }
-
- min.x = std::min(box1->min.x, box2->min.x);
- min.y = std::min(box1->min.y, box2->min.y);
- min.z = std::min(box1->min.z, box2->min.z);
-
- max.x = std::max(box1->max.x, box2->max.x);
- max.y = std::max(box1->max.y, box2->max.y);
- max.z = std::max(box1->max.z, box2->max.z);
+ return min.x <= max.x && min.y <= max.y && min.z <= max.z;
}
-void AABox::set_intersection(const GeomObject *obj1, const GeomObject *obj2)
+void AABox::invalidate()
{
- const AABox *box1 = dynamic_cast<const AABox*>(obj1);
- const AABox *box2 = dynamic_cast<const AABox*>(obj2);
-
- if(!box1 || !box2) {
- fprintf(stderr, "AABox::set_intersection: arguments must be AABoxes too\n");
- return;
- }
+ min = Vec3(FLT_MAX, FLT_MAX, FLT_MAX);
+ max = Vec3(-FLT_MAX, -FLT_MAX, -FLT_MAX);
+}
- for(int i=0; i<3; i++) {
- min[i] = std::max(box1->min[i], box2->min[i]);
- max[i] = std::min(box1->max[i], box2->max[i]);
+Vec3 AABox::get_corner(int idx) const
+{
+ Vec3 v[] = {min, max};
+ static const int xidx[] = {0, 1, 1, 0, 0, 1, 1, 0};
+ static const int yidx[] = {0, 0, 0, 0, 1, 1, 1, 1};
+ static const int zidx[] = {0, 0, 1, 1, 0, 0, 1, 1};
+ return Vec3(v[xidx[idx]].x, v[yidx[idx]].y, v[zidx[idx]].z);
+}
- if(max[i] < min[i]) {
- max[i] = min[i];
- }
+Plane AABox::get_plane(int pidx) const
+{
+ switch(pidx) {
+ case AABOX_PLANE_PX:
+ return Plane(Vec3(max.x, 0, 0), Vec3(1, 0, 0));
+ case AABOX_PLANE_NX:
+ return Plane(Vec3(min.x, 0, 0), Vec3(-1, 0, 0));
+ case AABOX_PLANE_PY:
+ return Plane(Vec3(0, max.x, 0), Vec3(0, 1, 0));
+ case AABOX_PLANE_NY:
+ return Plane(Vec3(0, min.x, 0), Vec3(0, -1, 0));
+ case AABOX_PLANE_PZ:
+ return Plane(Vec3(0, 0, max.z), Vec3(0, 0, 1));
+ case AABOX_PLANE_NZ:
+ return Plane(Vec3(0, 0, min.z), Vec3(0, 0, -1));
+ default:
+ break;
}
+ abort();
+ return Plane();
}
bool AABox::intersect(const Ray &ray, HitPoint *hit) const
{
Vec3 param[2] = {min, max};
+#ifndef NDEBUG
+ Vec3 inv_dir;
+ if(fpexcept_enabled) {
+ inv_dir.x = ray.dir.x == 0.0f ? 1.0f : 1.0f / ray.dir.x;
+ inv_dir.y = ray.dir.y == 0.0f ? 1.0f : 1.0f / ray.dir.y;
+ inv_dir.z = ray.dir.z == 0.0f ? 1.0f : 1.0f / ray.dir.z;
+ } else {
+ inv_dir = Vec3(1.0 / ray.dir.x, 1.0 / ray.dir.y, 1.0 / ray.dir.z);
+ }
+#else
Vec3 inv_dir(1.0 / ray.dir.x, 1.0 / ray.dir.y, 1.0 / ray.dir.z);
+#endif
int sign[3] = {inv_dir.x < 0, inv_dir.y < 0, inv_dir.z < 0};
float tmin = (param[sign[0]].x - ray.origin.x) * inv_dir.x;
return true;
}
return false;
+}
+
+bool AABox::contains(const Vec3 &v) const
+{
+ return v.x >= min.x && v.y >= min.y && v.z >= min.z &&
+ v.x <= max.x && v.y <= max.y && v.z <= max.z;
+}
+
+#define SQ(x) ((x) * (x))
+float AABox::distance_sq(const Vec3 &v) const
+{
+ float dsq = 0.0f;
+
+ for(int i=0; i<3; i++) {
+ if(v[i] < min[i]) dsq += SQ(min[i] - v[i]);
+ if(v[i] > max[i]) dsq += SQ(v[i] - max[i]);
+ }
+ return dsq;
+}
+
+float AABox::signed_distance_sq(const Vec3 &v) const
+{
+ if(!contains(v)) {
+ return distance_sq(v);
+ }
+
+ float dsq = 0.0f;
+ for(int i=0; i<3; i++) {
+ float dmin = v[i] - min[i];
+ float dmax = max[i] - v[i];
+ dsq -= dmin < dmax ? SQ(dmin) : SQ(dmax);
+ }
+ return dsq;
+}
+Box::Box()
+{
+ type = GOBJ_BOX;
+}
+
+Box::Box(const AABox &aabox, const Mat4 &xform)
+ : xform(xform)
+{
+ type = GOBJ_BOX;
+ min = aabox.min;
+ max = aabox.max;
+}
+
+void Box::invalidate()
+{
+ AABox::invalidate();
+ xform = Mat4::identity;
+}
+
+Box::Box(const Vec3 &min, const Vec3 &max)
+ : AABox(min, max)
+{
+ type = GOBJ_BOX;
+}
+
+Box::Box(const Vec3 &min, const Vec3 &max, const Mat4 &xform)
+ : AABox(min, max), xform(xform)
+{
+ type = GOBJ_BOX;
+}
+
+// XXX all this shit is completely untested
+Box::Box(const Vec3 &pos, const Vec3 &vi, const Vec3 &vj, const Vec3 &vk)
+{
+ type = GOBJ_BOX;
+ float ilen = length(vi);
+ float jlen = length(vj);
+ float klen = length(vk);
+
+ min = Vec3(-ilen, -jlen, -klen);
+ max = Vec3(ilen, jlen, klen);
+
+ float si = ilen == 0.0 ? 1.0 : 1.0 / ilen;
+ float sj = jlen == 0.0 ? 1.0 : 1.0 / jlen;
+ float sk = klen == 0.0 ? 1.0 : 1.0 / klen;
+
+ xform = Mat4(vi * si, vj * sj, vk * sk);
+ xform.translate(pos);
+}
+
+Box::Box(const Vec3 *varr, int vcount)
+{
+ type = GOBJ_BOX;
+ calc_bounding_aabox(this, varr, vcount);
+}
+
+Vec3 Box::get_corner(int idx) const
+{
+ return xform * AABox::get_corner(idx);
+}
+
+bool Box::intersect(const Ray &ray, HitPoint *hit) const
+{
+ Mat4 inv_xform = inverse(xform);
+ Mat4 dir_inv_xform = inv_xform.upper3x3();
+ Mat4 dir_xform = transpose(dir_inv_xform);
+ Ray local_ray = Ray(inv_xform * ray.origin, dir_inv_xform * ray.dir);
+
+ bool res = AABox::intersect(local_ray, hit);
+ if(!res || !hit) return res;
+
+ hit->pos = xform * hit->pos;
+ hit->normal = dir_xform * hit->normal;
+ hit->local_ray = local_ray;
+ hit->ray = ray;
+ return true;
+}
+
+bool Box::contains(const Vec3 &pt) const
+{
+ // XXX is it faster to extract 6 planes and do dot products? sounds marginal
+ return AABox::contains(inverse(xform) * pt);
+}
+
+float Box::distance_sq(const Vec3 &v) const
+{
+ return 0.0f; // TODO
+}
+
+float Box::signed_distance_sq(const Vec3 &v) const
+{
+ return 0.0f; // TODO
}
Plane::Plane()
: normal(0.0, 1.0, 0.0)
{
+ type = GOBJ_PLANE;
}
Plane::Plane(const Vec3 &p, const Vec3 &norm)
: pt(p)
{
+ type = GOBJ_PLANE;
normal = normalize(norm);
}
Plane::Plane(const Vec3 &p1, const Vec3 &p2, const Vec3 &p3)
: pt(p1)
{
+ type = GOBJ_PLANE;
normal = normalize(cross(p2 - p1, p3 - p1));
}
Plane::Plane(const Vec3 &normal, float dist)
{
+ type = GOBJ_PLANE;
this->normal = normalize(normal);
pt = this->normal * dist;
}
-void Plane::set_union(const GeomObject *obj1, const GeomObject *obj2)
-{
- fprintf(stderr, "Plane::set_union undefined\n");
-}
-
-void Plane::set_intersection(const GeomObject *obj1, const GeomObject *obj2)
-{
- fprintf(stderr, "Plane::set_intersection undefined\n");
-}
-
bool Plane::intersect(const Ray &ray, HitPoint *hit) const
{
float ndotdir = dot(normal, ray.dir);
return true;
}
-float sphere_distance(const Vec3 ¢, float rad, const Vec3 &pt)
+bool Plane::contains(const Vec3 &v) const
+{
+ return dot(v, normal) <= 0.0;
+}
+
+float Plane::distance(const Vec3 &v) const
+{
+ return std::max(dot(v - pt, normal), 0.0f);
+}
+
+float Plane::signed_distance(const Vec3 &v) const
{
- return length(pt - cent) - rad;
+ return dot(v - pt, normal);
}
-// TODO version which takes both radii into account
-float capsule_distance(const Vec3 &a, float ra, const Vec3 &b, float rb, const Vec3 &pt)
+float Plane::distance_sq(const Vec3 &v) const
{
- Vec3 ab_dir = b - a;
- float ab_len_sq = length_sq(ab_dir);
+ float d = distance(v);
+ return d * d;
+}
+
+float Plane::signed_distance_sq(const Vec3 &v) const
+{
+ float d = distance(v);
+ return dot(v, normal) >= 0.0f ? d * d : -(d * d);
+}
+
+
+Disc::Disc()
+{
+ type = GOBJ_DISC;
+ radius = 1.0;
+}
+
+Disc::Disc(const Vec3 &pt, const Vec3 &normal, float rad)
+ : Plane(pt, normal)
+{
+ type = GOBJ_DISC;
+ radius = rad;
+}
- if(fabs(ab_len_sq) < 1e-5) {
- // if a == b, the capsule is a sphere with radius the maximum of the capsule radii
- return sphere_distance(a, std::max(ra, rb), pt);
+Disc::Disc(const Vec3 &normal, float dist, float rad)
+ : Plane(normal, dist)
+{
+ type = GOBJ_DISC;
+ radius = rad;
+}
+
+bool Disc::valid() const
+{
+ return radius >= 0.0f;
+}
+
+void Disc::invalidate()
+{
+ radius = -1;
+}
+
+bool Disc::intersect(const Ray &ray, HitPoint *hit) const
+{
+ HitPoint phit;
+ if(Plane::intersect(ray, &phit)) {
+ if(length_sq(phit.pos - pt) <= radius * radius) {
+ *hit = phit;
+ return true;
+ }
+ }
+ return false;
+}
+
+bool Disc::contains(const Vec3 &pt) const
+{
+ Vec3 pj = proj_point_plane(pt, *this);
+ return length_sq(pj - this->pt) <= radius * radius;
+}
+
+float Disc::distance_sq(const Vec3 &v) const
+{
+ return 0.0; // TODO
+}
+
+float Disc::signed_distance_sq(const Vec3 &v) const
+{
+ return 0.0; // TODO
+}
+
+
+Vec3 proj_point_plane(const Vec3 &pt, const Plane &plane)
+{
+ float dist = plane.signed_distance(pt);
+ return pt - plane.normal * dist;
+}
+
+// ---- bounding sphere calculations ----
+
+bool calc_bounding_sphere(Sphere *sph, const GeomObject *obj)
+{
+ if(!obj->valid()) {
+ sph->invalidate();
+ return true;
+ }
+
+ switch(obj->type) {
+ case GOBJ_SPHERE:
+ *sph = *(Sphere*)obj;
+ break;
+
+ case GOBJ_AABOX:
+ sph->center = (AABOX(obj)->min + AABOX(obj)->max) * 0.5;
+ sph->radius = length(AABOX(obj)->max - AABOX(obj)->min) * 0.5;
+ break;
+
+ case GOBJ_BOX:
+ sph->center = (BOX(obj)->min + BOX(obj)->max) * 0.5 + BOX(obj)->xform.get_translation();
+ sph->radius = length(BOX(obj)->max - BOX(obj)->min) * 0.5;
+ break;
+
+ case GOBJ_PLANE:
+ default:
+ return false;
+ }
+ return true;
+}
+
+bool calc_bounding_sphere(Sphere *sph, const GeomObject *a, const GeomObject *b)
+{
+ Sphere bsa, bsb;
+
+ if(!calc_bounding_sphere(&bsa, a) || !calc_bounding_sphere(&bsb, b)) {
+ return false;
+ }
+
+ float dist = length(bsa.center - bsb.center);
+ float surf_dist = dist - (bsa.radius + bsb.radius);
+ float d1 = bsa.radius + surf_dist / 2.0;
+ float d2 = bsb.radius + surf_dist / 2.0;
+ float t = d1 / (d1 + d2);
+
+ if(t < 0.0) t = 0.0;
+ if(t > 1.0) t = 1.0;
+
+ sph->center = bsa.center * t + bsb.center * (1.0 - t);
+ sph->radius = std::max(dist * t + bsb.radius, dist * (1.0f - t) + bsa.radius);
+ return true;
+}
+
+bool calc_bounding_sphere(Sphere *sph, const GeomObject **objv, int num)
+{
+ if(num <= 0) return false;
+
+ if(!calc_bounding_sphere(sph, objv[0])) {
+ return false;
+ }
+
+ for(int i=1; i<num; i++) {
+ if(!calc_bounding_sphere(sph, sph, objv[i])) {
+ return false;
+ }
+ }
+ return true;
+}
+
+bool calc_bounding_sphere(Sphere *sph, const Vec3 *v, int num, const Mat4 &xform)
+{
+ if(num <= 0) return false;
+
+ sph->center = Vec3(0.0, 0.0, 0.0);
+ for(int i=0; i<num; i++) {
+ sph->center += xform * v[i];
+ }
+ sph->center /= (float)num;
+
+ float rad_sq = 0.0f;
+ for(int i=0; i<num; i++) {
+ Vec3 dir = xform * v[i] - sph->center;
+ rad_sq = std::max(rad_sq, dot(dir, dir));
}
- float ab_len = sqrt(ab_len_sq);
+ sph->radius = sqrt(rad_sq);
+ return true;
+}
+
+bool calc_bounding_aabox(AABox *box, const GeomObject *obj)
+{
+ if(!obj->valid()) {
+ box->invalidate();
+ return true;
+ }
+
+ switch(obj->type) {
+ case GOBJ_AABOX:
+ *box = *(AABox*)obj;
+ break;
+
+ case GOBJ_BOX:
+ {
+ Vec3 v[8];
+ for(int i=0; i<8; i++) {
+ v[i] = BOX(obj)->get_corner(i);
+ }
+ calc_bounding_aabox(box, v, 8);
+ }
+ break;
- Vec3 ap_dir = pt - a;
+ case GOBJ_SPHERE:
+ {
+ float r = SPHERE(obj)->radius;
+ box->min = SPHERE(obj)->center - Vec3(r, r, r);
+ box->max = SPHERE(obj)->center + Vec3(r, r, r);
+ }
+ break;
- float t = dot(ap_dir, ab_dir / ab_len) / ab_len;
- if(t < 0.0) {
- return sphere_distance(a, ra, pt);
+ case GOBJ_PLANE:
+ default:
+ return false;
}
- if(t >= 1.0) {
- return sphere_distance(b, rb, pt);
+ return true;
+}
+
+bool calc_bounding_aabox(AABox *box, const GeomObject *a, const GeomObject *b)
+{
+ AABox bba, bbb;
+
+ if(!calc_bounding_aabox(&bba, a) || !calc_bounding_aabox(&bbb, b)) {
+ return false;
}
- Vec3 pproj = a + ab_dir * t;
- return length(pproj - pt) - ra;
+ for(int i=0; i<3; i++) {
+ box->min[i] = std::min(bba.min[i], bbb.min[i]);
+ box->max[i] = std::max(bba.max[i], bbb.max[i]);
+ }
+ return true;
}
-#if 0
-float capsule_distance(const Vec3 &a, float ra, const Vec3 &b, float rb, const Vec3 &pt)
+bool calc_bounding_aabox(AABox *box, const GeomObject **objv, int num)
{
- Vec3 ab_dir = b - a;
+ if(num <= 0) return false;
+
+ if(!calc_bounding_aabox(box, objv[0])) {
+ return false;
+ }
- if(fabs(length_sq(ab_dir)) < 1e-5) {
- // if a == b, the capsule is a sphere with radius the maximum of the capsule radii
- return sphere_distance(a, std::max(ra, rb), pt);
+ for(int i=1; i<num; i++) {
+ if(!calc_bounding_aabox(box, box, objv[i])) {
+ return false;
+ }
}
- float ab_len = length(ab_dir);
+ return true;
+}
+
+bool calc_bounding_aabox(AABox *box, const Vec3 *v, int num, const Mat4 &xform)
+{
+ if(num <= 0) return false;
- Vec3 ap_dir = pt - a;
- Vec3 rotaxis = normalize(cross(ab_dir, ap_dir));
+ box->min = box->max = xform * v[0];
+ for(int i=1; i<num; i++) {
+ Vec3 p = xform * v[i];
- Mat4 rmat;
- rmat.set_rotation(rotaxis, M_PI / 2.0);
- Vec3 right = rmat * ab_dir / ab_len;
+ for(int j=0; j<3; j++) {
+ box->min[j] = std::min(box->min[j], p[j]);
+ box->max[j] = std::max(box->max[j], p[j]);
+ }
+ }
+ return true;
+}
- // XXX I think this check is redundant, always false, due to the cross product order
- //assert(dot(right, ab_dir) >= 0.0);
- if(dot(right, ab_dir) < 0.0) {
- right = -right;
+bool calc_bounding_box(Box *box, const GeomObject *obj)
+{
+ if(!obj->valid()) {
+ box->invalidate();
+ return true;
}
- Vec3 aa = a + right * ra;
- Vec3 bb = b + right * rb;
- // project pt to the line segment bb-aa, see if the projection lies within the interval [0, 1)
- Vec3 aabb_dir = bb - aa;
- float aabb_len = length(aabb_dir);
- Vec3 aap_dir = pt - aa;
+ switch(obj->type) {
+ case GOBJ_BOX:
+ *box = *(Box*)obj;
+ break;
+
+ case GOBJ_AABOX:
+ box->min = BOX(obj)->min;
+ box->max = BOX(obj)->max;
+ box->xform = Mat4::identity;
+ break;
+
+ case GOBJ_SPHERE:
+ {
+ float r = SPHERE(obj)->radius;
+ box->min = SPHERE(obj)->center - Vec3(r, r, r);
+ box->max = SPHERE(obj)->center + Vec3(r, r, r);
+ box->xform = Mat4::identity;
+ }
+ break;
- float t = dot(aap_dir, aabb_dir / aabb_len) / aabb_len;
- if(t < 0.0) {
- return sphere_distance(a, ra, pt);
+ case GOBJ_PLANE:
+ default:
+ return false;
}
- if(t >= 1.0) {
- return sphere_distance(b, rb, pt);
+ return true;
+}
+
+bool intersect_sphere_sphere(Disc *result, const Sphere &a, const Sphere &b)
+{
+ Vec3 dir = b.center - a.center;
+
+ float dist_sq = length_sq(dir);
+ if(dist_sq <= 1e-8) return false;
+
+ float rsum = a.radius + b.radius;
+ float rdif = fabs(a.radius - b.radius);
+ if(dist_sq > rsum * rsum || dist_sq < rdif * rdif) {
+ return false;
}
- Vec3 ppt = aa + aabb_dir * t;
- Vec3 norm = ppt - pt;
- float dist = length(norm);
+ float dist = sqrt(dist_sq);
+ float t = (dist_sq + a.radius * a.radius - b.radius * b.radius) / (2.0 * sqrt(dist_sq));
+
+ result->pt = a.center + dir * t;
+ result->normal = dir / dist;
+ result->radius = sin(acos(t)) * a.radius;
+ return true;
+}
+
+bool intersect_plane_plane(Ray *result, const Plane &a, const Plane &b)
+{
+ return false; // TODO
+}
+
+bool intersect_sphere_plane(Sphere *result, const Sphere &s, const Plane &p)
+{
+ return false; // TODO
+}
+
+bool intersect_plane_sphere(Sphere *result, const Plane &p, const Sphere &s)
+{
+ return false; // TODO
+}
- if(dot(norm, right) < 0.0) {
- // inside the cone
- dist = -dist;
+bool intersect_aabox_aabox(AABox *res, const AABox &a, const AABox &b)
+{
+ for(int i=0; i<3; i++) {
+ res->min[i] = std::max(a.min[i], b.min[i]);
+ res->max[i] = std::min(a.max[i], b.max[i]);
+
+ if(res->max[i] < res->min[i]) {
+ res->max[i] = res->min[i];
+ }
}
- return dist;
+ return res->min.x != res->max.x && res->min.y != res->max.y && res->min.z != res->max.z;
+}
+
+bool collision_sphere_aabox(const Sphere &s, const AABox &b)
+{
+ return b.distance_sq(s.center) <= s.radius * s.radius;
}
-#endif
projects / laserbrain_demo / blobdiff