Skip to content
Snippets Groups Projects
Select Git revision
  • 9c44cec9789286c6ebf7eeca7fda3b0ac99c10ba
  • master default protected
  • rednatco-v2
  • rednatco
  • test
  • ntc-tube-uniform-color
  • ntc-tube-missing-atoms
  • restore-vertex-array-per-program
  • watlas2
  • dnatco_new
  • cleanup-old-nodejs
  • webmmb
  • fix_auth_seq_id
  • update_deps
  • ext_dev
  • ntc_balls
  • nci-2
  • plugin
  • bugfix-0.4.5
  • nci
  • servers
  • v0.5.0-dev.1
  • v0.4.5
  • v0.4.4
  • v0.4.3
  • v0.4.2
  • v0.4.1
  • v0.4.0
  • v0.3.12
  • v0.3.11
  • v0.3.10
  • v0.3.9
  • v0.3.8
  • v0.3.7
  • v0.3.6
  • v0.3.5
  • v0.3.4
  • v0.3.3
  • v0.3.2
  • v0.3.1
  • v0.3.0
41 results

boundary-helper.ts

Blame
  • boundary-helper.ts 3.28 KiB
    /**
     * Copyright (c) 2018 mol* contributors, licensed under MIT, See LICENSE file for more info.
     *
     * @author David Sehnal <david.sehnal@gmail.com>
     */
    
    import { Vec3 } from 'mol-math/linear-algebra/3d';
    import { Box3D } from './primitives/box3d';
    import { Sphere3D } from './primitives/sphere3d';
    
    export class BoundaryHelper {
        private count = 0;
        private extremes = [Vec3.zero(), Vec3.zero(), Vec3.zero(), Vec3.zero(), Vec3.zero(), Vec3.zero()];
        private u = Vec3.zero();
        private v = Vec3.zero();
    
        tolerance = 0;
        center: Vec3 = Vec3.zero();
        radius = 0;
    
        reset(tolerance: number) {
            Vec3.set(this.center, 0, 0, 0);
            for (let i = 0; i < 6; i++) {
                const e = i % 2 === 0 ? Number.MAX_VALUE : -Number.MAX_VALUE;
                this.extremes[i] = Vec3.create(e, e, e);
            }
            this.radius = 0;
            this.count = 0;
            this.tolerance = tolerance;
        }
    
        boundaryStep(p: Vec3, r: number) {
            updateExtremeMin(0, this.extremes[0], p, r);
            updateExtremeMax(0, this.extremes[1], p, r);
    
            updateExtremeMin(1, this.extremes[2], p, r);
            updateExtremeMax(1, this.extremes[3], p, r);
    
            updateExtremeMin(2, this.extremes[4], p, r);
            updateExtremeMax(2, this.extremes[5], p, r);
            this.count++;
        }
    
        finishIncludeStep() {
            if (this.count === 0) return;
    
            let maxSpan = 0, mI = 0, mJ = 0;
    
            for (let i = 0; i < 5; i++) {
                for (let j = i + 1; j < 6; j++) {
                    const d = Vec3.squaredDistance(this.extremes[i], this.extremes[j]);
                    if (d > maxSpan) {
                        maxSpan = d;
                        mI = i;
                        mJ = j;
                    }
                }
            }
    
            Vec3.add(this.center, this.extremes[mI], this.extremes[mJ]);
            Vec3.scale(this.center, this.center, 0.5);
            this.radius = Vec3.distance(this.center, this.extremes[mI]);
        }
    
        extendStep(p: Vec3, r: number) {
            const d = Vec3.distance(p, this.center);
            if ((1 + this.tolerance) * this.radius >= r + d) return;
    
            Vec3.sub(this.u, p, this.center);
            Vec3.normalize(this.u, this.u);