@pirireis/webglobeplugins 0.15.20-alpha → 0.15.22-alpha

package/util/account/single-attribute-buffer-management/object-store.js

@@ -23,7 +23,7 @@ export class ObjectStore {
             }
         }
     }
-    insertConsecutiveBulk(objects, startOffset) {
+    insertBlock(objects, startOffset) {
         for (let i = 0; i < objects.length; i++) {
             const object = objects[i];
             const offset = startOffset + i;

package/Math/arc-generate-points copy.js

@@ -1,366 +0,0 @@
-// TODO: Delete this file if it is not needed anymore.
-// import { normilze as vec3Normalize, dot as vec3Dot, cross as vec3Cross, scale as vec3Scale, add as vec3Add, sub as vec3Sub } from './vec3';
-// --- Utility Functions for 3D Vector Operations ---
-/**
- * Normalizes a 3D vector to unit length.
- * @param v The input vector.
- * @returns The normalized vector. Returns [0,0,0] if the input vector is a zero vector.
- */
-function vec3Normalize(v) {
-    const len = Math.sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]);
-    if (len < 1e-9) { // Use a small epsilon to handle near-zero vectors
-        return [0, 0, 0];
-    }
-    return [v[0] / len, v[1] / len, v[2] / len];
-}
-/**
- * Calculates the dot product of two 3D vectors.
- * @param v1 The first vector.
- * @param v2 The second vector.
- * @returns The dot product.
- */
-function vec3Dot(v1, v2) {
-    return v1[0] * v2[0] + v1[1] * v2[1] + v1[2] * v2[2];
-}
-/**
- * Calculates the cross product of two 3D vectors.
- * @param v1 The first vector.
- * @param v2 The second vector.
- * @returns The cross product vector.
- */
-function vec3Cross(v1, v2) {
-    return [
-        v1[1] * v2[2] - v1[2] * v2[1],
-        v1[2] * v2[0] - v1[0] * v2[2],
-        v1[0] * v2[1] - v1[1] * v2[0]
-    ];
-}
-/**
- * Scales a 3D vector by a scalar.
- * @param v The input vector.
- * @param s The scalar value.
- * @returns The scaled vector.
- */
-function vec3Scale(v, s) {
-    return [v[0] * s, v[1] * s, v[2] * s];
-}
-/**
- * Adds two 3D vectors.
- * @param v1 The first vector.
- * @param v2 The second vector.
- * @returns The resulting vector.
- */
-function vec3Add(v1, v2) {
-    return [v1[0] + v2[0], v1[1] + v2[1], v1[2] + v2[2]];
-}
-/**
- * Subtracts the second 3D vector from the first.
- * @param v1 The first vector.
- * @param v2 The second vector.
- * @returns The resulting vector.
- */
-function vec3Sub(v1, v2) {
-    return [v1[0] - v2[0], v1[1] - v2[1], v1[2] - v2[2]];
-}
-/**
- * Clamps a numerical value within a specified range.
- * @param value The value to clamp.
- * @param min The minimum allowed value.
- * @param max The maximum allowed value.
- * @returns The clamped value.
- */
-function clamp(value, min, max) {
-    return Math.max(min, Math.min(value, max));
-}
-function vec3Distance(v1, v2) {
-    const dx = v1[0] - v2[0];
-    const dy = v1[1] - v2[1];
-    const dz = v1[2] - v2[2];
-    return Math.sqrt(dx * dx + dy * dy + dz * dz);
-}
-/**
- * Rotates a vector around a given axis by a specified angle using Rodrigues' rotation formula.
- * The axis must be a unit vector for correct results.
- * @param v The vector to rotate.
- * @param axis The unit axis of rotation.
- * @param angle The angle of rotation in radians.
- * @returns The rotated vector.
- */
-function rotateVector(v, axis, angle) {
-    const cosAngle = Math.cos(angle);
-    const sinAngle = Math.sin(angle);
-    const oneMinusCos = 1.0 - cosAngle;
-    const dotAxisV = vec3Dot(axis, v);
-    const crossAxisV = vec3Cross(axis, v);
-    // Rodrigues' rotation formula:
-    // v' = v * cos(angle) + (axis x v) * sin(angle) + axis * (axis . v) * (1 - cos(angle))
-    const term1 = vec3Scale(v, cosAngle);
-    const term2 = vec3Scale(crossAxisV, sinAngle);
-    const term3 = vec3Scale(axis, dotAxisV * oneMinusCos);
-    return vec3Add(vec3Add(term1, term2), term3);
-}
-/**
- * Solves a quadratic equation Ax^2 + Bx + C = 0 for x, returning a root within a specified range.
- * Handles linear cases (A approx 0) and multiple roots, selecting the most appropriate one for CDF inversion.
- * @param a Coefficient A.
- * @param b Coefficient B.
- * @param c Coefficient C.
- * @param minVal The minimum expected value for the root.
- * @param maxVal The maximum expected value for the root.
- * @returns The selected root within the range, or null if no valid real root.
- */
-function solveQuadratic(a, b, c, minVal, maxVal) {
-    const epsilon = 1e-12; // Small value for floating point comparisons
-    // Case 1: Linear equation (A is close to zero)
-    if (Math.abs(a) < epsilon) {
-        if (Math.abs(b) < epsilon) {
-            // Both A and B are zero. If C is also zero, infinitely many solutions, pick minVal.
-            // Otherwise, no solutions.
-            return Math.abs(c) < epsilon ? minVal : null;
-        }
-        const x = -c / b;
-        // Check if the linear solution is within the expected range
-        return (x >= minVal - epsilon && x <= maxVal + epsilon) ? x : null;
-    }
-    // Case 2: Quadratic equation
-    const discriminant = b * b - 4 * a * c;
-    if (discriminant < -epsilon) { // No real roots (discriminant is significantly negative)
-        console.log("No real roots for the quadratic equation.");
-        return null;
-    }
-    if (discriminant < epsilon) { // One real root (discriminant is close to zero)
-        const x = -b / (2 * a);
-        return (x >= minVal - epsilon && x <= maxVal + epsilon) ? x : null;
-    }
-    // Case 3: Two distinct real roots
-    const sqrtDisc = Math.sqrt(discriminant);
-    const x1 = (-b + sqrtDisc) / (2 * a);
-    const x2 = (-b - sqrtDisc) / (2 * a);
-    const validX1 = (x1 >= minVal - epsilon && x1 <= maxVal + epsilon);
-    const validX2 = (x2 >= minVal - epsilon && x2 <= maxVal + epsilon);
-    if (validX1 && validX2) {
-        // If both roots are valid, pick the one that is logically correct for CDF inversion.
-        // For an increasing CDF, we generally want the smallest valid non-negative root.
-        return Math.min(x1, x2);
-    }
-    else if (validX1) {
-        return x1;
-    }
-    else if (validX2) {
-        return x2;
-    }
-    else {
-        return null; // No valid roots within the range
-    }
-}
-// --- Main Function for Arc Point Generation ---
-/**
- * Generates points on the shortest arc between p0 and p1 on a unit sphere.
- * The arc is formed by rotating p0 around axisA. The density of points
- * is higher closer to the attractionPoint.
- *
- * @param p0 The starting point of the arc (will be normalized).
- * @param p1 The ending point of the arc (will be normalized).
- * @param axisA The axis of rotation (will be normalized).
- * @param attractionPoint The point on the unit sphere that attracts sampled points (will be normalized).
- * @param pointCount The total number of points to generate on the arc, including p0 and p1.
- * @param strength Controls the density bias. A value of 0 means uniform sampling.
- * Higher positive values (e.g., 1 to 10) result in stronger attraction.
- * @returns An array of `Vec3` representing the deterministically sampled points on the arc.
- */
-export function generateArcPoints(p0, p1, axisA, attractionPoint, pointCount, strength) {
-    const sampledPoints = [];
-    const epsilon = 1e-7; // General epsilon for vector comparisons
-    // 1. Normalize all input vectors
-    let nP0 = vec3Normalize(p0);
-    let nP1 = vec3Normalize(p1);
-    let nAxisA = vec3Normalize(axisA);
-    let nAttractionPoint = vec3Normalize(attractionPoint);
-    // Handle edge cases for pointCount
-    if (pointCount < 1) {
-        return sampledPoints;
-    }
-    if (pointCount === 1) {
-        sampledPoints.push(nP0);
-        return sampledPoints;
-    }
-    // 2. Determine the total rotation angle required to go from p0 to p1 around axisA
-    // Project p0 and p1 onto the plane perpendicular to axisA
-    const p0Projected = vec3Sub(nP0, vec3Scale(nAxisA, vec3Dot(nP0, nAxisA)));
-    const p1Projected = vec3Sub(nP1, vec3Scale(nAxisA, vec3Dot(nP1, nAxisA)));
-    const lenP0Proj = Math.sqrt(vec3Dot(p0Projected, p0Projected));
-    const lenP1Proj = Math.sqrt(vec3Dot(p1Projected, p1Projected));
-    // Handle cases where p0 or p1 are colinear with the rotation axis
-    if (lenP0Proj < epsilon || lenP1Proj < epsilon) {
-        // If start and end points are effectively the same (on or very near the axis)
-        if (Math.abs(vec3Dot(nP0, nP1) - 1.0) < epsilon) {
-            for (let i = 0; i < pointCount; i++) {
-                sampledPoints.push(nP0); // Return identical points as no meaningful arc exists
-            }
-            return sampledPoints;
-        }
-        else {
-            console.warn("generateArcPoints: p0 or p1 is colinear with axisA. Cannot form a valid arc by rotation around axisA to reach p1. Falling back to linear interpolation.");
-            // Fallback: simple linear interpolation and normalize
-            for (let i = 0; i < pointCount; i++) {
-                const t = i / (pointCount - 1);
-                const interpolated = vec3Add(vec3Scale(nP0, (1 - t)), vec3Scale(nP1, t));
-                sampledPoints.push(vec3Normalize(interpolated));
-            }
-            return sampledPoints;
-        }
-    }
-    const nP0Projected = vec3Normalize(p0Projected);
-    const nP1Projected = vec3Normalize(p1Projected);
-    // Calculate total rotation angle using atan2 for a signed angle
-    const crossProj = vec3Cross(nP0Projected, nP1Projected);
-    const totalRotationAngle = Math.atan2(vec3Dot(crossProj, nAxisA), vec3Dot(nP0Projected, nP1Projected));
-    // If total rotation angle is negligible, all points are essentially p0
-    if (Math.abs(totalRotationAngle) < epsilon) {
-        for (let i = 0; i < pointCount; i++) {
-            sampledPoints.push(nP0);
-        }
-        return sampledPoints;
-    }
-    // 3. Find alpha_A: the angle parameter (from p0) where the arc point is closest to attractionPoint
-    // We search over `t` from 0 to 1, and map to actual rotation angles.
-    let alpha_A = 0.0; // This will be the actual rotation angle
-    let minAngleToAttraction = Math.PI; // Initialize with max possible angle
-    // TODO: USE GEOMETRY INSTEAD OF MARKOV CHOICE
-    const testSteps = 1000; // Granularity for finding alpha_A
-    for (let i = 0; i <= testSteps; i++) {
-        const t_test = i / testSteps; // Normalized parameter [0, 1]
-        const currentAlpha = totalRotationAngle * t_test; // Actual rotation angle
-        const pArcTest = rotateVector(nP0, nAxisA, currentAlpha); // Point on arc
-        const dotProduct = clamp(vec3Dot(pArcTest, nAttractionPoint), -1.0, 1.0);
-        const currentAngle = Math.acos(dotProduct);
-        if (currentAngle < minAngleToAttraction) {
-            minAngleToAttraction = currentAngle;
-            alpha_A = currentAlpha;
-        }
-    }
-    // minAngleToAttraction = 0.0;
-    console.log("generated alpha_A:", alpha_A, "minAngleToAttraction:", minAngleToAttraction);
-    // 4. Define the PDF parameters (for normalized parameter t in [0,1])
-    // The density function for 't' (normalized angle from 0 to 1)
-    const minDensity = 1.0;
-    // Strength ensures positive density. Higher strength gives more pronounced peak.
-    const maxDensity = minDensity + Math.max(0, strength);
-    // Normalize alpha_A to the [0, 1] range for the PDF/CDF calculations
-    // This represents the peak position (t_peak) within the normalized parameter space.
-    const alpha_A_normalized = totalRotationAngle !== 0 ? clamp(alpha_A / totalRotationAngle, 0, 1) : 0;
-    // Normalization constant for the PDF (integral over [0,1] must be 1)
-    // Area of trapezoid = 0.5 * (base1 + base2) * height
-    // In our case, the "bases" are minDensity and maxDensity, "height" is 1 (the t-interval length)
-    const pdfArea = 0.5 * (minDensity + maxDensity);
-    const pdfNormalizationConstant = 1.0 / pdfArea;
-    // Calculate CDF value at the peak point (alpha_A_normalized)
-    // This splits the CDF into two regions for the quadratic solver
-    const cdfAtAlphaA_norm = pdfNormalizationConstant * (minDensity * alpha_A_normalized + 0.5 * (maxDensity - minDensity) * alpha_A_normalized);
-    // 5. Generate deterministic points using inverse transform sampling
-    for (let i = 0; i < pointCount; i++) {
-        // Generate uniformly spaced values `u` in [0, 1]
-        const u = i / (pointCount - 1);
-        let t_sampled; // This will be the sampled normalized parameter [0, 1]
-        if (u <= cdfAtAlphaA_norm) {
-            // Case 1: The sampled point falls in the first part of the PDF (0 to alpha_A_normalized)
-            // F(t) = normConst * (minDensity * t + 0.5 * (maxDensity - minDensity) / alpha_A_normalized * t^2)
-            // Rearrange to A*t^2 + B*t + C = 0 for solving:
-            const A = (alpha_A_normalized !== 0) ? pdfNormalizationConstant * 0.5 * (maxDensity - minDensity) / alpha_A_normalized : 0;
-            const B = pdfNormalizationConstant * minDensity;
-            const C = -u;
-            const result = solveQuadratic(A, B, C, 0, alpha_A_normalized);
-            // Fallback for unexpected null (e.g., numerical issues)
-            t_sampled = result !== null ? result : (u / (cdfAtAlphaA_norm || epsilon)) * alpha_A_normalized;
-        }
-        else {
-            // Case 2: The sampled point falls in the second part of the PDF (alpha_A_normalized to 1)
-            // F(t) - cdfAtAlphaA_norm = normConst * [ maxDensity * (t - alpha_A_normalized) - 0.5 * (maxDensity - minDensity) / (1 - alpha_A_normalized) * (t - alpha_A_normalized)^2 ]
-            // Let x = t - alpha_A_normalized. Solve for x: A'*x^2 + B'*x + C' = 0
-            const rangeAfterA = 1 - alpha_A_normalized;
-            const A_prime = (rangeAfterA !== 0) ? -pdfNormalizationConstant * 0.5 * (maxDensity - minDensity) / rangeAfterA : 0;
-            const B_prime = pdfNormalizationConstant * maxDensity;
-            const C_prime = -(u - cdfAtAlphaA_norm);
-            const result_x = solveQuadratic(A_prime, B_prime, C_prime, 0, rangeAfterA);
-            // Fallback for unexpected null
-            t_sampled = (result_x !== null ? alpha_A_normalized + result_x :
-                alpha_A_normalized + (u - cdfAtAlphaA_norm) / ((1 - cdfAtAlphaA_norm) || epsilon) * rangeAfterA);
-        }
-        // Ensure t_sampled is within [0, 1] due to potential float inaccuracies
-        t_sampled = clamp(t_sampled, 0, 1);
-        // Convert the normalized parameter 't_sampled' back to the actual rotation angle
-        const actualRotationAngle = totalRotationAngle * t_sampled;
-        // Rotate the starting point p0 by this angle around axisA to get the final point
-        const currentPoint = rotateVector(nP0, nAxisA, actualRotationAngle);
-        sampledPoints.push(currentPoint);
-    }
-    return sampledPoints;
-}
-// --- Example Usage (for demonstration and testing) ---
-// Example 1: Basic arc, attraction point in the middle
-const p0_ex1 = [1, 0, 0];
-const p1_ex1 = [0, 1, 0]; // 90 deg rotation around Z-axis
-const axisA_ex1 = [0, 0, 1];
-const attractionPoint_ex1 = [Math.sqrt(0.5), Math.sqrt(0.5), 0]; // On the arc, middle of P0-P1
-const numPoints_ex1 = 50;
-const strength_ex1 = 100.0; // Strong attraction
-console.log("--- Example 1: Attraction point in the middle of the arc ---");
-const points1 = generateArcPoints(p0_ex1, p1_ex1, axisA_ex1, attractionPoint_ex1, numPoints_ex1, strength_ex1);
-console.log(`Generated ${points1.length} points.`);
-// To observe concentration, you might visualize these points or calculate their 't' parameter distribution.
-// For console output, let's print a few:
-console.log("First 5 points:", points1.slice(0, 5).map(p => p.map(coord => coord.toFixed(4))));
-console.log("Last 5 points:", points1.slice(-5).map(p => p.map(coord => coord.toFixed(4))));
-// Expected: Points should be denser around [0.707, 0.707, 0]
-const sequentialDistances1 = points1.map((p, i) => {
-    if (i === 0)
-        return 0; // Skip the first point
-    return vec3Distance(points1[i - 1], p);
-});
-console.log("Sequential distances between points (should be roughly equal for uniform distribution):", sequentialDistances1.map(d => d.toFixed(4)));
-// Example 2: Attraction point near p0
-const p0_ex2 = [1, 0, 0];
-const p1_ex2 = [0, 1, 0];
-const axisA_ex2 = [0, 0, 1];
-const attractionPoint_ex2 = [0.99, 0.01, 0]; // Very close to P0
-const numPoints_ex2 = 50;
-const strength_ex2 = 10.0; // Very strong attraction
-console.log("\n--- Example 2: Attraction point near the start (p0) ---");
-const points2 = generateArcPoints(p0_ex2, p1_ex2, axisA_ex2, attractionPoint_ex2, numPoints_ex2, strength_ex2);
-console.log(`Generated ${points2.length} points.`);
-console.log("First 5 points:", points2.slice(0, 5).map(p => p.map(coord => coord.toFixed(4))));
-console.log("Last 5 points:", points2.slice(-5).map(p => p.map(coord => coord.toFixed(4))));
-// Expected: Points should be denser near [1, 0, 0]
-// Example 3: Attraction point away from the arc (expect less concentration)
-const p0_ex3 = [1, 0, 0];
-const p1_ex3 = [0, 1, 0];
-const axisA_ex3 = [0, 0, 1];
-const attractionPoint_ex3 = [0, 0, 1]; // North pole, away from the XY plane arc
-const numPoints_ex3 = 50;
-const strength_ex3 = 5.0;
-console.log("\n--- Example 3: Attraction point away from the arc ---");
-const points3 = generateArcPoints(p0_ex3, p1_ex3, axisA_ex3, attractionPoint_ex3, numPoints_ex3, strength_ex3);
-console.log(`Generated ${points3.length} points.`);
-console.log("First 5 points:", points3.slice(0, 5).map(p => p.map(coord => coord.toFixed(4))));
-console.log("Last 5 points:", points3.slice(-5).map(p => p.map(coord => coord.toFixed(4))));
-// Expected: Points should be relatively uniformly distributed, as no point on the arc is significantly closer.
-// The "closest point" on the arc will likely be determined by its closest angular projection.
-// Example 4: No attraction (uniform distribution)
-const p0_ex4 = [1, 0, 0];
-const p1_ex4 = [0, 1, 0];
-const axisA_ex4 = [0, 0, 1];
-const attractionPoint_ex4 = [Math.sqrt(1 / 2), Math.sqrt(1 / 2), 0]; // Irrelevant when strength is 0
-const numPoints_ex4 = 50;
-const strength_ex4 = 4.0; // No attraction (uniform)
-console.log("\n--- Example 4: Uniform distribution (strength = 0) ---");
-const points4 = generateArcPoints(p0_ex4, p1_ex4, axisA_ex4, attractionPoint_ex4, numPoints_ex4, strength_ex4);
-console.log(`Generated ${points4.length} points.`);
-console.log("First 5 points:", points4.slice(0, 5).map(p => p.map(coord => coord.toFixed(4))));
-console.log("Last 5 points:", points4.slice(-5).map(p => p.map(coord => coord.toFixed(4))));
-// Expected: Points should be uniformly spaced.
-const sequentialDistances = points4.map((p, i) => {
-    if (i === 0)
-        return 0; // Skip the first point
-    return vec3Distance(points4[i - 1], p);
-});
-console.log("Sequential distances between points (should be roughly equal for uniform distribution):", sequentialDistances.map(d => d.toFixed(4)));

package/Math/globe-util/horizon-plane.js

@@ -1,112 +0,0 @@
-"use strict";
-// TODO: REMOVE
-// // import { Vector3D, Quaternion, Plane, Ray, Matrix4 } from 'your-3d-math-library'; // <-- ADAPT THIS IMPORT
-// import { Vector3D } from '../vector3d';
-// import { Plane } from '../plane';
-// import { Line } from '../line';
-// import { Matrix4 } from '../matrix4';
-// import { Quaternion } from '../quaternion';
-// // --- Assume these static helper variables exist within your class ---
-// const _lookFromOrigin = new Vector3D();
-// const _cameraPosition = new Vector3D();
-// const _finalForward = new Vector3D();
-// const _approxUp = new Vector3D();
-// const _finalRight = new Vector3D();
-// const _finalUp = new Vector3D();
-// const _tempVec = new Vector3D(); // General purpose helper
-// const _initialBottomRayDir = new Vector3D();
-// const _qOrient = new Quaternion();
-// const _rollQuaternion = new Quaternion();
-// const _rotationMatrix = new Matrix4();
-// const _fieldOfViewBottomRay = new Line(new Vector3D(), new Vector3D());
-// const _origin3d = new Vector3D(0, 0, 0); // Globe Center
-// // --- Assume these constants exist ---
-// const WORLD_RADIUS_3D = 6371000; // Example: Earth radius
-// const FIELD_OF_VIEW = (25 * Math.PI) / 180; // Example: 25 degrees half-FOV in radians
-// // // --- Assume Plane class has these methods ---
-// // interface Plane {
-// //     setFromNormalAndPoint(normal: Vector3D, point: Vector3D): this;
-// //     set(normal: Vector3D, constant: number): this;
-// //     // ... other plane methods
-// // }
-// // // --- Assume Ray class has these methods ---
-// // interface Ray {
-// //     origin: Vector3D;
-// //     direction: Vector3D;
-// //     intersectionSphere(center: Vector3D, radius: number): Vector3D[] | null; // Or similar
-// //     // ... other ray methods
-// // }
-// // // --- Assume Vector3D has setFromLongLat ---
-// // interface Vector3D {
-// //     setFromLongLat(lon: number, lat: number): this;
-// //     // ... other vector methods
-// // }
-// // // --- END OF ASSUMPTIONS ---
-// /**
-//  * Calculates a culling plane representing the bottom edge of the camera's field of view.
-//  * @param globe - The globe object, expected to have api_GetCurrentLookInfo and Fp properties.
-//  * @param out - The Plane object to store the result.
-//  * @param fieldOfView - The vertical half-angle of the field of view in radians.
-//  * @returns The calculated Plane.
-//  */
-// function calculateHorizonPlane(globe: any, out: Plane, fieldOfView: number = FIELD_OF_VIEW): Plane {
-//     const cameraLookInfo = globe.api_GetCurrentLookInfo();
-//     cameraLookInfo.CenterLong *= Math.PI / 180;
-//     cameraLookInfo.CenterLat *= Math.PI / 180;
-//     // cameraLookInfo.Tilt *= Math.PI / 180; // Tilt is now implicitly handled
-//     cameraLookInfo.NorthAng *= Math.PI / 180;
-//     // Set _lookFromOrigin based on camera target (Lon/Lat)
-//     (_lookFromOrigin as any).setFromLongLat(cameraLookInfo.CenterLong, cameraLookInfo.CenterLat); // Cast to any if setFromLongLat is custom
-//     // 1. Calculate _cameraPosition and _finalForward (_lookFromCamera)
-//     _cameraPosition.set(globe.Fp.x, globe.Fp.y, globe.Fp.z); // Using your X negation
-//     _cameraPosition.divideScalar(WORLD_RADIUS_3D); // Scale to unit sphere
-//     Vector3D.subVectors(_lookFromOrigin, _cameraPosition, _finalForward).normalize();
-//     // 2. Calculate Q_orient (Final Camera Orientation Quaternion)
-//     // Use the vector from origin to camera as an initial 'up' reference
-//     _approxUp.copy(_cameraPosition).normalize();
-//     // Calculate Right vector using cross product
-//     Vector3D.crossVectors(_finalForward, _approxUp, _finalRight).normalize();
-//     // Handle edge case: If looking straight along (or opposite to) _approxUp
-//     if (_finalRight.lengthSq() < 0.0001) {
-//         // If vectors are parallel, _approxUp is not good.
-//         // Choose a different 'up', e.g., if _approxUp is near Z, use Y.
-//         if (Math.abs(_approxUp.z) > 0.9) {
-//             _approxUp.set(0, 1, 0);
-//         } else {
-//             _approxUp.set(0, 0, 1);
-//         }
-//         Vector3D.crossVectors(_finalForward, _approxUp, _finalRight).normalize();
-//     }
-//     // Calculate the 'true' Up vector, orthogonal to Right and Forward
-//     Vector3D.crossVectors(_finalRight, _finalForward, _finalUp).normalize();
-//     // Apply NorthAng (Roll) around the Forward axis
-//     _rollQuaternion.setFromAxisAngle(_finalForward, cameraLookInfo.NorthAng);
-//     _finalUp.applyQuaternion(_rollQuaternion);
-//     _finalRight.applyQuaternion(_rollQuaternion); // Must rotate Right as well!
-//     // Create Q_orient from the final basis vectors (Right, Up, -Forward)
-//     // This assumes a Matrix4.makeBasis(x, y, z) exists and builds a rotation matrix.
-//     // It also assumes local camera looks down -Z, hence negating _finalForward for the Z basis.
-//     _tempVec.copy(_finalForward).negate();
-//     _rotationMatrix.makeBasis(_finalRight, _finalUp, _tempVec); // <-- ADAPT: Ensure your library has makeBasis or equivalent
-//     _qOrient.setFromRotationMatrix(_rotationMatrix); // <-- ADAPT: Ensure this function exists
-//     // 3. Calculate Initial Bottom Ray (Local: -Z forward, Y up, X right)
-//     // Rotates (0, 0, -1) around (1, 0, 0) by fieldOfView
-//     _initialBottomRayDir.set(0, -Math.sin(fieldOfView), -Math.cos(fieldOfView));
-//     // 4. Calculate Final Bottom Ray (World)
-//     _fieldOfViewBottomRay.direction.copy(_initialBottomRayDir).applyQuaternion(_qOrient).normalize();
-//     _fieldOfViewBottomRay.origin.copy(_cameraPosition);
-//     // 5. Intersection and Plane
-//     const intersection = (_fieldOfViewBottomRay as any).intersectionSphere(_origin3d, 1); // Cast to any if method isn't standard
-//     if (intersection && intersection.length > 0) {
-//         // If ray intersects, use the closest point for the plane
-//         out.setFromNormalAndPoint(_lookFromOrigin, intersection[0]);
-//     } else {
-//         // If ray does not intersect (FOV covers globe or misses)
-//         // WARNING: This sets a plane through the globe's center.
-//         // This might not be the desired behavior for culling.
-//         // Consider what should happen if the whole globe *is* visible.
-//         out.set(_lookFromOrigin, 0.0);
-//     }
-//     return out;
-// }
-// export { calculateHorizonPlane };

package/altitude-locator/draw-subset-obj.js

@@ -1,16 +0,0 @@
-import "./types";
-/**
- * @param {DrawSubsetOptions} drawSubsetOptions
- */
-// TODO: Draw all is an optional property for the target plugin, with this approach.
-class DrawSubsetOptionRegistry {
-    constructor() {
-        this._drawSubsetOptions = new Map();
-    }
-    register(key, drawSubsetOptions) {
-        this._drawSubsetOptions.set(key, drawSubsetOptions);
-    }
-    unregister(key) {
-        this._drawSubsetOptions.delete(key);
-    }
-}

package/semiplugins/shape-on-terrain/derived/padding-plugin.js

@@ -1,101 +0,0 @@
-import { ArcOnTerrainPlugin } from "../arc-plugin";
-const EDGE_COUNT = 5;
-const paddingKeys = (padding) => {
-    const stepCount = padding.coverAngle / padding.stepAngle;
-    const keys = new Array(Math.ceil(stepCount));
-    for (let i = 0; i < stepCount; i++) {
-        keys[i] = padding.key + i;
-    }
-    if (keys.length > stepCount) {
-        keys[keys.length - 1] = padding.key + stepCount;
-    }
-    return keys;
-};
-const adapterPadding2Arc = (globe, padding) => {
-    const stepCount = padding.coverAngle / padding.stepAngle;
-    const result = new Array(Math.ceil(stepCount));
-    const fill = (i, angle) => {
-        const startPoint = globe.Math.FindPointByPolar(padding.center[0], padding.center[1], padding.outerRadius, angle);
-        const endPoint = globe.Math.FindPointByPolar(padding.center[0], padding.center[1], padding.innerRadius, angle);
-        result[i] = {
-            key: padding.key + i,
-            start: [startPoint.long, startPoint.lat],
-            end: [endPoint.long, endPoint.lat],
-            color: padding.color,
-            height: padding.height,
-        };
-    };
-    for (let i = 0; i < stepCount; i++) {
-        const angle = padding.startAngle + i * padding.stepAngle;
-        fill(i, angle);
-    }
-    if (result.length > stepCount) {
-        const i = result.length - 1;
-        const angle = padding.startAngle + padding.coverAngle;
-        fill(i, angle);
-    }
-    return result;
-};
-export const chargerAdaptor = (chargerInput, plugin, padding) => {
-};
-export class PaddingPlugin {
-    id;
-    arcPlugin;
-    globe = null;
-    _memory = new Map();
-    isFreed = false;
-    constructor(id, { variativeColorsOn = true, defaultColor = [1, 1, 1, 1], defaultHeightFromGroundIn3D = 30.0, vertexCount = EDGE_COUNT } = {}) {
-        this.id = id;
-        this.arcPlugin = new ArcOnTerrainPlugin(id, {
-            cameraAttractionIsOn: false,
-            vertexCount: vertexCount,
-            variativeColorsOn: variativeColorsOn,
-            defaultColor: defaultColor,
-            defaultHeightFromGroundIn3D: defaultHeightFromGroundIn3D,
-        });
-    }
-    insertBulk(items) {
-        for (const padding of items) {
-            this.__delete(padding.key);
-            this._memory.set(padding.key, padding);
-        }
-        const arcInputs = items.flatMap(padding => adapterPadding2Arc(this.globe, padding));
-        this.arcPlugin.insertBulk(arcInputs);
-    }
-    deleteBulk(keys) {
-        const arcKeys = keys.flatMap(key => paddingKeys({ key, center: [0, 0], outerRadius: 0, innerRadius: 0, startAngle: 0, coverAngle: 0, stepAngle: 0, color: [0, 0, 0, 1] }));
-        this.arcPlugin.deleteBulk(arcKeys);
-    }
-    updateColor(key, color) {
-        // TODO: get all padding keys and update all of them
-        if (!this._memory.has(key)) {
-            console.warn(`Padding with key ${key} does not exist.`);
-            return;
-        }
-        const keys = paddingKeys(this._memory.get(key));
-        for (let i = 0; i < keys.length; i++) {
-            this.arcPlugin.updateColor(keys[i], color);
-        }
-    }
-    __delete(key) {
-        const padding = this._memory.get(key);
-        if (padding) {
-            const keys = paddingKeys(padding);
-            this.arcPlugin.deleteBulk(keys);
-            this._memory.delete(key);
-        }
-    }
-    init(globe, gl) {
-        this.globe = globe;
-        this.arcPlugin.init(globe, gl);
-    }
-    draw3D() {
-        this.arcPlugin.draw3D();
-    }
-    free() {
-        if (this.isFreed)
-            return;
-        this.isFreed = true;
-        this.arcPlugin.free();
-    }
-}