From ea276d35e9fb69e9718324074540c62d49a4cde0 Mon Sep 17 00:00:00 2001 From: Alexander Nozik Date: Sat, 8 Aug 2020 18:09:29 +0300 Subject: [PATCH] Readme update --- README.md | 9 + dataforge-vis-jsroot/build.gradle.kts | 63 - .../kotlin/hep/dataforge/vis/jsroot/HMR.kt | 19 - .../kotlin/hep/dataforge/vis/jsroot/JSRoot.kt | 6 - .../hep/dataforge/vis/jsroot/JSRootDemoApp.kt | 78 - .../hep/dataforge/vis/jsroot/JSRootGEO.kt | 17 - .../dataforge/vis/jsroot/JSRootGeometry.kt | 82 - .../hep/dataforge/vis/jsroot/JSRootObject.kt | 34 - .../hep/dataforge/vis/jsroot/JSRootPlugin.kt | 32 - .../kotlin/hep/dataforge/vis/jsroot/main.kt | 48 - .../src/main/resources/JSRootGeoBase.js | 3577 ----------------- .../src/main/resources/JSRootUtils.js | 765 ---- .../src/main/resources/ThreeCSG.js | 869 ---- dataforge-vis-jsroot/src/main/web/index.html | 33 - 14 files changed, 9 insertions(+), 5623 deletions(-) delete mode 100644 dataforge-vis-jsroot/build.gradle.kts delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/HMR.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRoot.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootDemoApp.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGEO.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGeometry.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootObject.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootPlugin.kt delete mode 100644 dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/main.kt delete mode 100644 dataforge-vis-jsroot/src/main/resources/JSRootGeoBase.js delete mode 100644 dataforge-vis-jsroot/src/main/resources/JSRootUtils.js delete mode 100644 dataforge-vis-jsroot/src/main/resources/ThreeCSG.js delete mode 100644 dataforge-vis-jsroot/src/main/web/index.html diff --git a/README.md b/README.md index 35c4daca..45cd88af 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,7 @@ [![JetBrains Research](https://jb.gg/badges/research.svg)](https://confluence.jetbrains.com/display/ALL/JetBrains+on+GitHub) +[![DOI](https://zenodo.org/badge/174502624.svg)](https://zenodo.org/badge/latestdoi/174502624) + +![Gradle build](https://github.com/mipt-npm/visionforge/workflows/Gradle%20build/badge.svg) # DataForge Visualization Platform @@ -142,3 +145,9 @@ Visualization example for geometry defined as GDML file. ##### Example view: ![](doc/resources/gdml-demo.png) + + +## Thanks and references +The original three.js bindings were made by [Lars Ivar Hatledal](https://github.com/markaren), but the project is discontinued right now. + +All other libraries are explicitly shown as dependencies. We would like to express specific thanks to JetBrains Kotlin-JS team for consulting us during the work. \ No newline at end of file diff --git a/dataforge-vis-jsroot/build.gradle.kts b/dataforge-vis-jsroot/build.gradle.kts deleted file mode 100644 index dc0f822a..00000000 --- a/dataforge-vis-jsroot/build.gradle.kts +++ /dev/null @@ -1,63 +0,0 @@ -import org.jetbrains.kotlin.gradle.frontend.KotlinFrontendExtension -import org.jetbrains.kotlin.gradle.frontend.npm.NpmExtension -import org.jetbrains.kotlin.gradle.frontend.webpack.WebPackExtension -import org.jetbrains.kotlin.gradle.tasks.Kotlin2JsCompile - -plugins { - id("kotlin2js") - id("kotlin-dce-js") - id("org.jetbrains.kotlin.frontend") -} - -val kotlinVersion: String by rootProject.extra - -dependencies { - implementation(project(":visionforge-spatial-js")) - testCompile(kotlin("test-js")) -} - -configure { - downloadNodeJsVersion = "latest" - - configure { - dependency("three","0.106.2") - dependency("@hi-level/three-csg") - dependency("style-loader") - dependency("element-resize-event") - devDependency("karma") - } - - sourceMaps = true - - bundle("webpack") { - this as WebPackExtension - bundleName = "main" - contentPath = file("src/main/web") - sourceMapEnabled = true - //mode = "production" - mode = "development" - } -} - -tasks { - "compileKotlin2Js"(Kotlin2JsCompile::class) { - kotlinOptions { - metaInfo = true - outputFile = "${project.buildDir.path}/js/${project.name}.js" - sourceMap = true - moduleKind = "commonjs" - main = "call" - kotlinOptions.sourceMapEmbedSources = "always" - } - } - - "compileTestKotlin2Js"(Kotlin2JsCompile::class) { - kotlinOptions { - metaInfo = true - outputFile = "${project.buildDir.path}/js/${project.name}-test.js" - sourceMap = true - moduleKind = "commonjs" - kotlinOptions.sourceMapEmbedSources = "always" - } - } -} \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/HMR.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/HMR.kt deleted file mode 100644 index 2834da53..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/HMR.kt +++ /dev/null @@ -1,19 +0,0 @@ -package hep.dataforge.vis.jsroot - -external val module: Module - -external interface Module { - val hot: Hot? -} - -external interface Hot { - val data: dynamic - - fun accept() - fun accept(dependency: String, callback: () -> Unit) - fun accept(dependencies: Array, callback: (updated: Array) -> Unit) - - fun dispose(callback: (data: dynamic) -> Unit) -} - -external fun require(name: String): dynamic \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRoot.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRoot.kt deleted file mode 100644 index 76b9181f..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRoot.kt +++ /dev/null @@ -1,6 +0,0 @@ -@file:JsModule("JSRootUtils") -@file:JsNonModule - -package hep.dataforge.vis.jsroot - -external fun parse(obj: String): dynamic diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootDemoApp.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootDemoApp.kt deleted file mode 100644 index 9775dbb7..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootDemoApp.kt +++ /dev/null @@ -1,78 +0,0 @@ -package hep.dataforge.vis.jsroot - -import hep.dataforge.context.Global -import hep.dataforge.meta.EmptyMeta -import hep.dataforge.vis.spatial.render -import hep.dataforge.vis.spatial.three.ThreePlugin -import hep.dataforge.vis.spatial.three.output -import org.w3c.dom.HTMLDivElement -import org.w3c.dom.events.Event -import org.w3c.files.FileList -import org.w3c.files.FileReader -import org.w3c.files.get -import kotlin.browser.document -import kotlin.dom.clear - - -class JSRootDemoApp : ApplicationBase() { - - override val stateKeys: List = emptyList() - - override fun start(state: Map) { - - - //TODO remove after DI fix -// Global.plugins.load(ThreePlugin()) -// Global.plugins.load(JSRootPlugin()) - - Global.plugins.load(JSRootPlugin) - - - - (document.getElementById("drop_zone") as? HTMLDivElement)?.apply { - addEventListener("dragover", { handleDragOver(it) }, false) - addEventListener("drop", { loadData(it) }, false) - } - - - } - - /** - * Handle mouse drag according to https://www.html5rocks.com/en/tutorials/file/dndfiles/ - */ - private fun handleDragOver(event: Event) { - event.stopPropagation() - event.preventDefault() - event.asDynamic().dataTransfer.dropEffect = "copy" - } - - /** - * Load data from text file - */ - private fun loadData(event: Event) { - event.stopPropagation() - event.preventDefault() - - - val file = (event.asDynamic().dataTransfer.files as FileList)[0] - ?: throw RuntimeException("Failed to load file"); - FileReader().apply { - onload = { - val string = result as String - val renderer = Global.plugins.fetch(ThreePlugin).output() - val canvas = document.getElementById("canvas")!! - canvas.clear() - renderer.attach(canvas) - println("started") - - renderer.render { - val json = parse(string) - JSRootObject(this, EmptyMeta, json).also { add(it) } - } - } - readAsText(file) - } - } - - override fun dispose() = emptyMap()//mapOf("lines" put presenter.dispose()) -} \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGEO.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGEO.kt deleted file mode 100644 index 115ec701..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGEO.kt +++ /dev/null @@ -1,17 +0,0 @@ -@file:JsModule("JSRootGeoBase") -@file:JsNonModule - -package hep.dataforge.vis.jsroot - -import info.laht.threekt.core.BufferGeometry -import info.laht.threekt.core.Object3D - -external fun createGeometry(shape: dynamic, limit: Int): BufferGeometry - -external fun createCubeBuffer(shape: dynamic, limit: Int): BufferGeometry - -external fun createTubeBuffer(shape: dynamic, limit: Int): BufferGeometry - -external fun createXtruBuffer(shape: dynamic, limit: Int): BufferGeometry - -external fun build(obj: dynamic, opt: dynamic): Object3D \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGeometry.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGeometry.kt deleted file mode 100644 index f4ee6c42..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootGeometry.kt +++ /dev/null @@ -1,82 +0,0 @@ -package hep.dataforge.vis.jsroot - -import hep.dataforge.meta.EmptyMeta -import hep.dataforge.meta.Meta -import hep.dataforge.meta.buildMeta -import hep.dataforge.meta.toDynamic -import hep.dataforge.vis.common.* -import hep.dataforge.vis.spatial.three.MeshThreeFactory -import info.laht.threekt.core.BufferGeometry - -class JSRootGeometry(parent: VisualObject?, meta: Meta) : DisplayLeaf(parent, meta) { - - var shape by node() - - var facesLimit by int(0) - - fun box(xSize: Number, ySize: Number, zSize: Number) = buildMeta { - "_typename" put "TGeoBBox" - "fDX" put xSize - "fDY" put ySize - "fDZ" put zSize - } - - /** - * Create a GDML union - */ - operator fun Meta.plus(other: Meta) = buildMeta { - "fNode.fLeft" put this - "fNode.fRight" put other - "fNode._typename" put "TGeoUnion" - } - - /** - * Create a GDML subtraction - */ - operator fun Meta.minus(other: Meta) = buildMeta { - "fNode.fLeft" put this - "fNode.fRight" put other - "fNode._typename" put "TGeoSubtraction" - } - - /** - * Intersect two GDML geometries - */ - infix fun Meta.intersect(other: Meta) = buildMeta { - "fNode.fLeft" put this - "fNode.fRight" put other - "fNode._typename" put "TGeoIntersection" - } - - companion object { - const val TYPE = "geometry.spatial.jsRoot.geometry" - } -} - -fun VisualGroup.jsRootGeometry(meta: Meta = EmptyMeta, action: JSRootGeometry.() -> Unit = {}) = - JSRootGeometry(this, meta).apply(action).also { add(it) } - -//fun Meta.toDynamic(): dynamic { -// fun MetaItem<*>.toDynamic(): dynamic = when (this) { -// is MetaItem.ValueItem -> this.value.value.asDynamic() -// is MetaItem.NodeItem -> this.node.toDynamic() -// } -// -// val res = js("{}") -// this.items.entries.groupBy { it.key.body }.forEach { (key, value) -> -// val list = value.map { it.value } -// res[key] = when (list.size) { -// 1 -> list.first().toDynamic() -// else -> list.map { it.toDynamic() } -// } -// } -// return res -//} - - -object ThreeJSRootGeometryFactory : MeshThreeFactory(JSRootGeometry::class) { - override fun buildGeometry(obj: JSRootGeometry): BufferGeometry { - val shapeMeta = obj.shape?.toDynamic() ?: error("The shape not defined") - return createGeometry(shapeMeta, obj.facesLimit) - } -} \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootObject.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootObject.kt deleted file mode 100644 index 0b5b5f30..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootObject.kt +++ /dev/null @@ -1,34 +0,0 @@ -package hep.dataforge.vis.jsroot - -import hep.dataforge.meta.EmptyMeta -import hep.dataforge.meta.Meta -import hep.dataforge.meta.toDynamic -import hep.dataforge.vis.common.VisualGroup -import hep.dataforge.vis.common.DisplayLeaf -import hep.dataforge.vis.common.VisualObject -import hep.dataforge.vis.common.node -import hep.dataforge.vis.spatial.three.ThreeFactory -import info.laht.threekt.core.Object3D - -class JSRootObject(parent: VisualObject?, meta: Meta, val data: dynamic) : DisplayLeaf(parent, meta) { - - var options by node() - - companion object { - const val TYPE = "geometry.spatial.jsRoot.object" - } -} - -object ThreeJSRootObjectFactory : ThreeFactory { - - override val type = JSRootObject::class - - override fun invoke(obj: JSRootObject): Object3D { - return build(obj.data, obj.options?.toDynamic()) - } -} - -fun VisualGroup.jsRootObject(str: String) { - val json = JSON.parse(str) - JSRootObject(this, EmptyMeta, json).also { add(it) } -} \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootPlugin.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootPlugin.kt deleted file mode 100644 index 0c386f58..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/JSRootPlugin.kt +++ /dev/null @@ -1,32 +0,0 @@ -package hep.dataforge.vis.jsroot - -import hep.dataforge.context.AbstractPlugin -import hep.dataforge.context.PluginFactory -import hep.dataforge.context.PluginTag -import hep.dataforge.meta.Meta -import hep.dataforge.names.Name -import hep.dataforge.names.toName -import hep.dataforge.vis.spatial.three.ThreeFactory -import hep.dataforge.vis.spatial.three.ThreePlugin - -class JSRootPlugin : AbstractPlugin() { - override val tag: PluginTag get() = Companion.tag - - override fun dependsOn() = listOf(ThreePlugin) - - override fun provideTop(target: String): Map { - return when(target){ - ThreeFactory.TYPE -> mapOf( - "jsRoot.geometry".toName() to ThreeJSRootGeometryFactory, - "jsRoot.object".toName() to ThreeJSRootObjectFactory - ) - else -> emptyMap() - } - } - - companion object: PluginFactory { - override val tag = PluginTag("vis.jsroot", "hep.dataforge") - override val type = JSRootPlugin::class - override fun invoke(meta: Meta) = JSRootPlugin() - } -} \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/main.kt b/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/main.kt deleted file mode 100644 index 4055ce03..00000000 --- a/dataforge-vis-jsroot/src/main/kotlin/hep/dataforge/vis/jsroot/main.kt +++ /dev/null @@ -1,48 +0,0 @@ -package hep.dataforge.vis.jsroot - -import kotlin.browser.document -import kotlin.dom.hasClass - - -abstract class ApplicationBase { - abstract val stateKeys: List - - abstract fun start(state: Map) - abstract fun dispose(): Map -} - - -fun main() { - var application: ApplicationBase? = null - - val state: dynamic = module.hot?.let { hot -> - hot.accept() - - hot.dispose { data -> - data.appState = application?.dispose() - application = null - } - - hot.data - } - - if (document.body != null) { - application = start(state) - } else { - application = null - document.addEventListener("DOMContentLoaded", { application = start(state) }) - } -} - -fun start(state: dynamic): ApplicationBase? { - return if (document.body?.hasClass("application") == true) { - val application = JSRootDemoApp() - - @Suppress("UnsafeCastFromDynamic") - application.start(state?.appState ?: emptyMap()) - - application - } else { - null - } -} \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/resources/JSRootGeoBase.js b/dataforge-vis-jsroot/src/main/resources/JSRootGeoBase.js deleted file mode 100644 index 87cf8f12..00000000 --- a/dataforge-vis-jsroot/src/main/resources/JSRootGeoBase.js +++ /dev/null @@ -1,3577 +0,0 @@ -import * as JSROOT from "src/main/resources/JSRootUtils" -import * as THREE from "three" -import * as ThreeBSP from "src/main/resources/ThreeCSG" - -// Holder of all TGeo-related functions and classes -const GradPerSegm = 6; // grad per segment in cylinder/spherical symmetry shapes -const CompressComp = true; // use faces compression in composite shapes -const CompLimit = 20; // maximal number of components in composite shape - -let _warn_msgs = {}; - - -/** */ -const BITS = { - kVisOverride: JSROOT.BIT(0), // volume's vis. attributes are overwritten - kVisNone: JSROOT.BIT(1), // the volume/node is invisible, as well as daughters - kVisThis: JSROOT.BIT(2), // this volume/node is visible - kVisDaughters: JSROOT.BIT(3), // all leaves are visible - kVisOneLevel: JSROOT.BIT(4), // first level daughters are visible - kVisStreamed: JSROOT.BIT(5), // true if attributes have been streamed - kVisTouched: JSROOT.BIT(6), // true if attributes are changed after closing geom - kVisOnScreen: JSROOT.BIT(7), // true if volume is visible on screen - kVisContainers: JSROOT.BIT(12), // all containers visible - kVisOnly: JSROOT.BIT(13), // just this visible - kVisBranch: JSROOT.BIT(14), // only a given branch visible - kVisRaytrace: JSROOT.BIT(15) // raytracing flag -}; - -/** */ -function testBit(volume, f) { - const att = volume.fGeoAtt; - return att === undefined ? false : ((att & f) !== 0); -} - - -/** */ -function SetBit(volume, f, value) { - if (volume.fGeoAtt === undefined) return; - volume.fGeoAtt = value ? (volume.fGeoAtt | f) : (volume.fGeoAtt & ~f); -} - -/** */ -function ToggleBit(volume, f) { - if (volume.fGeoAtt !== undefined) - volume.fGeoAtt = volume.fGeoAtt ^ (f & 0xffffff); -} - -/** - * implementation of TGeoVolume::InvisibleAll */ -function InvisibleAll(flag) { - if (flag === undefined) flag = true; - - SetBit(this, BITS.kVisThis, !flag); - SetBit(this, BITS.kVisDaughters, !flag); - SetBit(this, BITS.kVisOneLevel, false); - - if (this.fNodes) - for (let n = 0; n < this.fNodes.arr.length; ++n) { - const sub = this.fNodes.arr[n].fVolume; - SetBit(sub, BITS.kVisThis, !flag); - // SetBit(sub, BITS.kVisDaughters, !flag); - //SetBit(sub, BITS.kVisOneLevel, false); - } -} - -/** method used to avoid duplication of warnings - * */ -function warn(msg) { - if (_warn_msgs === undefined) _warn_msgs = {}; - if (_warn_msgs[msg] !== undefined) return; - _warn_msgs[msg] = true; - console.warn(msg); -} - -/** */ -function NodeKind(obj) { - // return kind of the geo nodes - // 0 - TGeoNode - // 1 - TEveGeoNode - // -1 - unsupported type - - if ((obj === undefined) || (obj === null) || (typeof obj !== 'object')) return -1; - - return ('fShape' in obj) && ('fTrans' in obj) ? 1 : 0; -} - -function CountNumShapes(shape) { - if (!shape) return 0; - if (shape._typename !== 'TGeoCompositeShape') return 1; - return CountNumShapes(shape.fNode.fLeft) + CountNumShapes(shape.fNode.fRight); -} - -// ========================================================================== - -class GeometryCreator { - constructor(numfaces) { - this.nfaces = numfaces; - this.indx = 0; - this.pos = new Float32Array(numfaces * 9); - this.norm = new Float32Array(numfaces * 9); - } -} - -GeometryCreator.prototype.AddFace3 = function (x1, y1, z1, - x2, y2, z2, - x3, y3, z3) { - const indx = this.indx, pos = this.pos; - pos[indx] = x1; - pos[indx + 1] = y1; - pos[indx + 2] = z1; - pos[indx + 3] = x2; - pos[indx + 4] = y2; - pos[indx + 5] = z2; - pos[indx + 6] = x3; - pos[indx + 7] = y3; - pos[indx + 8] = z3; - this.last4 = false; - this.indx = indx + 9; -}; - -GeometryCreator.prototype.StartPolygon = function () { -}; -GeometryCreator.prototype.StopPolygon = function () { -}; - -GeometryCreator.prototype.AddFace4 = function (x1, y1, z1, - x2, y2, z2, - x3, y3, z3, - x4, y4, z4, - reduce) { - // from four vertices one normally creates two faces (1,2,3) and (1,3,4) - // if (reduce==1), first face is reduced - // if (reduce==2), second face is reduced - - let indx = this.indx; - const pos = this.pos; - - if (reduce !== 1) { - pos[indx] = x1; - pos[indx + 1] = y1; - pos[indx + 2] = z1; - pos[indx + 3] = x2; - pos[indx + 4] = y2; - pos[indx + 5] = z2; - pos[indx + 6] = x3; - pos[indx + 7] = y3; - pos[indx + 8] = z3; - indx += 9; - } - - if (reduce !== 2) { - pos[indx] = x1; - pos[indx + 1] = y1; - pos[indx + 2] = z1; - pos[indx + 3] = x3; - pos[indx + 4] = y3; - pos[indx + 5] = z3; - pos[indx + 6] = x4; - pos[indx + 7] = y4; - pos[indx + 8] = z4; - indx += 9; - } - - this.last4 = (indx !== this.indx + 9); - this.indx = indx; -}; - -GeometryCreator.prototype.SetNormal4 = function (nx1, ny1, nz1, - nx2, ny2, nz2, - nx3, ny3, nz3, - nx4, ny4, nz4, - reduce) { - // same as AddFace4, assign normals for each individual vertex - // reduce has same meaning and should be the same - - if (this.last4 && reduce) - return console.error('missmatch between AddFace4 and SetNormal4 calls'); - - let indx = this.indx - (this.last4 ? 18 : 9); - const norm = this.norm; - - if (reduce !== 1) { - norm[indx] = nx1; - norm[indx + 1] = ny1; - norm[indx + 2] = nz1; - norm[indx + 3] = nx2; - norm[indx + 4] = ny2; - norm[indx + 5] = nz2; - norm[indx + 6] = nx3; - norm[indx + 7] = ny3; - norm[indx + 8] = nz3; - indx += 9; - } - - if (reduce !== 2) { - norm[indx] = nx1; - norm[indx + 1] = ny1; - norm[indx + 2] = nz1; - norm[indx + 3] = nx3; - norm[indx + 4] = ny3; - norm[indx + 5] = nz3; - norm[indx + 6] = nx4; - norm[indx + 7] = ny4; - norm[indx + 8] = nz4; - } -}; - -GeometryCreator.prototype.RecalcZ = function (func) { - const pos = this.pos, - last = this.indx; - let indx = last - (this.last4 ? 18 : 9); - - while (indx < last) { - pos[indx + 2] = func(pos[indx], pos[indx + 1], pos[indx + 2]); - indx += 3; - } -}; - -function GetNormal(x1, y1, z1, x2, y2, z2, x3, y3, z3) { - - const pA = new THREE.Vector3(x1, y1, z1), - pB = new THREE.Vector3(x2, y2, z2), - pC = new THREE.Vector3(x3, y3, z3), - cb = new THREE.Vector3(), - ab = new THREE.Vector3(); - - cb.subVectors(pC, pB); - ab.subVectors(pA, pB); - cb.cross(ab); - - return cb; -} - -GeometryCreator.prototype.CalcNormal = function () { - const indx = this.indx, norm = this.norm; - - if (!this.cb) { - this.pA = new THREE.Vector3(); - this.pB = new THREE.Vector3(); - this.pC = new THREE.Vector3(); - this.cb = new THREE.Vector3(); - this.ab = new THREE.Vector3(); - } - - this.pA.fromArray(this.pos, this.indx - 9); - this.pB.fromArray(this.pos, this.indx - 6); - this.pC.fromArray(this.pos, this.indx - 3); - - this.cb.subVectors(this.pC, this.pB); - this.ab.subVectors(this.pA, this.pB); - this.cb.cross(this.ab); - - this.SetNormal(this.cb.x, this.cb.y, this.cb.z); -}; - -GeometryCreator.prototype.SetNormal = function (nx, ny, nz) { - let indx = this.indx - 9; - const norm = this.norm; - - norm[indx] = norm[indx + 3] = norm[indx + 6] = nx; - norm[indx + 1] = norm[indx + 4] = norm[indx + 7] = ny; - norm[indx + 2] = norm[indx + 5] = norm[indx + 8] = nz; - - if (this.last4) { - indx -= 9; - norm[indx] = norm[indx + 3] = norm[indx + 6] = nx; - norm[indx + 1] = norm[indx + 4] = norm[indx + 7] = ny; - norm[indx + 2] = norm[indx + 5] = norm[indx + 8] = nz; - } -}; - -GeometryCreator.prototype.SetNormal_12_34 = function (nx12, ny12, nz12, nx34, ny34, nz34, reduce) { - // special shortcut, when same normals can be applied for 1-2 point and 3-4 point - if (reduce === undefined) reduce = 0; - - let indx = this.indx - ((reduce > 0) ? 9 : 18); - const norm = this.norm; - - if (reduce !== 1) { - norm[indx] = nx12; - norm[indx + 1] = ny12; - norm[indx + 2] = nz12; - norm[indx + 3] = nx12; - norm[indx + 4] = ny12; - norm[indx + 5] = nz12; - norm[indx + 6] = nx34; - norm[indx + 7] = ny34; - norm[indx + 8] = nz34; - indx += 9; - } - - if (reduce !== 2) { - norm[indx] = nx12; - norm[indx + 1] = ny12; - norm[indx + 2] = nz12; - norm[indx + 3] = nx34; - norm[indx + 4] = ny34; - norm[indx + 5] = nz34; - norm[indx + 6] = nx34; - norm[indx + 7] = ny34; - norm[indx + 8] = nz34; - indx += 9; - } -}; - -GeometryCreator.prototype.Create = function () { - if (this.nfaces !== this.indx / 9) - console.error('Mismatch with created ' + this.nfaces + ' and filled ' + this.indx / 9 + ' number of faces'); - - const geometry = new THREE.BufferGeometry(); - geometry.addAttribute('position', new THREE.BufferAttribute(this.pos, 3)); - geometry.addAttribute('normal', new THREE.BufferAttribute(this.norm, 3)); - return geometry; -}; - -// ================================================================================ - -// same methods as GeometryCreator, but with different implementation - -class PolygonsCreator { - constructor() { - this.polygons = []; - } -} - -PolygonsCreator.prototype.StartPolygon = function (normal) { - this.multi = 1; - this.mnormal = normal; -}; - -PolygonsCreator.prototype.StopPolygon = function () { - if (!this.multi) return; - this.multi = 0; - console.error('Polygon should be already closed at this moment'); -}; - -PolygonsCreator.prototype.AddFace3 = function (x1, y1, z1, - x2, y2, z2, - x3, y3, z3) { - this.AddFace4(x1, y1, z1, x2, y2, z2, x3, y3, z3, x3, y3, z3, 2); -}; - - -PolygonsCreator.prototype.AddFace4 = function (x1, y1, z1, - x2, y2, z2, - x3, y3, z3, - x4, y4, z4, - reduce) { - // from four vertices one normally creates two faces (1,2,3) and (1,3,4) - // if (reduce==1), first face is reduced - // if (reduce==2), second face is reduced - - if (reduce === undefined) reduce = 0; - - this.v1 = new ThreeBSP.Vertex(x1, y1, z1, 0, 0, 0); - this.v2 = (reduce === 1) ? null : new ThreeBSP.Vertex(x2, y2, z2, 0, 0, 0); - this.v3 = new ThreeBSP.Vertex(x3, y3, z3, 0, 0, 0); - this.v4 = (reduce === 2) ? null : new ThreeBSP.Vertex(x4, y4, z4, 0, 0, 0); - - this.reduce = reduce; - - if (this.multi) { - - if (reduce !== 2) console.error('polygon not supported for not-reduced faces'); - - let polygon; - - if (this.multi++ === 1) { - polygon = new ThreeBSP.Polygon; - - polygon.vertices.push(this.mnormal ? this.v2 : this.v3); - this.polygons.push(polygon); - } else { - polygon = this.polygons[this.polygons.length - 1]; - // check that last vertice equals to v2 - const last = this.mnormal ? polygon.vertices[polygon.vertices.length - 1] : polygon.vertices[0], - comp = this.mnormal ? this.v2 : this.v3; - - if (comp.diff(last) > 1e-12) - console.error('vertex missmatch when building polygon'); - } - - const first = this.mnormal ? polygon.vertices[0] : polygon.vertices[polygon.vertices.length - 1], - next = this.mnormal ? this.v3 : this.v2; - - if (next.diff(first) < 1e-12) { - //console.log('polygon closed!!!', polygon.vertices.length); - this.multi = 0; - } else if (this.mnormal) { - polygon.vertices.push(this.v3); - } else { - polygon.vertices.unshift(this.v2); - } - - return; - - } - - let polygon = new ThreeBSP.Polygon; - - switch (reduce) { - case 0: - polygon.vertices.push(this.v1, this.v2, this.v3, this.v4); - break; - case 1: - polygon.vertices.push(this.v1, this.v3, this.v4); - break; - case 2: - polygon.vertices.push(this.v1, this.v2, this.v3); - break; - } - - this.polygons.push(polygon); -}; - -PolygonsCreator.prototype.SetNormal4 = function (nx1, ny1, nz1, - nx2, ny2, nz2, - nx3, ny3, nz3, - nx4, ny4, nz4, - reduce) { - this.v1.setnormal(nx1, ny1, nz1); - if (this.v2) this.v2.setnormal(nx2, ny2, nz2); - this.v3.setnormal(nx3, ny3, nz3); - if (this.v4) this.v4.setnormal(nx4, ny4, nz4); -}; - -PolygonsCreator.prototype.SetNormal_12_34 = function (nx12, ny12, nz12, nx34, ny34, nz34, reduce) { - // special shortcut, when same normals can be applied for 1-2 point and 3-4 point - this.v1.setnormal(nx12, ny12, nz12); - if (this.v2) this.v2.setnormal(nx12, ny12, nz12); - this.v3.setnormal(nx34, ny34, nz34); - if (this.v4) this.v4.setnormal(nx34, ny34, nz34); -}; - -PolygonsCreator.prototype.CalcNormal = function () { - - if (!this.cb) { - this.pA = new THREE.Vector3(); - this.pB = new THREE.Vector3(); - this.pC = new THREE.Vector3(); - this.cb = new THREE.Vector3(); - this.ab = new THREE.Vector3(); - } - - this.pA.set(this.v1.x, this.v1.y, this.v1.z); - - if (this.reduce !== 1) { - this.pB.set(this.v2.x, this.v2.y, this.v2.z); - this.pC.set(this.v3.x, this.v3.y, this.v3.z); - } else { - this.pB.set(this.v3.x, this.v3.y, this.v3.z); - this.pC.set(this.v4.x, this.v4.y, this.v4.z); - } - - this.cb.subVectors(this.pC, this.pB); - this.ab.subVectors(this.pA, this.pB); - this.cb.cross(this.ab); - - this.SetNormal(this.cb.x, this.cb.y, this.cb.z); -}; - - -PolygonsCreator.prototype.SetNormal = function (nx, ny, nz) { - this.v1.setnormal(nx, ny, nz); - if (this.v2) this.v2.setnormal(nx, ny, nz); - this.v3.setnormal(nx, ny, nz); - if (this.v4) this.v4.setnormal(nx, ny, nz); -}; - -PolygonsCreator.prototype.RecalcZ = function (func) { - this.v1.z = func(this.v1.x, this.v1.y, this.v1.z); - if (this.v2) this.v2.z = func(this.v2.x, this.v2.y, this.v2.z); - this.v3.z = func(this.v3.x, this.v3.y, this.v3.z); - if (this.v4) this.v4.z = func(this.v4.x, this.v4.y, this.v4.z); -}; - -PolygonsCreator.prototype.Create = function () { - return {polygons: this.polygons}; -}; - -// ================= all functions to create geometry =================================== - -/** */ -export function createCubeBuffer(shape, faces_limit) { - - if (faces_limit < 0) return 12; - - const dx = shape.fDX, dy = shape.fDY, dz = shape.fDZ; - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(12); - - creator.AddFace4(dx, dy, dz, dx, -dy, dz, dx, -dy, -dz, dx, dy, -dz); - creator.SetNormal(1, 0, 0); - - creator.AddFace4(-dx, dy, -dz, -dx, -dy, -dz, -dx, -dy, dz, -dx, dy, dz); - creator.SetNormal(-1, 0, 0); - - creator.AddFace4(-dx, dy, -dz, -dx, dy, dz, dx, dy, dz, dx, dy, -dz); - creator.SetNormal(0, 1, 0); - - creator.AddFace4(-dx, -dy, dz, -dx, -dy, -dz, dx, -dy, -dz, dx, -dy, dz); - creator.SetNormal(0, -1, 0); - - creator.AddFace4(-dx, dy, dz, -dx, -dy, dz, dx, -dy, dz, dx, dy, dz); - creator.SetNormal(0, 0, 1); - - creator.AddFace4(dx, dy, -dz, dx, -dy, -dz, -dx, -dy, -dz, -dx, dy, -dz); - creator.SetNormal(0, 0, -1); - - return creator.Create(); -} - -/** */ -export function create8edgesBuffer(v, faces_limit) { - - const indicies = [4, 7, 6, 5, 0, 3, 7, 4, 4, 5, 1, 0, 6, 2, 1, 5, 7, 3, 2, 6, 1, 2, 3, 0]; - - const creator = (faces_limit > 0) ? new PolygonsCreator : new GeometryCreator(12); - - for (let n = 0; n < indicies.length; n += 4) { - const i1 = indicies[n] * 3, - i2 = indicies[n + 1] * 3, - i3 = indicies[n + 2] * 3, - i4 = indicies[n + 3] * 3; - creator.AddFace4(v[i1], v[i1 + 1], v[i1 + 2], v[i2], v[i2 + 1], v[i2 + 2], - v[i3], v[i3 + 1], v[i3 + 2], v[i4], v[i4 + 1], v[i4 + 2]); - if (n === 0) creator.SetNormal(0, 0, 1); else if (n === 20) creator.SetNormal(0, 0, -1); else creator.CalcNormal(); - } - - return creator.Create(); -} - -/** */ -export function createParaBuffer(shape, faces_limit) { - - if (faces_limit < 0) return 12; - - const txy = shape.fTxy, txz = shape.fTxz, tyz = shape.fTyz; - - const v = [ - -shape.fZ * txz - txy * shape.fY - shape.fX, -shape.fY - shape.fZ * tyz, -shape.fZ, - -shape.fZ * txz + txy * shape.fY - shape.fX, shape.fY - shape.fZ * tyz, -shape.fZ, - -shape.fZ * txz + txy * shape.fY + shape.fX, shape.fY - shape.fZ * tyz, -shape.fZ, - -shape.fZ * txz - txy * shape.fY + shape.fX, -shape.fY - shape.fZ * tyz, -shape.fZ, - shape.fZ * txz - txy * shape.fY - shape.fX, -shape.fY + shape.fZ * tyz, shape.fZ, - shape.fZ * txz + txy * shape.fY - shape.fX, shape.fY + shape.fZ * tyz, shape.fZ, - shape.fZ * txz + txy * shape.fY + shape.fX, shape.fY + shape.fZ * tyz, shape.fZ, - shape.fZ * txz - txy * shape.fY + shape.fX, -shape.fY + shape.fZ * tyz, shape.fZ]; - - return create8edgesBuffer(v, faces_limit); -} - -/** */ -export function createTrapezoidBuffer(shape, faces_limit) { - - if (faces_limit < 0) return 12; - - let y1, y2; - if (shape._typename === "TGeoTrd1") { - y1 = y2 = shape.fDY; - } else { - y1 = shape.fDy1; - y2 = shape.fDy2; - } - - const v = [ - -shape.fDx1, y1, -shape.fDZ, - shape.fDx1, y1, -shape.fDZ, - shape.fDx1, -y1, -shape.fDZ, - -shape.fDx1, -y1, -shape.fDZ, - -shape.fDx2, y2, shape.fDZ, - shape.fDx2, y2, shape.fDZ, - shape.fDx2, -y2, shape.fDZ, - -shape.fDx2, -y2, shape.fDZ - ]; - - return create8edgesBuffer(v, faces_limit); -} - - -/** */ -export function createArb8Buffer(shape, faces_limit) { - - if (faces_limit < 0) return 12; - - const vertices = [ - shape.fXY[0][0], shape.fXY[0][1], -shape.fDZ, - shape.fXY[1][0], shape.fXY[1][1], -shape.fDZ, - shape.fXY[2][0], shape.fXY[2][1], -shape.fDZ, - shape.fXY[3][0], shape.fXY[3][1], -shape.fDZ, - shape.fXY[4][0], shape.fXY[4][1], shape.fDZ, - shape.fXY[5][0], shape.fXY[5][1], shape.fDZ, - shape.fXY[6][0], shape.fXY[6][1], shape.fDZ, - shape.fXY[7][0], shape.fXY[7][1], shape.fDZ - ], - indicies = [ - 4, 7, 6, 6, 5, 4, 0, 3, 7, 7, 4, 0, - 4, 5, 1, 1, 0, 4, 6, 2, 1, 1, 5, 6, - 7, 3, 2, 2, 6, 7, 1, 2, 3, 3, 0, 1]; - - // detect same vertices on both Z-layers - for (let side = 0; side < vertices.length; side += vertices.length / 2) - for (let n1 = side; n1 < side + vertices.length / 2 - 3; n1 += 3) - for (let n2 = n1 + 3; n2 < side + vertices.length / 2; n2 += 3) - if ((vertices[n1] === vertices[n2]) && - (vertices[n1 + 1] === vertices[n2 + 1]) && - (vertices[n1 + 2] === vertices[n2 + 2])) { - for (let k = 0; k < indicies.length; ++k) - if (indicies[k] === n2 / 3) indicies[k] = n1 / 3; - } - - - const map = []; - let // list of existing faces (with all rotations) - numfaces = 0; - - for (let k = 0; k < indicies.length; k += 3) { - const id1 = indicies[k] * 100 + indicies[k + 1] * 10 + indicies[k + 2], - id2 = indicies[k + 1] * 100 + indicies[k + 2] * 10 + indicies[k], - id3 = indicies[k + 2] * 100 + indicies[k] * 10 + indicies[k + 1]; - - if ((indicies[k] === indicies[k + 1]) || (indicies[k] === indicies[k + 2]) || (indicies[k + 1] === indicies[k + 2]) || - (map.indexOf(id1) >= 0) || (map.indexOf(id2) >= 0) || (map.indexOf(id3) >= 0)) { - indicies[k] = indicies[k + 1] = indicies[k + 2] = -1; - } else { - map.push(id1, id2, id3); - numfaces++; - } - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - // var creator = new GeometryCreator(numfaces); - - for (let n = 0; n < indicies.length; n += 6) { - const i1 = indicies[n] * 3, - i2 = indicies[n + 1] * 3, - i3 = indicies[n + 2] * 3, - i4 = indicies[n + 3] * 3, - i5 = indicies[n + 4] * 3, - i6 = indicies[n + 5] * 3; - let norm = null; - - if ((i1 >= 0) && (i4 >= 0) && faces_limit) { - // try to identify two faces with same normal - very useful if one can create face4 - if (n === 0) norm = new THREE.Vector3(0, 0, 1); else if (n === 30) norm = new THREE.Vector3(0, 0, -1); else { - const norm1 = GetNormal(vertices[i1], vertices[i1 + 1], vertices[i1 + 2], - vertices[i2], vertices[i2 + 1], vertices[i2 + 2], - vertices[i3], vertices[i3 + 1], vertices[i3 + 2]); - - norm1.normalize(); - - const norm2 = GetNormal(vertices[i4], vertices[i4 + 1], vertices[i4 + 2], - vertices[i5], vertices[i5 + 1], vertices[i5 + 2], - vertices[i6], vertices[i6 + 1], vertices[i6 + 2]); - - norm2.normalize(); - - if (norm1.distanceToSquared(norm2) < 1e-12) norm = norm1; - } - } - - if (norm !== null) { - creator.AddFace4(vertices[i1], vertices[i1 + 1], vertices[i1 + 2], - vertices[i2], vertices[i2 + 1], vertices[i2 + 2], - vertices[i3], vertices[i3 + 1], vertices[i3 + 2], - vertices[i5], vertices[i5 + 1], vertices[i5 + 2]); - creator.SetNormal(norm.x, norm.y, norm.z); - } else { - if (i1 >= 0) { - creator.AddFace3(vertices[i1], vertices[i1 + 1], vertices[i1 + 2], - vertices[i2], vertices[i2 + 1], vertices[i2 + 2], - vertices[i3], vertices[i3 + 1], vertices[i3 + 2]); - creator.CalcNormal(); - } - if (i4 >= 0) { - creator.AddFace3(vertices[i4], vertices[i4 + 1], vertices[i4 + 2], - vertices[i5], vertices[i5 + 1], vertices[i5 + 2], - vertices[i6], vertices[i6 + 1], vertices[i6 + 2]); - creator.CalcNormal(); - } - } - } - - return creator.Create(); -} - -/** */ -export function createSphereBuffer(shape, faces_limit) { - let radius = [shape.fRmax, shape.fRmin], - phiStart = shape.fPhi1, - phiLength = shape.fPhi2 - shape.fPhi1, - thetaStart = shape.fTheta1, - thetaLength = shape.fTheta2 - shape.fTheta1, - widthSegments = shape.fNseg, - heightSegments = shape.fNz, - noInside = (radius[1] <= 0); - - // widthSegments = 20; heightSegments = 10; - // phiStart = 0; phiLength = 360; thetaStart = 0; thetaLength = 180; - - if (faces_limit > 0) { - const fact = (noInside ? 2 : 4) * widthSegments * heightSegments / faces_limit; - - if (fact > 1.) { - widthSegments = Math.max(4, Math.floor(widthSegments / Math.sqrt(fact))); - heightSegments = Math.max(4, Math.floor(heightSegments / Math.sqrt(fact))); - } - } - - let numoutside = widthSegments * heightSegments * 2, - numtop = widthSegments * 2, - numbottom = widthSegments * 2; - const numcut = phiLength === 360 ? 0 : heightSegments * (noInside ? 2 : 4), - epsilon = 1e-10; - - if (noInside) numbottom = numtop = widthSegments; - - if (faces_limit < 0) return numoutside * (noInside ? 1 : 2) + numtop + numbottom + numcut; - - const _sinp = new Float32Array(widthSegments + 1), - _cosp = new Float32Array(widthSegments + 1), - _sint = new Float32Array(heightSegments + 1), - _cost = new Float32Array(heightSegments + 1); - - for (let n = 0; n <= heightSegments; ++n) { - const theta = (thetaStart + thetaLength / heightSegments * n) * Math.PI / 180; - _sint[n] = Math.sin(theta); - _cost[n] = Math.cos(theta); - } - - for (let n = 0; n <= widthSegments; ++n) { - const phi = (phiStart + phiLength / widthSegments * n) * Math.PI / 180; - _sinp[n] = Math.sin(phi); - _cosp[n] = Math.cos(phi); - } - - if (Math.abs(_sint[0]) <= epsilon) { - numoutside -= widthSegments; - numtop = 0; - } - if (Math.abs(_sint[heightSegments]) <= epsilon) { - numoutside -= widthSegments; - numbottom = 0; - } - - const numfaces = numoutside * (noInside ? 1 : 2) + numtop + numbottom + numcut; - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - // var creator = new GeometryCreator(numfaces); - - for (let side = 0; side < 2; ++side) { - if ((side === 1) && noInside) break; - - let r = radius[side], - s = (side === 0) ? 1 : -1, - d1 = 1 - side, d2 = 1 - d1; - - // use direct algorithm for the sphere - here normals and position can be calculated directly - for (let k = 0; k < heightSegments; ++k) { - - const k1 = k + d1, k2 = k + d2; - - let skip = 0; - if (Math.abs(_sint[k1]) <= epsilon) skip = 1; else if (Math.abs(_sint[k2]) <= epsilon) skip = 2; - - for (let n = 0; n < widthSegments; ++n) { - creator.AddFace4( - r * _sint[k1] * _cosp[n], r * _sint[k1] * _sinp[n], r * _cost[k1], - r * _sint[k1] * _cosp[n + 1], r * _sint[k1] * _sinp[n + 1], r * _cost[k1], - r * _sint[k2] * _cosp[n + 1], r * _sint[k2] * _sinp[n + 1], r * _cost[k2], - r * _sint[k2] * _cosp[n], r * _sint[k2] * _sinp[n], r * _cost[k2], - skip); - creator.SetNormal4( - s * _sint[k1] * _cosp[n], s * _sint[k1] * _sinp[n], s * _cost[k1], - s * _sint[k1] * _cosp[n + 1], s * _sint[k1] * _sinp[n + 1], s * _cost[k1], - s * _sint[k2] * _cosp[n + 1], s * _sint[k2] * _sinp[n + 1], s * _cost[k2], - s * _sint[k2] * _cosp[n], s * _sint[k2] * _sinp[n], s * _cost[k2], - skip); - } - } - } - - // top/bottom - for (let side = 0; side <= heightSegments; side += heightSegments) - if (Math.abs(_sint[side]) >= epsilon) { - let ss = _sint[side], cc = _cost[side], - d1 = (side === 0) ? 0 : 1, d2 = 1 - d1; - for (let n = 0; n < widthSegments; ++n) { - creator.AddFace4( - radius[1] * ss * _cosp[n + d1], radius[1] * ss * _sinp[n + d1], radius[1] * cc, - radius[0] * ss * _cosp[n + d1], radius[0] * ss * _sinp[n + d1], radius[0] * cc, - radius[0] * ss * _cosp[n + d2], radius[0] * ss * _sinp[n + d2], radius[0] * cc, - radius[1] * ss * _cosp[n + d2], radius[1] * ss * _sinp[n + d2], radius[1] * cc, - noInside ? 2 : 0); - creator.CalcNormal(); - } - } - - // cut left/right sides - if (phiLength < 360) { - for (let side = 0; side <= widthSegments; side += widthSegments) { - let ss = _sinp[side], cc = _cosp[side], - d1 = (side === 0) ? 1 : 0, d2 = 1 - d1; - - for (var k = 0; k < heightSegments; ++k) { - creator.AddFace4( - radius[1] * _sint[k + d1] * cc, radius[1] * _sint[k + d1] * ss, radius[1] * _cost[k + d1], - radius[0] * _sint[k + d1] * cc, radius[0] * _sint[k + d1] * ss, radius[0] * _cost[k + d1], - radius[0] * _sint[k + d2] * cc, radius[0] * _sint[k + d2] * ss, radius[0] * _cost[k + d2], - radius[1] * _sint[k + d2] * cc, radius[1] * _sint[k + d2] * ss, radius[1] * _cost[k + d2], - noInside ? 2 : 0); - creator.CalcNormal(); - } - } - } - - return creator.Create(); -} - -/** */ -export function createTubeBuffer(shape, faces_limit) { - let outerR, innerR; // inner/outer tube radius - if ((shape._typename === "TGeoCone") || (shape._typename === "TGeoConeSeg")) { - outerR = [shape.fRmax2, shape.fRmax1]; - innerR = [shape.fRmin2, shape.fRmin1]; - } else { - outerR = [shape.fRmax, shape.fRmax]; - innerR = [shape.fRmin, shape.fRmin]; - } - - const hasrmin = (innerR[0] > 0) || (innerR[1] > 0); - let thetaStart = 0, thetaLength = 360; - - if ((shape._typename === "TGeoConeSeg") || (shape._typename === "TGeoTubeSeg") || (shape._typename === "TGeoCtub")) { - thetaStart = shape.fPhi1; - thetaLength = shape.fPhi2 - shape.fPhi1; - } - - const radiusSegments = Math.max(4, Math.round(thetaLength / GradPerSegm)); - - // external surface - let numfaces = radiusSegments * (((outerR[0] <= 0) || (outerR[1] <= 0)) ? 1 : 2); - - // internal surface - if (hasrmin) - numfaces += radiusSegments * (((innerR[0] <= 0) || (innerR[1] <= 0)) ? 1 : 2); - - // upper cap - if (outerR[0] > 0) numfaces += radiusSegments * ((innerR[0] > 0) ? 2 : 1); - // bottom cup - if (outerR[1] > 0) numfaces += radiusSegments * ((innerR[1] > 0) ? 2 : 1); - - if (thetaLength < 360) - numfaces += ((outerR[0] > innerR[0]) ? 2 : 0) + ((outerR[1] > innerR[1]) ? 2 : 0); - - if (faces_limit < 0) return numfaces; - - const phi0 = thetaStart * Math.PI / 180, - dphi = thetaLength / radiusSegments * Math.PI / 180, - _sin = new Float32Array(radiusSegments + 1), - _cos = new Float32Array(radiusSegments + 1); - - for (let seg = 0; seg <= radiusSegments; ++seg) { - _cos[seg] = Math.cos(phi0 + seg * dphi); - _sin[seg] = Math.sin(phi0 + seg * dphi); - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - // var creator = new GeometryCreator(numfaces); - - let calcZ; - - if (shape._typename === "TGeoCtub") - calcZ = function (x, y, z) { - const arr = (z < 0) ? shape.fNlow : shape.fNhigh; - return ((z < 0) ? -shape.fDz : shape.fDz) - (x * arr[0] + y * arr[1]) / arr[2]; - }; - - // create outer/inner tube - for (let side = 0; side < 2; ++side) { - if ((side === 1) && !hasrmin) break; - - let R = (side === 0) ? outerR : innerR, - d1 = side, d2 = 1 - side, nxy = 1., nz = 0; - - if (R[0] !== R[1]) { - const angle = Math.atan2((R[1] - R[0]), 2 * shape.fDZ); - nxy = Math.cos(angle); - nz = Math.sin(angle); - } - - if (side === 1) { - nxy *= -1; - nz *= -1; - } - let reduce = 0; - if (R[0] <= 0) reduce = 2; else if (R[1] <= 0) reduce = 1; - - for (let seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4( - R[0] * _cos[seg + d1], R[0] * _sin[seg + d1], shape.fDZ, - R[1] * _cos[seg + d1], R[1] * _sin[seg + d1], -shape.fDZ, - R[1] * _cos[seg + d2], R[1] * _sin[seg + d2], -shape.fDZ, - R[0] * _cos[seg + d2], R[0] * _sin[seg + d2], shape.fDZ, - reduce); - - if (calcZ) creator.RecalcZ(calcZ); - - creator.SetNormal_12_34(nxy * _cos[seg + d1], nxy * _sin[seg + d1], nz, - nxy * _cos[seg + d2], nxy * _sin[seg + d2], nz, - reduce); - } - } - - // create upper/bottom part - for (let side = 0; side < 2; ++side) { - if (outerR[side] <= 0) continue; - - let d1 = side, d2 = 1 - side, - sign = (side === 0) ? 1 : -1, - reduce = (innerR[side] <= 0) ? 2 : 0; - if ((reduce === 2) && (thetaLength === 360) && !calcZ) creator.StartPolygon(side === 0); - for (let seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4( - innerR[side] * _cos[seg + d1], innerR[side] * _sin[seg + d1], sign * shape.fDZ, - outerR[side] * _cos[seg + d1], outerR[side] * _sin[seg + d1], sign * shape.fDZ, - outerR[side] * _cos[seg + d2], outerR[side] * _sin[seg + d2], sign * shape.fDZ, - innerR[side] * _cos[seg + d2], innerR[side] * _sin[seg + d2], sign * shape.fDZ, - reduce); - if (calcZ) { - creator.RecalcZ(calcZ); - creator.CalcNormal(); - } else { - creator.SetNormal(0, 0, sign); - } - } - - creator.StopPolygon(); - } - - // create cut surfaces - if (thetaLength < 360) { - creator.AddFace4(innerR[1] * _cos[0], innerR[1] * _sin[0], -shape.fDZ, - outerR[1] * _cos[0], outerR[1] * _sin[0], -shape.fDZ, - outerR[0] * _cos[0], outerR[0] * _sin[0], shape.fDZ, - innerR[0] * _cos[0], innerR[0] * _sin[0], shape.fDZ, - (outerR[0] === innerR[0]) ? 2 : ((innerR[1] === outerR[1]) ? 1 : 0)); - if (calcZ) creator.RecalcZ(calcZ); - creator.CalcNormal(); - - creator.AddFace4(innerR[0] * _cos[radiusSegments], innerR[0] * _sin[radiusSegments], shape.fDZ, - outerR[0] * _cos[radiusSegments], outerR[0] * _sin[radiusSegments], shape.fDZ, - outerR[1] * _cos[radiusSegments], outerR[1] * _sin[radiusSegments], -shape.fDZ, - innerR[1] * _cos[radiusSegments], innerR[1] * _sin[radiusSegments], -shape.fDZ, - (outerR[0] === innerR[0]) ? 1 : ((innerR[1] === outerR[1]) ? 2 : 0)); - - if (calcZ) creator.RecalcZ(calcZ); - creator.CalcNormal(); - } - - return creator.Create(); -} - -/** */ -export function createEltuBuffer(shape, faces_limit) { - const radiusSegments = Math.max(4, Math.round(360 / GradPerSegm)); - - if (faces_limit < 0) return radiusSegments * 4; - - // calculate all sin/cos tables in advance - const x = new Float32Array(radiusSegments + 1), - y = new Float32Array(radiusSegments + 1); - for (let seg = 0; seg <= radiusSegments; ++seg) { - const phi = seg / radiusSegments * 2 * Math.PI; - x[seg] = shape.fRmin * Math.cos(phi); - y[seg] = shape.fRmax * Math.sin(phi); - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(radiusSegments * 4); - let nx1 = 1, ny1 = 0, nx2 = 1, ny2 = 0; - - // create tube faces - for (let seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4(x[seg], y[seg], +shape.fDZ, - x[seg], y[seg], -shape.fDZ, - x[seg + 1], y[seg + 1], -shape.fDZ, - x[seg + 1], y[seg + 1], shape.fDZ); - - // calculate normals ourself - nx1 = nx2; - ny1 = ny2; - nx2 = x[seg + 1] * shape.fRmax / shape.fRmin; - ny2 = y[seg + 1] * shape.fRmin / shape.fRmax; - const dist = Math.sqrt(nx2 * nx2 + ny2 * ny2); - nx2 = nx2 / dist; - ny2 = ny2 / dist; - - creator.SetNormal_12_34(nx1, ny1, 0, nx2, ny2, 0); - } - - // create top/bottom sides - for (let side = 0; side < 2; ++side) { - const sign = (side === 0) ? 1 : -1, d1 = side, d2 = 1 - side; - for (let seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace3(0, 0, sign * shape.fDZ, - x[seg + d1], y[seg + d1], sign * shape.fDZ, - x[seg + d2], y[seg + d2], sign * shape.fDZ); - creator.SetNormal(0, 0, sign); - } - } - - return creator.Create(); -} - -/** */ -export function createTorusBuffer(shape, faces_limit) { - const radius = shape.fR; - let radialSegments = Math.max(6, Math.round(360 / GradPerSegm)), - tubularSegments = Math.max(8, Math.round(shape.fDphi / GradPerSegm)); - - let numfaces = (shape.fRmin > 0 ? 4 : 2) * radialSegments * (tubularSegments + (shape.fDphi !== 360 ? 1 : 0)); - - if (faces_limit < 0) return numfaces; - - if ((faces_limit > 0) && (numfaces > faces_limit)) { - radialSegments = Math.floor(radialSegments / Math.sqrt(numfaces / faces_limit)); - tubularSegments = Math.floor(tubularSegments / Math.sqrt(numfaces / faces_limit)); - numfaces = (shape.fRmin > 0 ? 4 : 2) * radialSegments * (tubularSegments + (shape.fDphi !== 360 ? 1 : 0)); - } - - const _sinr = new Float32Array(radialSegments + 1), - _cosr = new Float32Array(radialSegments + 1), - _sint = new Float32Array(tubularSegments + 1), - _cost = new Float32Array(tubularSegments + 1); - - for (let n = 0; n <= radialSegments; ++n) { - _sinr[n] = Math.sin(n / radialSegments * 2 * Math.PI); - _cosr[n] = Math.cos(n / radialSegments * 2 * Math.PI); - } - - for (let t = 0; t <= tubularSegments; ++t) { - const angle = (shape.fPhi1 + shape.fDphi * t / tubularSegments) / 180 * Math.PI; - _sint[t] = Math.sin(angle); - _cost[t] = Math.cos(angle); - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - // use vectors for normals calculation - const p1 = new THREE.Vector3(), p2 = new THREE.Vector3(), p3 = new THREE.Vector3(), p4 = new THREE.Vector3(), - n1 = new THREE.Vector3(), n2 = new THREE.Vector3(), n3 = new THREE.Vector3(), n4 = new THREE.Vector3(), - center1 = new THREE.Vector3(), center2 = new THREE.Vector3(); - - for (let side = 0; side < 2; ++side) { - if ((side > 0) && (shape.fRmin <= 0)) break; - let tube = (side > 0) ? shape.fRmin : shape.fRmax, - d1 = 1 - side, d2 = 1 - d1, ns = side > 0 ? -1 : 1; - - for (let t = 0; t < tubularSegments; ++t) { - const t1 = t + d1, t2 = t + d2; - center1.x = radius * _cost[t1]; - center1.y = radius * _sint[t1]; - center2.x = radius * _cost[t2]; - center2.y = radius * _sint[t2]; - - for (let n = 0; n < radialSegments; ++n) { - p1.x = (radius + tube * _cosr[n]) * _cost[t1]; - p1.y = (radius + tube * _cosr[n]) * _sint[t1]; - p1.z = tube * _sinr[n]; - p2.x = (radius + tube * _cosr[n + 1]) * _cost[t1]; - p2.y = (radius + tube * _cosr[n + 1]) * _sint[t1]; - p2.z = tube * _sinr[n + 1]; - p3.x = (radius + tube * _cosr[n + 1]) * _cost[t2]; - p3.y = (radius + tube * _cosr[n + 1]) * _sint[t2]; - p3.z = tube * _sinr[n + 1]; - p4.x = (radius + tube * _cosr[n]) * _cost[t2]; - p4.y = (radius + tube * _cosr[n]) * _sint[t2]; - p4.z = tube * _sinr[n]; - - creator.AddFace4(p1.x, p1.y, p1.z, - p2.x, p2.y, p2.z, - p3.x, p3.y, p3.z, - p4.x, p4.y, p4.z); - - n1.subVectors(p1, center1).normalize(); - n2.subVectors(p2, center1).normalize(); - n3.subVectors(p3, center2).normalize(); - n4.subVectors(p4, center2).normalize(); - - creator.SetNormal4(ns * n1.x, ns * n1.y, ns * n1.z, - ns * n2.x, ns * n2.y, ns * n2.z, - ns * n3.x, ns * n3.y, ns * n3.z, - ns * n4.x, ns * n4.y, ns * n4.z); - } - } - } - - if (shape.fDphi !== 360) - for (let t = 0; t <= tubularSegments; t += tubularSegments) { - let tube1 = shape.fRmax, tube2 = shape.fRmin, - d1 = (t > 0) ? 0 : 1, d2 = 1 - d1, - skip = (shape.fRmin) > 0 ? 0 : 1, - nsign = t > 0 ? 1 : -1; - for (var n = 0; n < radialSegments; ++n) { - creator.AddFace4((radius + tube1 * _cosr[n + d1]) * _cost[t], (radius + tube1 * _cosr[n + d1]) * _sint[t], tube1 * _sinr[n + d1], - (radius + tube2 * _cosr[n + d1]) * _cost[t], (radius + tube2 * _cosr[n + d1]) * _sint[t], tube2 * _sinr[n + d1], - (radius + tube2 * _cosr[n + d2]) * _cost[t], (radius + tube2 * _cosr[n + d2]) * _sint[t], tube2 * _sinr[n + d2], - (radius + tube1 * _cosr[n + d2]) * _cost[t], (radius + tube1 * _cosr[n + d2]) * _sint[t], tube1 * _sinr[n + d2], skip); - creator.SetNormal(-nsign * _sint[t], nsign * _cost[t], 0); - } - } - - return creator.Create(); -} - -/** */ -export function createPolygonBuffer(shape, faces_limit) { - const thetaStart = shape.fPhi1, - thetaLength = shape.fDphi; - let radiusSegments = 60; - - if (shape._typename === "TGeoPgon") - radiusSegments = shape.fNedges; - else - radiusSegments = Math.max(5, Math.round(thetaLength / GradPerSegm)); - - const usage = new Int16Array(2 * shape.fNz); - let numusedlayers = 0, hasrmin = false; - - for (let layer = 0; layer < shape.fNz; ++layer) - if (shape.fRmin[layer] > 0) hasrmin = true; - - // return very rough estimation, number of faces may be much less - if (faces_limit < 0) return (hasrmin ? 4 : 2) * radiusSegments * (shape.fNz - 1); - - // coordinate of point on cut edge (x,z) - const pnts = (thetaLength === 360) ? null : []; - - // first analyse levels - if we need to create all of them - for (let side = 0; side < 2; ++side) { - let rside = (side === 0) ? 'fRmax' : 'fRmin'; - - for (var layer = 0; layer < shape.fNz; ++layer) { - - // first create points for the layer - var layerz = shape.fZ[layer], rad = shape[rside][layer]; - - usage[layer * 2 + side] = 0; - - if ((layer > 0) && (layer < shape.fNz - 1)) - if (((shape.fZ[layer - 1] === layerz) && (shape[rside][layer - 1] === rad)) || - ((shape[rside][layer + 1] === rad) && (shape[rside][layer - 1] === rad))) { - - // same Z and R as before - ignore - // or same R before and after - - continue; - } - - if ((layer > 0) && ((side === 0) || hasrmin)) { - usage[layer * 2 + side] = 1; - numusedlayers++; - } - - if (pnts !== null) { - if (side === 0) { - pnts.push(new THREE.Vector2(rad, layerz)); - } else if (rad < shape.fRmax[layer]) { - pnts.unshift(new THREE.Vector2(rad, layerz)); - } - } - } - } - - let numfaces = numusedlayers * radiusSegments * 2; - if (shape.fRmin[0] !== shape.fRmax[0]) numfaces += radiusSegments * (hasrmin ? 2 : 1); - if (shape.fRmin[shape.fNz - 1] !== shape.fRmax[shape.fNz - 1]) numfaces += radiusSegments * (hasrmin ? 2 : 1); - - let cut_faces = null; - - if (pnts !== null) { - if (pnts.length === shape.fNz * 2) { - // special case - all layers are there, create faces ourself - cut_faces = []; - for (var layer = shape.fNz - 1; layer > 0; --layer) { - if (shape.fZ[layer] === shape.fZ[layer - 1]) continue; - const right = 2 * shape.fNz - 1 - layer; - cut_faces.push([right, layer - 1, layer]); - cut_faces.push([right, right + 1, layer - 1]); - } - - } else { - // let three.js calculate our faces - // console.log('triangulate polygon ' + shape.fShapeId); - cut_faces = THREE.ShapeUtils.triangulateShape(pnts, []); - } - numfaces += cut_faces.length * 2; - } - - const phi0 = thetaStart * Math.PI / 180, dphi = thetaLength / radiusSegments * Math.PI / 180; - - // calculate all sin/cos tables in advance - const _sin = new Float32Array(radiusSegments + 1), - _cos = new Float32Array(radiusSegments + 1); - for (let seg = 0; seg <= radiusSegments; ++seg) { - _cos[seg] = Math.cos(phi0 + seg * dphi); - _sin[seg] = Math.sin(phi0 + seg * dphi); - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - // add sides - for (let side = 0; side < 2; ++side) { - let rside = (side === 0) ? 'fRmax' : 'fRmin', - z1 = shape.fZ[0], r1 = shape[rside][0], - d1 = 1 - side, d2 = side; - - for (var layer = 0; layer < shape.fNz; ++layer) { - - if (usage[layer * 2 + side] === 0) continue; - - const z2 = shape.fZ[layer], r2 = shape[rside][layer]; - let nxy = 1, nz = 0; - - if ((r2 !== r1)) { - const angle = Math.atan2((r2 - r1), (z2 - z1)); - nxy = Math.cos(angle); - nz = Math.sin(angle); - } - - if (side > 0) { - nxy *= -1; - nz *= -1; - } - - for (var seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4(r1 * _cos[seg + d1], r1 * _sin[seg + d1], z1, - r2 * _cos[seg + d1], r2 * _sin[seg + d1], z2, - r2 * _cos[seg + d2], r2 * _sin[seg + d2], z2, - r1 * _cos[seg + d2], r1 * _sin[seg + d2], z1); - creator.SetNormal_12_34(nxy * _cos[seg + d1], nxy * _sin[seg + d1], nz, nxy * _cos[seg + d2], nxy * _sin[seg + d2], nz); - } - - z1 = z2; - r1 = r2; - } - } - - // add top/bottom - for (let layer = 0; layer < shape.fNz; layer += (shape.fNz - 1)) { - - const rmin = shape.fRmin[layer], rmax = shape.fRmax[layer]; - - if (rmin === rmax) continue; - - let layerz = shape.fZ[layer], - d1 = (layer === 0) ? 1 : 0, d2 = 1 - d1, - normalz = (layer === 0) ? -1 : 1; - - if (!hasrmin && !cut_faces) creator.StartPolygon(layer > 0); - - for (var seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4(rmin * _cos[seg + d1], rmin * _sin[seg + d1], layerz, - rmax * _cos[seg + d1], rmax * _sin[seg + d1], layerz, - rmax * _cos[seg + d2], rmax * _sin[seg + d2], layerz, - rmin * _cos[seg + d2], rmin * _sin[seg + d2], layerz, - hasrmin ? 0 : 2); - creator.SetNormal(0, 0, normalz); - } - - creator.StopPolygon(); - } - - if (cut_faces) - for (let seg = 0; seg <= radiusSegments; seg += radiusSegments) { - let d1 = (seg === 0) ? 1 : 2, d2 = 3 - d1; - for (let n = 0; n < cut_faces.length; ++n) { - const a = pnts[cut_faces[n][0]], - b = pnts[cut_faces[n][d1]], - c = pnts[cut_faces[n][d2]]; - - creator.AddFace3(a.x * _cos[seg], a.x * _sin[seg], a.y, - b.x * _cos[seg], b.x * _sin[seg], b.y, - c.x * _cos[seg], c.x * _sin[seg], c.y); - - creator.CalcNormal(); - } - } - - return creator.Create(); -} - -/** */ -export function createXtruBuffer(shape, faces_limit) { - let nfaces = (shape.fNz - 1) * shape.fNvert * 2; - - if (faces_limit < 0) return nfaces + shape.fNvert * 3; - - // create points - let pnts = []; - for (let vert = 0; vert < shape.fNvert; ++vert) - pnts.push(new THREE.Vector2(shape.fX[vert], shape.fY[vert])); - - // console.log('triangulate Xtru ' + shape.fShapeId); - let faces = THREE.ShapeUtils.triangulateShape(pnts, []); - if (faces.length < pnts.length - 2) { - warn('Problem with XTRU shape ' + shape.fName + ' with ' + pnts.length + ' vertices'); - faces = []; - } else { - nfaces += faces.length * 2; - } - - let creator = faces_limit ? new PolygonsCreator : new GeometryCreator(nfaces); - - for (let layer = 0; layer < shape.fNz - 1; ++layer) { - let z1 = shape.fZ[layer], scale1 = shape.fScale[layer], - z2 = shape.fZ[layer + 1], scale2 = shape.fScale[layer + 1], - x01 = shape.fX0[layer], x02 = shape.fX0[layer + 1], - y01 = shape.fY0[layer], y02 = shape.fY0[layer + 1]; - - for (let vert1 = 0; vert1 < shape.fNvert; ++vert1) { - let vert2 = (vert1 + 1) % shape.fNvert; - creator.AddFace4(scale1 * shape.fX[vert1] + x01, scale1 * shape.fY[vert1] + y01, z1, - scale2 * shape.fX[vert1] + x02, scale2 * shape.fY[vert1] + y02, z2, - scale2 * shape.fX[vert2] + x02, scale2 * shape.fY[vert2] + y02, z2, - scale1 * shape.fX[vert2] + x01, scale1 * shape.fY[vert2] + y01, z1); - creator.CalcNormal(); - } - } - - for (let layer = 0; layer <= shape.fNz - 1; layer += (shape.fNz - 1)) { - let z = shape.fZ[layer], scale = shape.fScale[layer], - x0 = shape.fX0[layer], y0 = shape.fY0[layer]; - - for (let n = 0; n < faces.length; ++n) { - let face = faces[n], - pnt1 = pnts[face[0]], - pnt2 = pnts[face[(layer === 0) ? 2 : 1]], - pnt3 = pnts[face[(layer === 0) ? 1 : 2]]; - - creator.AddFace3(scale * pnt1.x + x0, scale * pnt1.y + y0, z, - scale * pnt2.x + x0, scale * pnt2.y + y0, z, - scale * pnt3.x + x0, scale * pnt3.y + y0, z); - creator.SetNormal(0, 0, layer === 0 ? -1 : 1); - } - } - - return creator.Create(); -} - -/** */ -export function createParaboloidBuffer(shape, faces_limit) { - - let radiusSegments = Math.max(4, Math.round(360 / GradPerSegm)), - heightSegments = 30; - - if (faces_limit > 0) { - const fact = 2 * radiusSegments * (heightSegments + 1) / faces_limit; - if (fact > 1.) { - radiusSegments = Math.max(5, Math.floor(radiusSegments / Math.sqrt(fact))); - heightSegments = Math.max(5, Math.floor(heightSegments / Math.sqrt(fact))); - } - } - - let zmin = -shape.fDZ, zmax = shape.fDZ; - const rmin = shape.fRlo, rmax = shape.fRhi; - - // if no radius at -z, find intersection - if (shape.fA >= 0) { - if (shape.fB > zmin) zmin = shape.fB; - } else { - if (shape.fB < zmax) zmax = shape.fB; - } - - const ttmin = Math.atan2(zmin, rmin), ttmax = Math.atan2(zmax, rmax); - - let numfaces = (heightSegments + 1) * radiusSegments * 2; - if (rmin === 0) numfaces -= radiusSegments * 2; // complete layer - if (rmax === 0) numfaces -= radiusSegments * 2; // complete layer - - if (faces_limit < 0) return numfaces; - - // calculate all sin/cos tables in advance - const _sin = new Float32Array(radiusSegments + 1), - _cos = new Float32Array(radiusSegments + 1); - for (var seg = 0; seg <= radiusSegments; ++seg) { - _cos[seg] = Math.cos(seg / radiusSegments * 2 * Math.PI); - _sin[seg] = Math.sin(seg / radiusSegments * 2 * Math.PI); - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - let lastz = zmin, lastr = 0, lastnxy = 0, lastnz = -1; - - for (let layer = 0; layer <= heightSegments + 1; ++layer) { - - let layerz = 0, radius = 0, nxy = 0, nz = -1; - - if ((layer === 0) && (rmin === 0)) continue; - - if ((layer === heightSegments + 1) && (lastr === 0)) break; - - switch (layer) { - case 0: - layerz = zmin; - radius = rmin; - break; - case heightSegments: - layerz = zmax; - radius = rmax; - break; - case heightSegments + 1: - layerz = zmax; - radius = 0; - break; - default: { - const tt = Math.tan(ttmin + (ttmax - ttmin) * layer / heightSegments); - const delta = tt * tt - 4 * shape.fA * shape.fB; // should be always positive (a*b<0) - radius = 0.5 * (tt + Math.sqrt(delta)) / shape.fA; - if (radius < 1e-6) radius = 0; - layerz = radius * tt; - } - } - - nxy = shape.fA * radius; - nz = (shape.fA > 0) ? -1 : 1; - - let skip = 0; - if (lastr === 0) skip = 1; else if (radius === 0) skip = 2; - - for (let seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4(radius * _cos[seg], radius * _sin[seg], layerz, - lastr * _cos[seg], lastr * _sin[seg], lastz, - lastr * _cos[seg + 1], lastr * _sin[seg + 1], lastz, - radius * _cos[seg + 1], radius * _sin[seg + 1], layerz, skip); - - // use analytic normal values when open/closing paraboloid around 0 - // cut faces (top or bottom) set with simple normal - if ((skip === 0) || ((layer === 1) && (rmin === 0)) || ((layer === heightSegments + 1) && (rmax === 0))) - creator.SetNormal4(nxy * _cos[seg], nxy * _sin[seg], nz, - lastnxy * _cos[seg], lastnxy * _sin[seg], lastnz, - lastnxy * _cos[seg + 1], lastnxy * _sin[seg + 1], lastnz, - nxy * _cos[seg + 1], nxy * _sin[seg + 1], nz, skip); - else - creator.SetNormal(0, 0, (layer < heightSegments) ? -1 : 1); - } - - lastz = layerz; - lastr = radius; - lastnxy = nxy; - lastnz = nz; - } - - return creator.Create(); -} - -/** */ -export function createHypeBuffer(shape, faces_limit) { - - if ((shape.fTin === 0) && (shape.fTout === 0)) - return createTubeBuffer(shape, faces_limit); - - let radiusSegments = Math.max(4, Math.round(360 / GradPerSegm)), - heightSegments = 30; - - let numfaces = radiusSegments * (heightSegments + 1) * ((shape.fRmin > 0) ? 4 : 2); - - if (faces_limit < 0) return numfaces; - - if ((faces_limit > 0) && (faces_limit > numfaces)) { - radiusSegments = Math.max(4, Math.floor(radiusSegments / Math.sqrt(numfaces / faces_limit))); - heightSegments = Math.max(4, Math.floor(heightSegments / Math.sqrt(numfaces / faces_limit))); - numfaces = radiusSegments * (heightSegments + 1) * ((shape.fRmin > 0) ? 4 : 2); - } - - // calculate all sin/cos tables in advance - const _sin = new Float32Array(radiusSegments + 1), _cos = new Float32Array(radiusSegments + 1); - for (let seg = 0; seg <= radiusSegments; ++seg) { - _cos[seg] = Math.cos(seg / radiusSegments * 2 * Math.PI); - _sin[seg] = Math.sin(seg / radiusSegments * 2 * Math.PI); - } - - const creator = faces_limit ? new PolygonsCreator : new GeometryCreator(numfaces); - - // in-out side - for (let side = 0; side < 2; ++side) { - if ((side > 0) && (shape.fRmin <= 0)) break; - - let r0 = (side > 0) ? shape.fRmin : shape.fRmax, - tsq = (side > 0) ? shape.fTinsq : shape.fToutsq, - d1 = 1 - side, d2 = 1 - d1; - - // vertical layers - for (let layer = 0; layer < heightSegments; ++layer) { - let z1 = -shape.fDz + layer / heightSegments * 2 * shape.fDz, - z2 = -shape.fDz + (layer + 1) / heightSegments * 2 * shape.fDz, - r1 = Math.sqrt(r0 * r0 + tsq * z1 * z1), - r2 = Math.sqrt(r0 * r0 + tsq * z2 * z2); - - for (let seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4(r1 * _cos[seg + d1], r1 * _sin[seg + d1], z1, - r2 * _cos[seg + d1], r2 * _sin[seg + d1], z2, - r2 * _cos[seg + d2], r2 * _sin[seg + d2], z2, - r1 * _cos[seg + d2], r1 * _sin[seg + d2], z1); - creator.CalcNormal(); - } - } - } - - // add caps - for (let layer = 0; layer < 2; ++layer) { - let z = (layer === 0) ? shape.fDz : -shape.fDz, - r1 = Math.sqrt(shape.fRmax * shape.fRmax + shape.fToutsq * z * z), - r2 = (shape.fRmin > 0) ? Math.sqrt(shape.fRmin * shape.fRmin + shape.fTinsq * z * z) : 0, - skip = (shape.fRmin > 0) ? 0 : 1, - d1 = 1 - layer, d2 = 1 - d1; - for (var seg = 0; seg < radiusSegments; ++seg) { - creator.AddFace4(r1 * _cos[seg + d1], r1 * _sin[seg + d1], z, - r2 * _cos[seg + d1], r2 * _sin[seg + d1], z, - r2 * _cos[seg + d2], r2 * _sin[seg + d2], z, - r1 * _cos[seg + d2], r1 * _sin[seg + d2], z, skip); - creator.SetNormal(0, 0, (layer === 0) ? 1 : -1) - } - - } - - return creator.Create(); -} - -/** */ -function createMatrix(matrix) { - - if (!matrix) return null; - - let translation = null, rotation = null, scale = null; - - switch (matrix._typename) { - case 'TGeoTranslation': - translation = matrix.fTranslation; - break; - case 'TGeoRotation': - rotation = matrix.fRotationMatrix; - break; - case 'TGeoScale': - scale = matrix.fScale; - break; - case 'TGeoGenTrans': - scale = matrix.fScale; // no break, translation and rotation follows - case 'TGeoCombiTrans': - translation = matrix.fTranslation; - if (matrix.fRotation) rotation = matrix.fRotation.fRotationMatrix; - break; - case 'TGeoHMatrix': - translation = matrix.fTranslation; - rotation = matrix.fRotationMatrix; - scale = matrix.fScale; - break; - case 'TGeoIdentity': - break; - default: - console.warn('unsupported matrix ' + matrix._typename); - } - - if (!translation && !rotation && !scale) return null; - - const res = new THREE.Matrix4(); - - if (rotation) - res.set(rotation[0], rotation[1], rotation[2], 0, - rotation[3], rotation[4], rotation[5], 0, - rotation[6], rotation[7], rotation[8], 0, - 0, 0, 0, 1); - - if (translation) - res.setPosition(new THREE.Vector3(translation[0], translation[1], translation[2])); - - if (scale) - res.scale(new THREE.Vector3(scale[0], scale[1], scale[2])); - - return res; -} - -/** */ -function getNodeMatrix(kind, node) { - // returns transformation matrix for the node - // created after node visibility flag is checked and volume cut is performed - - let matrix = null; - - if (kind === 1) { - // special handling for EVE nodes - - matrix = new THREE.Matrix4(); - - if (node.fTrans !== null) { - matrix.set(node.fTrans[0], node.fTrans[4], node.fTrans[8], 0, - node.fTrans[1], node.fTrans[5], node.fTrans[9], 0, - node.fTrans[2], node.fTrans[6], node.fTrans[10], 0, - 0, 0, 0, 1); - // second - set position with proper sign - matrix.setPosition({x: node.fTrans[12], y: node.fTrans[13], z: node.fTrans[14]}); - } - } else if (('fMatrix' in node) && (node.fMatrix !== null)) - matrix = createMatrix(node.fMatrix); - else if ((node._typename === "TGeoNodeOffset") && (node.fFinder !== null)) { - let kPatternReflected = BITS.kVisBranch; - if ((node.fFinder.fBits & kPatternReflected) !== 0) - warn('Unsupported reflected pattern ' + node.fFinder._typename); - - // if (node.fFinder._typename === 'TGeoPatternCylR') { } - // if (node.fFinder._typename === 'TGeoPatternSphR') { } - // if (node.fFinder._typename === 'TGeoPatternSphTheta') { } - // if (node.fFinder._typename === 'TGeoPatternSphPhi') { } - // if (node.fFinder._typename === 'TGeoPatternHoneycomb') { } - switch (node.fFinder._typename) { - case 'TGeoPatternX': - case 'TGeoPatternY': - case 'TGeoPatternZ': - case 'TGeoPatternParaX': - case 'TGeoPatternParaY': - case 'TGeoPatternParaZ': - const _shift = node.fFinder.fStart + (node.fIndex + 0.5) * node.fFinder.fStep; - - matrix = new THREE.Matrix4(); - - switch (node.fFinder._typename[node.fFinder._typename.length - 1]) { - case 'X': - matrix.setPosition(new THREE.Vector3(_shift, 0, 0)); - break; - case 'Y': - matrix.setPosition(new THREE.Vector3(0, _shift, 0)); - break; - case 'Z': - matrix.setPosition(new THREE.Vector3(0, 0, _shift)); - break; - } - break; - - case 'TGeoPatternCylPhi': - const phi = (Math.PI / 180) * (node.fFinder.fStart + (node.fIndex + 0.5) * node.fFinder.fStep), - _cos = Math.cos(phi), _sin = Math.sin(phi); - - matrix = new THREE.Matrix4(); - - matrix.set(_cos, -_sin, 0, 0, - _sin, _cos, 0, 0, - 0, 0, 1, 0, - 0, 0, 0, 1); - break; - - case 'TGeoPatternCylR': - // seems to be, require no transformation - matrix = new THREE.Matrix4(); - break; - - case 'TGeoPatternTrapZ': - const dz = node.fFinder.fStart + (node.fIndex + 0.5) * node.fFinder.fStep; - matrix = new THREE.Matrix4(); - matrix.setPosition(new THREE.Vector3(node.fFinder.fTxz * dz, node.fFinder.fTyz * dz, dz)); - break; - - default: - warn('Unsupported pattern type ' + node.fFinder._typename); - break; - } - } - - return matrix; -} - -/** */ -function createComposite(shape, faces_limit) { - - /* - if ((faces_limit === -1) || (faces_limit === 0)) { - var cnt = CountNumShapes(shape); - - if (cnt > CompLimit) { - warn("composite shape " + shape.fShapeId + " has " + cnt + " components, replace by most left"); - var matrix = new THREE.Matrix4(); - while (shape.fNode && shape.fNode.fLeft) { - var m1 = createMatrix(shape.fNode.fLeftMat); - if (m1) matrix.multiply(m1); - shape = shape.fNode.fLeft; - } - var res = createGeometry(shape, faces_limit); - if (res && (faces_limit===0)) res.applyMatrix(matrix); - return res; - } - } - */ - - if (faces_limit < 0) - return createGeometry(shape.fNode.fLeft, -10) + - createGeometry(shape.fNode.fRight, -10); - - let geom1, geom2, bsp1, bsp2, return_bsp = false; - const matrix1 = createMatrix(shape.fNode.fLeftMat), - matrix2 = createMatrix(shape.fNode.fRightMat); - - // seems to be, IE has smaller stack for functions calls and ThreeCSG fails with large shapes - //if (faces_limit === 0) faces_limit = (JSROOT.browser && JSROOT.browser.isIE) ? 2000 : 4000; - if (faces_limit === 0) faces_limit = 4000; - else return_bsp = true; - - if (matrix1 && (matrix1.determinant() < -0.9)) - warn('Axis reflection in left composite shape - not supported'); - - if (matrix2 && (matrix2.determinant() < -0.9)) - warn('Axis reflections in right composite shape - not supported'); - - geom1 = createGeometry(shape.fNode.fLeft, faces_limit); - if (!geom1) return null; - - let n1 = numGeometryFaces(geom1), n2 = 0; - if (geom1._exceed_limit) n1 += faces_limit; - - if (n1 < faces_limit) { - geom2 = createGeometry(shape.fNode.fRight, faces_limit); - n2 = numGeometryFaces(geom2); - } - - if ((n1 + n2 >= faces_limit) || !geom2) { - if (geom1.polygons) { - geom1 = ThreeBSP.CreateBufferGeometry(geom1.polygons); - n1 = numGeometryFaces(geom1); - } - if (matrix1) geom1.applyMatrix(matrix1); - // if (!geom1._exceed_limit) console.log('reach faces limit', faces_limit, 'got', n1, n2); - geom1._exceed_limit = true; - return geom1; - } - - bsp1 = new ThreeBSP.Geometry(geom1, matrix1, CompressComp ? 0 : undefined); - - bsp2 = new ThreeBSP.Geometry(geom2, matrix2, bsp1.maxid); - - // take over maxid from both geometries - bsp1.maxid = bsp2.maxid; - - switch (shape.fNode._typename) { - case 'TGeoIntersection': - bsp1.direct_intersect(bsp2); - break; // "*" - case 'TGeoUnion': - bsp1.direct_union(bsp2); - break; // "+" - case 'TGeoSubtraction': - bsp1.direct_subtract(bsp2); - break; // "/" - default: - warn('unsupported bool operation ' + shape.fNode._typename + ', use first geom'); - } - - if (numGeometryFaces(bsp1) === 0) { - warn('Zero faces in comp shape' - + ' left: ' + shape.fNode.fLeft._typename + ' ' + numGeometryFaces(geom1) + ' faces' - + ' right: ' + shape.fNode.fRight._typename + ' ' + numGeometryFaces(geom2) + ' faces' - + ' use first'); - bsp1 = new ThreeBSP.Geometry(geom1, matrix1); - } - - return return_bsp ? {polygons: bsp1.toPolygons()} : bsp1.toBufferGeometry(); -} - -/** */ -function projectGeometry(geom, matrix, projection, position, flippedMesh) { - - if (!geom.boundingBox) geom.computeBoundingBox(); - - const box = geom.boundingBox.clone(); - - box.applyMatrix4(matrix); - - if (!position) position = 0; - - if (((box.min[projection] >= position) && (box.max[projection] >= position)) || - ((box.min[projection] <= position) && (box.max[projection] <= position))) { - return null; // not interesting - } - - const bsp1 = new ThreeBSP.Geometry(geom, matrix, 0, flippedMesh), - sizex = 2 * Math.max(Math.abs(box.min.x), Math.abs(box.max.x)), - sizey = 2 * Math.max(Math.abs(box.min.y), Math.abs(box.max.y)), - sizez = 2 * Math.max(Math.abs(box.min.z), Math.abs(box.max.z)); - let size = 10000; - - switch (projection) { - case "x": - size = Math.max(sizey, sizez); - break; - case "y": - size = Math.max(sizex, sizez); - break; - case "z": - size = Math.max(sizex, sizey); - break; - } - - const bsp2 = ThreeBSP.CreateNormal(projection, position, size); - - bsp1.cut_from_plane(bsp2); - - return bsp2.toBufferGeometry(); -} - - -/** - * Creates geometry model for the provided shape - * - * - * If @par limit === 0 (or undefined) returns THREE.BufferGeometry - * If @par limit < 0 just returns estimated number of faces - * If @par limit > 0 return list of ThreeBSP polygons (used only for composite shapes) - * */ -export function createGeometry(shape, limit) { - if (limit === undefined) limit = 0; - - try { - switch (shape._typename) { - case "TGeoBBox": - return createCubeBuffer(shape, limit); - case "TGeoPara": - return createParaBuffer(shape, limit); - case "TGeoTrd1": - case "TGeoTrd2": - return createTrapezoidBuffer(shape, limit); - case "TGeoArb8": - case "TGeoTrap": - case "TGeoGtra": - return createArb8Buffer(shape, limit); - case "TGeoSphere": - return createSphereBuffer(shape, limit); - case "TGeoCone": - case "TGeoConeSeg": - case "TGeoTube": - case "TGeoTubeSeg": - case "TGeoCtub": - return createTubeBuffer(shape, limit); - case "TGeoEltu": - return createEltuBuffer(shape, limit); - case "TGeoTorus": - return createTorusBuffer(shape, limit); - case "TGeoPcon": - case "TGeoPgon": - return createPolygonBuffer(shape, limit); - case "TGeoXtru": - return createXtruBuffer(shape, limit); - case "TGeoParaboloid": - return createParaboloidBuffer(shape, limit); - case "TGeoHype": - return createHypeBuffer(shape, limit); - case "TGeoCompositeShape": - return createComposite(shape, limit); - case "TGeoShapeAssembly": - break; - case "TGeoScaledShape": { - const res = createGeometry(shape.fShape, limit); - if (shape.fScale && (limit >= 0) && (typeof res === 'object') && (typeof res.scale === 'function')) - res.scale(shape.fScale.fScale[0], shape.fScale.fScale[1], shape.fScale.fScale[2]); - return res; - } - default: - warn('unsupported shape type ' + shape._typename); - } - } catch (e) { - let place = ""; - if (e.stack !== undefined) { - place = e.stack.split("\n")[0]; - if (place.indexOf(e.message) >= 0) place = e.stack.split("\n")[1]; - else place = " at: " + place; - } - warn(shape._typename + " err: " + e.message + place); - } - - return limit < 0 ? 0 : null; -} - -/** Provides info about geo object, used for tooltip info */ -function provideInfo(obj) { - let info = [], shape = null; - - if (obj.fVolume !== undefined) shape = obj.fVolume.fShape; else if (obj.fShape !== undefined) shape = obj.fShape; else if ((obj.fShapeBits !== undefined) && (obj.fShapeId !== undefined)) shape = obj; - - if (!shape) { - info.push(obj._typename); - return info; - } - - const sz = Math.max(shape.fDX, shape.fDY, shape.fDZ); - const useexp = (sz > 1e7) || (sz < 1e-7); - - function conv(v) { - if (v === undefined) return "???"; - if ((v === Math.round(v) && v < 1e7)) return Math.round(v); - return useexp ? v.toExponential(4) : v.toPrecision(7); - } - - info.push(shape._typename); - - info.push("DX=" + conv(shape.fDX) + " DY=" + conv(shape.fDY) + " DZ=" + conv(shape.fDZ)); - - switch (shape._typename) { - case "TGeoBBox": - break; - case "TGeoPara": - info.push("Alpha=" + shape.fAlpha + " Phi=" + shape.fPhi + " Theta=" + shape.fTheta); - break; - case "TGeoTrd2": - info.push("Dy1=" + conv(shape.fDy1) + " Dy2=" + conv(shape.fDy1)); - case "TGeoTrd1": - info.push("Dx1=" + conv(shape.fDx1) + " Dx2=" + conv(shape.fDx1)); - break; - case "TGeoArb8": - break; - case "TGeoTrap": - break; - case "TGeoGtra": - break; - case "TGeoSphere": - info.push("Rmin=" + conv(shape.fRmin) + " Rmax=" + conv(shape.fRmax)); - info.push("Phi1=" + shape.fPhi1 + " Phi2=" + shape.fPhi2); - info.push("Theta1=" + shape.fTheta1 + " Theta2=" + shape.fTheta2); - break; - case "TGeoConeSeg": - info.push("Phi1=" + shape.fPhi1 + " Phi2=" + shape.fPhi2); - case "TGeoCone": - info.push("Rmin1=" + conv(shape.fRmin1) + " Rmax1=" + conv(shape.fRmax1)); - info.push("Rmin2=" + conv(shape.fRmin2) + " Rmax2=" + conv(shape.fRmax2)); - break; - case "TGeoCtub": - case "TGeoTubeSeg": - info.push("Phi1=" + shape.fPhi1 + " Phi2=" + shape.fPhi2); - case "TGeoEltu": - case "TGeoTube": - info.push("Rmin=" + conv(shape.fRmin) + " Rmax=" + conv(shape.fRmax)); - break; - case "TGeoTorus": - info.push("Rmin=" + conv(shape.fRmin) + " Rmax=" + conv(shape.fRmax)); - info.push("Phi1=" + shape.fPhi1 + " Dphi=" + shape.fDphi); - break; - case "TGeoPcon": - case "TGeoPgon": - break; - case "TGeoXtru": - break; - case "TGeoParaboloid": - info.push("Rlo=" + conv(shape.fRlo) + " Rhi=" + conv(shape.fRhi)); - info.push("A=" + conv(shape.fA) + " B=" + conv(shape.fB)); - break; - case "TGeoHype": - info.push("Rmin=" + conv(shape.fRmin) + " Rmax=" + conv(shape.fRmax)); - info.push("StIn=" + conv(shape.fStIn) + " StOut=" + conv(shape.fStOut)); - break; - case "TGeoCompositeShape": - break; - case "TGeoShapeAssembly": - break; - case "TGeoScaledShape": - info = provideInfo(shape.fShape); - if (shape.fScale) - info.unshift('Scale X=' + shape.fScale.fScale[0] + " Y=" + shape.fScale.fScale[1] + " Z=" + shape.fScale.fScale[2]); - break; - } - - return info; -} - -/** */ -function createProjectionMatrix(camera) { - const cameraProjectionMatrix = new THREE.Matrix4(); - - camera.updateMatrixWorld(); - camera.matrixWorldInverse.getInverse(camera.matrixWorld); - cameraProjectionMatrix.multiplyMatrices(camera.projectionMatrix, camera.matrixWorldInverse); - - return cameraProjectionMatrix; -} - -/** */ -function createFrustum(source) { - if (!source) return null; - - if (source instanceof THREE.PerspectiveCamera) - source = createProjectionMatrix(source); - - const frustum = new THREE.Frustum(); - frustum.setFromMatrix(source); - - frustum.corners = new Float32Array([ - 1, 1, 1, - 1, 1, -1, - 1, -1, 1, - 1, -1, -1, - -1, 1, 1, - -1, 1, -1, - -1, -1, 1, - -1, -1, -1, - 0, 0, 0 // also check center of the shape - ]); - - frustum.test = new THREE.Vector3(0, 0, 0); - - frustum.CheckShape = function (matrix, shape) { - const pnt = this.test, len = this.corners.length, corners = this.corners; - let i; - - for (i = 0; i < len; i += 3) { - pnt.x = corners[i] * shape.fDX; - pnt.y = corners[i + 1] * shape.fDY; - pnt.z = corners[i + 2] * shape.fDZ; - if (this.containsPoint(pnt.applyMatrix4(matrix))) return true; - } - - return false; - }; - - frustum.CheckBox = function (box) { - const pnt = this.test; - let cnt = 0; - pnt.set(box.min.x, box.min.y, box.min.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.min.x, box.min.y, box.max.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.min.x, box.max.y, box.min.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.min.x, box.max.y, box.max.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.max.x, box.max.y, box.max.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.max.x, box.min.y, box.max.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.max.x, box.max.y, box.min.z); - if (this.containsPoint(pnt)) cnt++; - pnt.set(box.max.x, box.max.y, box.max.z); - if (this.containsPoint(pnt)) cnt++; - return cnt > 5; // only if 6 edges and more are seen, we think that box is fully visible - }; - - return frustum; -} - -/** */ -function visibleByCamera(camera, matrix, shape) { - const frustum = new THREE.Frustum(); - const cameraProjectionMatrix = new THREE.Matrix4(); - - camera.updateMatrixWorld(); - camera.matrixWorldInverse.getInverse(camera.matrixWorld); - cameraProjectionMatrix.multiplyMatrices(camera.projectionMatrix, camera.matrixWorldInverse); - frustum.setFromMatrix(cameraProjectionMatrix); - - const corners = [ - new THREE.Vector3(shape.fDX / 2.0, shape.fDY / 2.0, shape.fDZ / 2.0), - new THREE.Vector3(shape.fDX / 2.0, shape.fDY / 2.0, -shape.fDZ / 2.0), - new THREE.Vector3(shape.fDX / 2.0, -shape.fDY / 2.0, shape.fDZ / 2.0), - new THREE.Vector3(shape.fDX / 2.0, -shape.fDY / 2.0, -shape.fDZ / 2.0), - new THREE.Vector3(-shape.fDX / 2.0, shape.fDY / 2.0, shape.fDZ / 2.0), - new THREE.Vector3(-shape.fDX / 2.0, shape.fDY / 2.0, -shape.fDZ / 2.0), - new THREE.Vector3(-shape.fDX / 2.0, -shape.fDY / 2.0, shape.fDZ / 2.0), - new THREE.Vector3(-shape.fDX / 2.0, -shape.fDY / 2.0, -shape.fDZ / 2.0) - ]; - for (let i = 0; i < corners.length; i++) { - if (frustum.containsPoint(corners[i].applyMatrix4(matrix))) return true; - } - - return false; -} - -/** */ -function numGeometryFaces(geom) { - if (!geom) return 0; - - if (geom instanceof ThreeBSP.Geometry) - return geom.tree.numPolygons(); - - if (geom.type === 'BufferGeometry') { - const attr = geom.getAttribute('position'); - return attr ? attr.count / 3 : 0; - } - - // special array of polygons - if (geom && geom.polygons) return geom.polygons.length; - - return geom.faces.length; -} - -/** */ -function numGeometryVertices(geom) { - if (!geom) return 0; - - if (geom instanceof ThreeBSP.Geometry) - return geom.tree.numPolygons() * 3; - - if (geom.type === 'BufferGeometry') { - const attr = geom.getAttribute('position'); - return attr ? attr.count : 0; - } - - if (geom && geom.polygons) return geom.polygons.length * 4; - - return geom.vertices.length; -} - -/** Compares two stacks. Returns length where stacks are the same - * - * @private */ -function compareStacks(stack1, stack2) { - if (!stack1 || !stack2) return 0; - if (stack1 === stack2) return stack1.length; - const len = Math.min(stack1.length, stack2.length); - for (let k = 0; k < len; ++k) - if (stack1[k] !== stack2[k]) return k; - return len; -} - -/** Checks if two stack arrays are identical - * - * @private */ -function isSameStack(stack1, stack2) { - if (!stack1 || !stack2) return false; - if (stack1 === stack2) return true; - if (stack1.length !== stack2.length) return false; - for (let k = 0; k < stack1.length; ++k) - if (stack1[k] !== stack2[k]) return false; - return true; -} - - -// ==================================================================== - -// class for working with cloned nodes - -class ClonedNodes { - constructor(obj, clones) { - this.toplevel = true; // indicate if object creates top-level structure with Nodes and Volumes folder - this.name_prefix = ""; // name prefix used for nodes names - this.maxdepth = 1; // maximal hierarchy depth, required for transparency - - if (obj) { - if (obj.$geoh) this.toplevel = false; - this.createClones(obj); - } else if (clones) this.nodes = clones; - }; -} - - -ClonedNodes = function (obj, clones) { - this.toplevel = true; // indicate if object creates top-level structure with Nodes and Volumes folder - this.name_prefix = ""; // name prefix used for nodes names - this.maxdepth = 1; // maximal hierarchy depth, required for transparency - - if (obj) { - if (obj.$geoh) this.toplevel = false; - this.createClones(obj); - } else if (clones) this.nodes = clones; -}; - -ClonedNodes.prototype.getNodeShape = function (indx) { - if (!this.origin || !this.nodes) return null; - const obj = this.origin[indx], clone = this.nodes[indx]; - if (!obj || !clone) return null; - if (clone.kind === 0) { - if (obj.fVolume) return obj.fVolume.fShape; - } else { - return obj.fShape; - } - return null; -}; - -ClonedNodes.prototype.Cleanup = function (drawnodes, drawshapes) { - // function to cleanup as much as possible structures - // drawnodes and drawshapes are arrays created during building of geometry - - if (drawnodes) { - for (var n = 0; n < drawnodes.length; ++n) { - delete drawnodes[n].stack; - drawnodes[n] = undefined; - } - } - - if (drawshapes) { - for (var n = 0; n < drawshapes.length; ++n) { - delete drawshapes[n].geom; - drawshapes[n] = undefined; - } - } - - if (this.nodes) - for (var n = 0; n < this.nodes.length; ++n) - delete this.nodes[n].chlds; - - delete this.nodes; - delete this.origin; - - delete this.sortmap; - -}; - -ClonedNodes.prototype.createClones = function (obj, sublevel, kind) { - if (!sublevel) { - this.origin = []; - sublevel = 1; - kind = NodeKind(obj); - } - - if ((kind < 0) || !obj || ('_refid' in obj)) return; - - obj._refid = this.origin.length; - this.origin.push(obj); - if (sublevel > this.maxdepth) this.maxdepth = sublevel; - - var chlds = null; - if (kind === 0) - chlds = (obj.fVolume && obj.fVolume.fNodes) ? obj.fVolume.fNodes.arr : null; - else - chlds = obj.fElements ? obj.fElements.arr : null; - - if (chlds !== null) { - CheckDuplicates(obj, chlds); - for (let i = 0; i < chlds.length; ++i) - this.createClones(chlds[i], sublevel + 1, kind); - } - - if (sublevel > 1) return; - - this.nodes = []; - - const sortarr = []; - - // first create nodes objects - for (var n = 0; n < this.origin.length; ++n) { - var obj = this.origin[n]; - const node = {id: n, kind: kind, vol: 0, nfaces: 0, numvischld: 1, idshift: 0}; - this.nodes.push(node); - sortarr.push(node); // array use to produce sortmap - } - - // than fill children lists - for (var n = 0; n < this.origin.length; ++n) { - var obj = this.origin[n], clone = this.nodes[n]; - - var chlds = null, shape = null; - - if (kind === 1) { - shape = obj.fShape; - if (obj.fElements) chlds = obj.fElements.arr; - } else if (obj.fVolume) { - shape = obj.fVolume.fShape; - if (obj.fVolume.fNodes) chlds = obj.fVolume.fNodes.arr; - } - - const matrix = getNodeMatrix(kind, obj); - if (matrix) { - clone.matrix = matrix.elements; // take only matrix elements, matrix will be constructed in worker - if (clone.matrix[0] === 1) { - let issimple = true; - for (let k = 1; (k < clone.matrix.length) && issimple; ++k) - issimple = (clone.matrix[k] === ((k === 5) || (k === 10) || (k === 15) ? 1 : 0)); - if (issimple) delete clone.matrix; - } - } - if (shape) { - clone.fDX = shape.fDX; - clone.fDY = shape.fDY; - clone.fDZ = shape.fDZ; - clone.vol = shape.fDX * shape.fDY * shape.fDZ; - if (shape.$nfaces === undefined) - shape.$nfaces = createGeometry(shape, -1); - clone.nfaces = shape.$nfaces; - if (clone.nfaces <= 0) clone.vol = 0; - - // if (clone.nfaces < -10) console.log('Problem with node ' + obj.fName + ':' + obj.fMother.fName); - } - - if (!chlds) continue; - - // in cloned object children is only list of ids - clone.chlds = new Int32Array(chlds.length); - for (var k = 0; k < chlds.length; ++k) - clone.chlds[k] = chlds[k]._refid; - } - - // remove _refid identifiers from original objects - for (var n = 0; n < this.origin.length; ++n) - delete this.origin[n]._refid; - - // do sorting once - sortarr.sort(function (a, b) { - return b.vol - a.vol; - }); - - // remember sort map and also sortid - this.sortmap = new Int32Array(this.nodes.length); - for (var n = 0; n < this.nodes.length; ++n) { - this.sortmap[n] = sortarr[n].id; - sortarr[n].sortid = n; - } -}; - - -ClonedNodes.prototype.markVisisble = function (on_screen, copy_bits, cloning) { - if (!this.nodes) return 0; - - let res = 0; - const simple_copy = cloning && (cloning.length === this.nodes.length); - - if (!simple_copy && !this.origin) return 0; - - for (let n = 0; n < this.nodes.length; ++n) { - const clone = this.nodes[n]; - - clone.vis = false; - clone.numvischld = 1; // reset vis counter, will be filled with next scan - clone.idshift = 0; - delete clone.depth; - - if (simple_copy) { - clone.vis = cloning[n].vis; - if (cloning[n].depth !== undefined) clone.depth = cloning[n].depth; - if (clone.vis) res++; - continue; - } - - const obj = this.origin[n]; - - if (clone.kind === 0) { - if (obj.fVolume) { - if (on_screen) { - clone.vis = testBit(obj.fVolume, BITS.kVisOnScreen); - if (copy_bits) { - SetBit(obj.fVolume, BITS.kVisNone, false); - SetBit(obj.fVolume, BITS.kVisThis, clone.vis); - SetBit(obj.fVolume, BITS.kVisDaughters, true); - } - } else { - clone.vis = !testBit(obj.fVolume, BITS.kVisNone) && - testBit(obj.fVolume, BITS.kVisThis) && !obj.fFinder; - if (!testBit(obj.fVolume, BITS.kVisDaughters)) - clone.depth = testBit(obj.fVolume, BITS.kVisOneLevel) ? 1 : 0; - } - } - } else { - clone.vis = obj.fRnrSelf; - - // when the only node is selected, draw it - if ((n === 0) && (this.nodes.length === 1)) clone.vis = true; - } - - // shape with zero volume or without faces will not be observed - if ((clone.vol <= 0) || (clone.nfaces <= 0)) clone.vis = false; - - if (clone.vis) res++; - } - - return res; -}; - -ClonedNodes.prototype.getVisibleFlags = function () { - // function extract only visibility flags, used to transfer them to the worker - const res = []; - for (let n = 0; n < this.nodes.length; ++n) { - const elem = {vis: this.nodes[n].vis}; - if ('depth' in this.nodes[n]) elem.depth = this.nodes[n].depth; - res.push(elem); - } - return res; -}; - -ClonedNodes.prototype.scanVisible = function (arg, vislvl) { - // Scan visible nodes in hierarchy, starting from nodeid - // Each entry in hierarchy get its unique id, which is not changed with visibility flags - - if (!this.nodes) return 0; - - if (vislvl === undefined) { - vislvl = 99999; - if (!arg) arg = {}; - arg.stack = new Array(100); // current stack - arg.nodeid = 0; - arg.counter = 0; // sequence ID of the node, used to identify it later - arg.last = 0; - arg.CopyStack = function (factor) { - const entry = { - nodeid: this.nodeid, - seqid: this.counter, - stack: (this.last > 10) ? new Int32Array(this.last) : new Array(this.last) - }; - if (factor) entry.factor = factor; // factor used to indicate importance of entry, will be build as first - for (let n = 0; n < this.last; ++n) entry.stack[n] = this.stack[n + 1]; // copy stack - return entry; - }; - - if (arg.domatrix) { - arg.matrices = []; - arg.mpool = [new THREE.Matrix4()]; // pool of Matrix objects to avoid permanent creation - arg.getmatrix = function () { - return this.matrices[this.last]; - } - } - } - - let res = 0; - const node = this.nodes[arg.nodeid]; - - if (arg.domatrix) { - if (!arg.mpool[arg.last + 1]) - arg.mpool[arg.last + 1] = new THREE.Matrix4(); - - const prnt = (arg.last > 0) ? arg.matrices[arg.last - 1] : new THREE.Matrix4(); - if (node.matrix) { - arg.matrices[arg.last] = arg.mpool[arg.last].fromArray(prnt.elements); - arg.matrices[arg.last].multiply(arg.mpool[arg.last + 1].fromArray(node.matrix)); - } else { - arg.matrices[arg.last] = prnt; - } - } - - if (node.vis && (vislvl >= 0)) { - if (!arg.func || arg.func(node)) res++; - } - - arg.counter++; - - if ((node.depth !== undefined) && (vislvl > node.depth)) vislvl = node.depth; - - //if (arg.last > arg.stack.length - 2) - // throw 'scanVisible: stack capacity ' + arg.stack.length + ' is not enough'; - - if (node.chlds && (node.numvischld > 0)) { - const currid = arg.counter; - let numvischld = 0; - arg.last++; - for (let i = 0; i < node.chlds.length; ++i) { - arg.nodeid = node.chlds[i]; - arg.stack[arg.last] = i; // in the stack one store index of child, it is path in the hierarchy - numvischld += this.scanVisible(arg, vislvl - 1); - } - arg.last--; - res += numvischld; - if (numvischld === 0) { - node.numvischld = 0; - node.idshift = arg.counter - currid; - } - } else { - arg.counter += node.idshift; - } - - if (arg.last === 0) { - delete arg.last; - delete arg.stack; - delete arg.CopyStack; - delete arg.counter; - delete arg.matrices; - delete arg.mpool; - delete arg.getmatrix; - } - - return res; -}; - -/** Return node name with given id. - * Either original object or description is used - * @private */ -ClonedNodes.prototype.getNodeName = function (nodeid) { - if (this.origin) { - const obj = this.origin[nodeid]; - return obj ? objectName(obj) : ""; - } - const node = this.nodes[nodeid]; - return node ? node.name : ""; -}; - -ClonedNodes.prototype.ResolveStack = function (stack, withmatrix) { - - const res = {id: 0, obj: null, node: this.nodes[0], name: this.name_prefix}; - - // if (!this.toplevel || (this.nodes.length === 1) || (res.node.kind === 1)) res.name = ""; - - if (withmatrix) { - res.matrix = new THREE.Matrix4(); - if (res.node.matrix) res.matrix.fromArray(res.node.matrix); - } - - if (this.origin) - res.obj = this.origin[0]; - - //if (!res.name) - // res.name = this.getNodeName(0); - - if (stack) - for (let lvl = 0; lvl < stack.length; ++lvl) { - res.id = res.node.chlds[stack[lvl]]; - res.node = this.nodes[res.id]; - - if (this.origin) - res.obj = this.origin[res.id]; - - const subname = this.getNodeName(res.id); - if (subname) { - if (res.name) res.name += "/"; - res.name += subname; - } - - if (withmatrix && res.node.matrix) - res.matrix.multiply(new THREE.Matrix4().fromArray(res.node.matrix)); - } - - return res; -}; - -/** Create stack array based on nodes ids array. - * Ids list should correspond to existing nodes hierarchy */ -ClonedNodes.prototype.makeStackByIds = function (ids) { - const stack = []; - - if (ids[0] !== 0) { - console.error('wrong ids - first should be 0'); - return null; - } - - let node = this.nodes[0]; - - for (let k = 1; k < ids.length; ++k) { - const nodeid = ids[k]; - const chindx = node.chlds.indexOf(nodeid); - if (chindx < 0) { - console.error('wrong nodes ids ' + ids[k] + ' is not child of ' + ids[k - 1]); - return null; - } - - stack.push(chindx); - node = this.nodes[nodeid]; - } - - return stack; -}; - -/** Returns true if stack includes at any place provided nodeid */ -ClonedNodes.prototype.isNodeInStack = function (nodeid, stack) { - - if (!nodeid) return true; - - let node = this.nodes[0], id = 0; - - for (let lvl = 0; lvl < stack.length; ++lvl) { - id = node.chlds[stack[lvl]]; - if (id === nodeid) return true; - node = this.nodes[id]; - } - - return false; -}; - -/** find stack by name which include names of all parents */ -ClonedNodes.prototype.findStackByName = function (fullname) { - - const names = fullname.split('/'); - let currid = 0; - const stack = []; - - if (this.getNodeName(currid) !== names[0]) return null; - - for (let n = 1; n < names.length; ++n) { - const node = this.nodes[currid]; - if (!node.chlds) return null; - - for (let k = 0; k < node.chlds.length; ++k) { - const chldid = node.chlds[k]; - if (this.getNodeName(chldid) === names[n]) { - stack.push(k); - currid = chldid; - break; - } - } - - // no new entry - not found stack - if (stack.length === n - 1) return null; - } - - return stack; -}; - -function createRootColors() { - const colorMap = ['white', 'black', 'red', 'green', 'blue', 'yellow', 'magenta', 'cyan', 'rgb(89,212,84)', 'rgb(89,84,217)', 'white']; - colorMap[110] = 'white'; - - const moreCol = [ - { - col: 11, - str: 'c1b7ad4d4d4d6666668080809a9a9ab3b3b3cdcdcde6e6e6f3f3f3cdc8accdc8acc3c0a9bbb6a4b3a697b8a49cae9a8d9c8f83886657b1cfc885c3a48aa9a1839f8daebdc87b8f9a768a926983976e7b857d9ad280809caca6c0d4cf88dfbb88bd9f83c89a7dc08378cf5f61ac8f94a6787b946971d45a549300ff7b00ff6300ff4b00ff3300ff1b00ff0300ff0014ff002cff0044ff005cff0074ff008cff00a4ff00bcff00d4ff00ecff00fffd00ffe500ffcd00ffb500ff9d00ff8500ff6d00ff5500ff3d00ff2600ff0e0aff0022ff003aff0052ff006aff0082ff009aff00b1ff00c9ff00e1ff00f9ff00ffef00ffd700ffbf00ffa700ff8f00ff7700ff6000ff4800ff3000ff1800ff0000' - }, - { - col: 201, - str: '5c5c5c7b7b7bb8b8b8d7d7d78a0f0fb81414ec4848f176760f8a0f14b81448ec4876f1760f0f8a1414b84848ec7676f18a8a0fb8b814ecec48f1f1768a0f8ab814b8ec48ecf176f10f8a8a14b8b848ecec76f1f1' - }, - {col: 390, str: 'ffffcdffff9acdcd9affff66cdcd669a9a66ffff33cdcd339a9a33666633ffff00cdcd009a9a00666600333300'}, - {col: 406, str: 'cdffcd9aff9a9acd9a66ff6666cd66669a6633ff3333cd33339a3333663300ff0000cd00009a00006600003300'}, - {col: 422, str: 'cdffff9affff9acdcd66ffff66cdcd669a9a33ffff33cdcd339a9a33666600ffff00cdcd009a9a006666003333'}, - {col: 590, str: 'cdcdff9a9aff9a9acd6666ff6666cd66669a3333ff3333cd33339a3333660000ff0000cd00009a000066000033'}, - {col: 606, str: 'ffcdffff9affcd9acdff66ffcd66cd9a669aff33ffcd33cd9a339a663366ff00ffcd00cd9a009a660066330033'}, - {col: 622, str: 'ffcdcdff9a9acd9a9aff6666cd66669a6666ff3333cd33339a3333663333ff0000cd00009a0000660000330000'}, - { - col: 791, - str: 'ffcd9acd9a669a66339a6600cd9a33ffcd66ff9a00ffcd33cd9a00ffcd00ff9a33cd66006633009a3300cd6633ff9a66ff6600ff6633cd3300ff33009aff3366cd00336600339a0066cd339aff6666ff0066ff3333cd0033ff00cdff9a9acd66669a33669a009acd33cdff669aff00cdff339acd00cdff009affcd66cd9a339a66009a6633cd9a66ffcd00ff6633ffcd00cd9a00ffcd33ff9a00cd66006633009a3333cd6666ff9a00ff9a33ff6600cd3300ff339acdff669acd33669a00339a3366cd669aff0066ff3366ff0033cd0033ff339aff0066cd00336600669a339acd66cdff009aff33cdff009acd00cdffcd9aff9a66cd66339a66009a9a33cdcd66ff9a00ffcd33ff9a00cdcd00ff9a33ff6600cd33006633009a6633cd9a66ff6600ff6633ff3300cd3300ffff339acd00666600339a0033cd3366ff669aff0066ff3366cd0033ff0033ff9acdcd669a9a33669a0066cd339aff66cdff009acd009aff33cdff009a' - }, - {col: 920, str: 'cdcdcd9a9a9a666666333333'}]; - - for (let indx = 0; indx < moreCol.length; ++indx) { - const entry = moreCol[indx]; - for (let n = 0; n < entry.str.length; n += 6) { - const num = parseInt(entry.col) + parseInt(n / 6); - colorMap[num] = 'rgb(' + parseInt("0x" + entry.str.slice(n, n + 2)) + "," + parseInt("0x" + entry.str.slice(n + 2, n + 4)) + "," + parseInt("0x" + entry.str.slice(n + 4, n + 6)) + ")"; - } - } - - return colorMap; -} - -let colors = createRootColors(); - -/** returns different properties of draw entry nodeid */ -ClonedNodes.prototype.getDrawEntryProperties = function (entry) { - // function return different properties for specified node - // Only if node visible, material will be created - - const clone = this.nodes[entry.nodeid]; - const visible = true; - - if (clone.kind === 2) { - let prop = {name: clone.name, nname: clone.name, shape: null, material: null, chlds: null}; - let _opacity = entry.opacity; - prop.fillcolor = new THREE.Color(entry.color ? "rgb(" + entry.color + ")" : "blue"); - prop.material = new THREE.MeshLambertMaterial({ - transparent: _opacity < 1, - opacity: _opacity, wireframe: false, color: prop.fillcolor, - side: THREE.FrontSide /* THREE.DoubleSide*/, vertexColors: THREE.NoColors /*THREE.VertexColors */, - overdraw: 0., depthWrite: _opacity === 1 - }); - prop.material.inherentOpacity = _opacity; - - return prop; - } - - if (!this.origin) { - console.error('origin not there - kind', clone.kind, entry.nodeid, clone); - return null; - } - - const node = this.origin[entry.nodeid]; - - if (clone.kind === 1) { - // special handling for EVE nodes - - let prop = { - name: objectName(node), - nname: objectName(node), - shape: node.fShape, - material: null, - chlds: null - }; - - if (node.fElements !== null) prop.chlds = node.fElements.arr; - - if (visible) { - let _opacity = Math.min(1, node.fRGBA[3]); - prop.fillcolor = new THREE.Color(node.fRGBA[0], node.fRGBA[1], node.fRGBA[2]); - prop.material = new THREE.MeshLambertMaterial({ - transparent: _opacity < 1, - opacity: _opacity, wireframe: false, color: prop.fillcolor, - side: THREE.FrontSide /* THREE.DoubleSide*/, vertexColors: THREE.NoColors /*THREE.VertexColors */, - overdraw: 0., depthWrite: _opacity === 1 - }); - prop.material.inherentOpacity = _opacity; - } - - return prop; - } - - const volume = node.fVolume; - - let prop = { - name: objectName(volume), - nname: objectName(node), - volume: node.fVolume, - shape: volume.fShape, - material: null, - chlds: null - }; - - if (node.fVolume.fNodes !== null) prop.chlds = node.fVolume.fNodes.arr; - - if (volume) prop.linewidth = volume.fLineWidth; - - if (visible) { - let _opacity = 1.0; - if ((volume.fFillColor > 1) && (volume.fLineColor === 1)) - prop.fillcolor = colors[volume.fFillColor]; - else if (volume.fLineColor >= 0) - prop.fillcolor = colors[volume.fLineColor]; - - if (volume.fMedium && volume.fMedium.fMaterial) { - const fillstyle = volume.fMedium.fMaterial.fFillStyle; - const transparency = (fillstyle < 3000 || fillstyle > 3100) ? 0 : fillstyle - 3000; - if (transparency > 0) - _opacity = (100.0 - transparency) / 100.0; - if (prop.fillcolor === undefined) - prop.fillcolor = colors[volume.fMedium.fMaterial.fFillColor]; - } - if (prop.fillcolor === undefined) - prop.fillcolor = "lightgrey"; - - prop.material = new THREE.MeshLambertMaterial({ - transparent: _opacity < 1, - opacity: _opacity, wireframe: false, color: prop.fillcolor, - side: THREE.FrontSide /* THREE.DoubleSide */, vertexColors: THREE.NoColors /*THREE.VertexColors*/, - overdraw: 0., depthWrite: _opacity === 1 - }); - prop.material.inherentOpacity = _opacity; - - } - - return prop; -}; - -ClonedNodes.prototype.createObject3D = function (stack, toplevel, options) { - // create hierarchy of Object3D for given stack entry - // such hierarchy repeats hierarchy of TGeoNodes and set matrix for the objects drawing - // also set renderOrder, required to handle transparency - - let node = this.nodes[0], three_prnt = toplevel, draw_depth = 0; - const force = (typeof options == 'object') || (options === 'force'); - - for (let lvl = 0; lvl <= stack.length; ++lvl) { - const nchld = (lvl > 0) ? stack[lvl - 1] : 0; - // extract current node - if (lvl > 0) node = this.nodes[node.chlds[nchld]]; - - let obj3d = undefined; - - if (three_prnt.children) - for (let i = 0; i < three_prnt.children.length; ++i) { - if (three_prnt.children[i].nchld === nchld) { - obj3d = three_prnt.children[i]; - break; - } - } - - if (obj3d) { - three_prnt = obj3d; - if (obj3d.$jsroot_drawable) draw_depth++; - continue; - } - - if (!force) return null; - - obj3d = new THREE.Object3D(); - - if (node.matrix) { - // console.log(stack.toString(), lvl, 'matrix ', node.matrix.toString()); - obj3d.matrix.fromArray(node.matrix); - obj3d.matrix.decompose(obj3d.position, obj3d.quaternion, obj3d.scale); - } - - // this.accountNodes(obj3d); - obj3d.nchld = nchld; // mark index to find it again later - - // add the mesh to the scene - three_prnt.add(obj3d); - - // this is only for debugging - test inversion of whole geometry - if ((lvl === 0) && (typeof options == 'object') && options.scale) { - if ((options.scale.x < 0) || (options.scale.y < 0) || (options.scale.z < 0)) { - obj3d.scale.copy(options.scale); - obj3d.updateMatrix(); - } - } - - obj3d.updateMatrixWorld(); - - three_prnt = obj3d; - } - - if ((options === 'mesh') || (options === 'delete_mesh')) { - let mesh = null; - if (three_prnt) - for (let n = 0; (n < three_prnt.children.length) && !mesh; ++n) { - const chld = three_prnt.children[n]; - if ((chld.type === 'Mesh') && (chld.nchld === undefined)) mesh = chld; - } - - if ((options === 'mesh') || !mesh) return mesh; - - const res = three_prnt; - while (mesh && (mesh !== toplevel)) { - three_prnt = mesh.parent; - three_prnt.remove(mesh); - mesh = (three_prnt.children.length === 0) ? three_prnt : null; - } - - return res; - } - - if (three_prnt) { - three_prnt.$jsroot_drawable = true; - three_prnt.$jsroot_depth = draw_depth; - } - - return three_prnt; -}; - -ClonedNodes.prototype.GetVolumeBoundary = function (viscnt, facelimit, nodeslimit) { - - const result = {min: 0, max: 1, sortidcut: 0}; - - if (!this.sortmap) { - console.error('sorting map do not exist'); - return result; - } - - let maxNode, currNode, cnt = 0, facecnt = 0; - - for (let n = 0; (n < this.sortmap.length) && (cnt < nodeslimit) && (facecnt < facelimit); ++n) { - const id = this.sortmap[n]; - if (viscnt[id] === 0) continue; - currNode = this.nodes[id]; - if (!maxNode) maxNode = currNode; - cnt += viscnt[id]; - facecnt += viscnt[id] * currNode.nfaces; - } - - if (!currNode) { - console.error('no volumes selected'); - return result; - } - - // console.log('Volume boundary ' + currNode.vol + ' cnt ' + cnt + ' faces ' + facecnt); - result.max = maxNode.vol; - result.min = currNode.vol; - result.sortidcut = currNode.sortid; // latest node is not included - return result; -}; - -ClonedNodes.prototype.CollectVisibles = function (maxnumfaces, frustum, maxnumnodes) { - // function collects visible nodes, using maxlimit - // one can use map to define cut based on the volume or serious of cuts - - if (!maxnumnodes) maxnumnodes = maxnumfaces / 100; - - const arg = { - facecnt: 0, - viscnt: new Int32Array(this.nodes.length), // counter for each node - // nodes: this.nodes, - func: function (node) { - this.facecnt += node.nfaces; - this.viscnt[node.id]++; - return true; - } - }; - - for (let n = 0; n < arg.viscnt.length; ++n) arg.viscnt[n] = 0; - - const total = this.scanVisible(arg); - let minVol = 0, maxVol = 0, camVol = -1, camFact = 10, - sortidcut = this.nodes.length + 1; - - // console.log('Total visible nodes ' + total + ' numfaces ' + arg.facecnt); - - if (arg.facecnt > maxnumfaces) { - - const bignumfaces = maxnumfaces * (frustum ? 0.8 : 1.0), - bignumnodes = maxnumnodes * (frustum ? 0.8 : 1.0); - - // define minimal volume, which always to shown - const boundary = this.GetVolumeBoundary(arg.viscnt, bignumfaces, bignumnodes); - - minVol = boundary.min; - maxVol = boundary.max; - sortidcut = boundary.sortidcut; - - if (frustum) { - arg.domatrix = true; - arg.frustum = frustum; - arg.totalcam = 0; - arg.func = function (node) { - if (node.vol <= minVol) // only small volumes are interesting - if (this.frustum.CheckShape(this.getmatrix(), node)) { - this.viscnt[node.id]++; - this.totalcam += node.nfaces; - } - - return true; - }; - - for (let n = 0; n < arg.viscnt.length; ++n) arg.viscnt[n] = 0; - - this.scanVisible(arg); - - if (arg.totalcam > maxnumfaces * 0.2) - camVol = this.GetVolumeBoundary(arg.viscnt, maxnumfaces * 0.2, maxnumnodes * 0.2).min; - else - camVol = 0; - - camFact = maxVol / ((camVol > 0) ? (camVol > 0) : minVol); - - // console.log('Limit for camera ' + camVol + ' faces in camera view ' + arg.totalcam); - } - } - - arg.items = []; - - arg.func = function (node) { - if (node.sortid < sortidcut) { - this.items.push(this.CopyStack()); - } else if ((camVol >= 0) && (node.vol > camVol)) - if (this.frustum.CheckShape(this.getmatrix(), node)) { - this.items.push(this.CopyStack(camFact)); - } - return true; - }; - - this.scanVisible(arg); - - return {lst: arg.items, complete: minVol === 0}; -}; - -ClonedNodes.prototype.MergeVisibles = function (current, prev) { - // merge list of drawn objects - // in current list we should mark if object already exists - // from previous list we should collect objects which are not there - - let indx2 = 0; - const del = []; - for (let indx1 = 0; (indx1 < current.length) && (indx2 < prev.length); ++indx1) { - - while ((indx2 < prev.length) && (prev[indx2].seqid < current[indx1].seqid)) { - del.push(prev[indx2++]); // this entry should be removed - } - - if ((indx2 < prev.length) && (prev[indx2].seqid === current[indx1].seqid)) { - if (prev[indx2].done) current[indx1].done = true; // copy ready flag - indx2++; - } - } - - // remove rest - while (indx2 < prev.length) - del.push(prev[indx2++]); - - return del; // -}; - -ClonedNodes.prototype.CollectShapes = function (lst) { - // based on list of visible nodes, collect all uniques shapes which should be build - - const shapes = []; - - for (var i = 0; i < lst.length; ++i) { - let entry = lst[i]; - let shape = this.getNodeShape(entry.nodeid); - - if (!shape) continue; // strange, but avoid misleading - - if (shape._id === undefined) { - shape._id = shapes.length; - - shapes.push({ - id: shape._id, - shape: shape, - vol: this.nodes[entry.nodeid].vol, - refcnt: 1, - factor: 1, - ready: false - }); - - // shapes.push( { obj: shape, vol: this.nodes[entry.nodeid].vol }); - } else { - shapes[shape._id].refcnt++; - } - - entry.shape = shapes[shape._id]; // remember shape used - - // use maximal importance factor to push element to the front - if (entry.factor && (entry.factor > entry.shape.factor)) - entry.shape.factor = entry.factor; - } - - // now sort shapes in volume decrease order - shapes.sort(function (a, b) { - return b.vol * b.factor - a.vol * a.factor; - }); - - // now set new shape ids according to the sorted order and delete temporary field - for (let n = 0; n < shapes.length; ++n) { - const item = shapes[n]; - item.id = n; // set new ID - delete item.shape._id; // remove temporary field - } - - // as last action set current shape id to each entry - for (let i = 0; i < lst.length; ++i) { - let entry = lst[i]; - if (entry.shape) { - entry.shapeid = entry.shape.id; // keep only id for the entry - delete entry.shape; // remove direct references - } - } - - return shapes; -}; - -ClonedNodes.prototype.MergeShapesLists = function (oldlst, newlst) { - - if (!oldlst) return newlst; - - // set geometry to shape object itself - for (let n = 0; n < oldlst.length; ++n) { - let item = oldlst[n]; - - item.shape._geom = item.geom; - delete item.geom; - - if (item.geomZ !== undefined) { - item.shape._geomZ = item.geomZ; - delete item.geomZ; - } - } - - // take from shape (if match) - for (let n = 0; n < newlst.length; ++n) { - let item = newlst[n]; - - if (item.shape._geom !== undefined) { - item.geom = item.shape._geom; - delete item.shape._geom; - } - - if (item.shape._geomZ !== undefined) { - item.geomZ = item.shape._geomZ; - delete item.shape._geomZ; - } - } - - // now delete all unused geometries - for (let n = 0; n < oldlst.length; ++n) { - let item = oldlst[n]; - delete item.shape._geom; - delete item.shape._geomZ; - } - - return newlst; -}; - -ClonedNodes.prototype.BuildShapes = function (lst, limit, timelimit) { - - let created = 0; - const tm1 = new Date().getTime(), - res = {done: false, shapes: 0, faces: 0, notusedshapes: 0}; - - for (let n = 0; n < lst.length; ++n) { - let item = lst[n]; - - // if enough faces are produced, nothing else is required - if (res.done) { - item.ready = true; - continue; - } - - if (!item.ready) { - if (item.geom === undefined) { - item.geom = createGeometry(item.shape); - if (item.geom) created++; // indicate that at least one shape was created - } - item.nfaces = numGeometryFaces(item.geom); - item.ready = true; - } - - res.shapes++; - if (!item.used) res.notusedshapes++; - res.faces += item.nfaces * item.refcnt; - - if (res.faces >= limit) { - res.done = true; - } else if ((created > 0.01 * lst.length) && (timelimit !== undefined)) { - let tm2 = new Date().getTime(); - if (tm2 - tm1 > timelimit) return res; - } - } - - res.done = true; - - return res; -}; - -function objectName(obj) { - if (!obj || !obj.fName) return ""; - return obj.fName + (obj.$geo_suffix ? obj.$geo_suffix : ""); -} - -function CheckDuplicates(parent, chlds) { - if (parent) { - if (parent.$geo_checked) return; - parent.$geo_checked = true; - } - - const names = [], cnts = [], obj = null; - for (let k = 0; k < chlds.length; ++k) { - const chld = chlds[k]; - if (!chld || !chld.fName) continue; - if (!chld.$geo_suffix) { - const indx = names.indexOf(chld.fName); - if (indx >= 0) { - let cnt = cnts[indx] || 1; - while (names.indexOf(chld.fName + "#" + cnt) >= 0) ++cnt; - chld.$geo_suffix = "#" + cnt; - cnts[indx] = cnt + 1; - } - } - names.push(objectName(chld)); - } -} - -function createFlippedMesh(parent, shape, material) { - // when transformation matrix includes one or several inversion of axis, - // one should inverse geometry object, otherwise THREE.js cannot correctly draw it - - const flip = new THREE.Vector3(1, 1, -1); - - if (shape.geomZ === undefined) { - - if (shape.geom.type === 'BufferGeometry') { - - let pos = shape.geom.getAttribute('position').array, - norm = shape.geom.getAttribute('normal').array; - - const index = shape.geom.getIndex(); - - if (index) { - // we need to unfold all points to - const arr = index.array, - i0 = shape.geom.drawRange.start; - let ilen = shape.geom.drawRange.count; - if (i0 + ilen > arr.length) ilen = arr.length - i0; - - const dpos = new Float32Array(ilen * 3), dnorm = new Float32Array(ilen * 3); - for (let ii = 0; ii < ilen; ++ii) { - const k = arr[i0 + ii]; - if ((k < 0) || (k * 3 >= pos.length)) console.log('strange index', k * 3, pos.length); - dpos[ii * 3] = pos[k * 3]; - dpos[ii * 3 + 1] = pos[k * 3 + 1]; - dpos[ii * 3 + 2] = pos[k * 3 + 2]; - dnorm[ii * 3] = norm[k * 3]; - dnorm[ii * 3 + 1] = norm[k * 3 + 1]; - dnorm[ii * 3 + 2] = norm[k * 3 + 2]; - } - - pos = dpos; - norm = dnorm; - } - - var len = pos.length, n, shift = 0, - newpos = new Float32Array(len), - newnorm = new Float32Array(len); - - // we should swap second and third point in each face - for (n = 0; n < len; n += 3) { - newpos[n] = pos[n + shift]; - newpos[n + 1] = pos[n + 1 + shift]; - newpos[n + 2] = -pos[n + 2 + shift]; - - newnorm[n] = norm[n + shift]; - newnorm[n + 1] = norm[n + 1 + shift]; - newnorm[n + 2] = -norm[n + 2 + shift]; - - shift += 3; - if (shift === 6) shift = -3; // values 0,3,-3 - } - - shape.geomZ = new THREE.BufferGeometry(); - shape.geomZ.addAttribute('position', new THREE.BufferAttribute(newpos, 3)); - shape.geomZ.addAttribute('normal', new THREE.BufferAttribute(newnorm, 3)); - // normals are calculated with normal geometry and correctly scaled - // geom.computeVertexNormals(); - - } else { - - shape.geomZ = shape.geom.clone(); - - shape.geomZ.scale(flip.x, flip.y, flip.z); - - var face, d, n = 0; - while (n < shape.geomZ.faces.length) { - face = geom.faces[n++]; - d = face.b; - face.b = face.c; - face.c = d; - } - - // normals are calculated with normal geometry and correctly scaled - // geom.computeFaceNormals(); - } - } - - const mesh = new THREE.Mesh(shape.geomZ, material); - mesh.scale.copy(flip); - mesh.updateMatrix(); - - mesh._flippedMesh = true; - - return mesh; -} - -/** Cleanup shape entity - * @private */ -function cleanupShape(shape) { - if (!shape) return; - - if (shape.geom && (typeof shape.geom.dispose == 'funciton')) - shape.geom.dispose(); - - if (shape.geomZ && (typeof shape.geomZ.dispose == 'funciton')) - shape.geomZ.dispose(); - - delete shape.geom; - delete shape.geomZ; -} - -function produceRenderOrder(toplevel, origin, method, clones) { - // function scans throug hierarchy of objects and try to set renderOrder - // algorithm is not perfect, but better then nothing - - const raycast = new THREE.Raycaster(); - - function setdefaults(top) { - if (!top) return; - top.traverse(function (obj) { - obj.renderOrder = 0; - if (obj.material) obj.material.depthWrite = true; // by default depthWriting enabled - }); - } - - function traverse(obj, lvl, arr) { - // traverse hierarchy and extract all children of given level - // if (obj.$jsroot_depth===undefined) return; - - if (!obj.children) return; - - for (let k = 0; k < obj.children.length; ++k) { - const chld = obj.children[k]; - if (chld.$jsroot_order === lvl) { - if (chld.material) { - if (chld.material.transparent) { - chld.material.depthWrite = false; // disable depth writing for transparent - arr.push(chld); - } else { - setdefaults(chld); - } - } - } else if ((obj.$jsroot_depth === undefined) || (obj.$jsroot_depth < lvl)) traverse(chld, lvl, arr); - } - } - - function sort(arr, minorder, maxorder) { - // resort meshes using ray caster and camera position - // idea to identify meshes which are in front or behind - - if (arr.length > 300) { - // too many of them, just set basic level and exit - for (var i = 0; i < arr.length; ++i) arr[i].renderOrder = (minorder + maxorder) / 2; - return false; - } - - // first calculate distance to the camera - // it gives preliminary order of volumes - - for (var i = 0; i < arr.length; ++i) { - var mesh = arr[i], - box3 = mesh.$jsroot_box3; - - if (!box3) - mesh.$jsroot_box3 = box3 = getBoundingBox(mesh); - - if (method === 'size') { - mesh.$jsroot_distance = box3.getSize(new THREE.Vector3()); - continue; - } - - if (method === "pnt") { - mesh.$jsroot_distance = origin.distanceTo(box3.getCenter()); - continue; - } - - let dist = Math.min(dist, origin.distanceTo(box3.min), origin.distanceTo(box3.max)); - - const pnt = new THREE.Vector3(box3.min.x, box3.min.y, box3.max.z); - dist = Math.min(dist, origin.distanceTo(pnt)); - pnt.set(box3.min.x, box3.max.y, box3.min.z); - dist = Math.min(dist, origin.distanceTo(pnt)); - pnt.set(box3.max.x, box3.min.y, box3.min.z); - dist = Math.min(dist, origin.distanceTo(pnt)); - - pnt.set(box3.max.x, box3.max.y, box3.min.z); - dist = Math.min(dist, origin.distanceTo(pnt)); - - pnt.set(box3.max.x, box3.min.y, box3.max.z); - dist = Math.min(dist, origin.distanceTo(pnt)); - - pnt.set(box3.min.x, box3.max.y, box3.max.z); - dist = Math.min(dist, origin.distanceTo(pnt)); - - mesh.$jsroot_distance = dist; - } - - arr.sort(function (a, b) { - return a.$jsroot_distance - b.$jsroot_distance; - }); - - const resort = new Array(arr.length); - - for (var i = 0; i < arr.length; ++i) { - arr[i].$jsroot_index = i; - resort[i] = arr[i]; - } - - if (method === "ray") - for (var i = arr.length - 1; i >= 0; --i) { - var mesh = arr[i], - box3 = mesh.$jsroot_box3, - direction = box3.getCenter(); - - for (let ntry = 0; ntry < 2; ++ntry) { - - direction.sub(origin).normalize(); - - raycast.set(origin, direction); - - var intersects = raycast.intersectObjects(arr, false); // only plain array - - const unique = []; - - for (var k1 = 0; k1 < intersects.length; ++k1) { - if (unique.indexOf(intersects[k1].object) < 0) unique.push(intersects[k1].object); - // if (intersects[k1].object === mesh) break; // trace until object itself - } - - intersects = unique; - - if ((intersects.indexOf(mesh) < 0) && (ntry > 0)) - console.log('MISS', clones ? clones.ResolveStack(mesh.stack).name : "???"); - - if ((intersects.indexOf(mesh) >= 0) || (ntry > 0)) break; - - const pos = mesh.geometry.attributes.position.array; - - direction = new THREE.Vector3((pos[0] + pos[3] + pos[6]) / 3, (pos[1] + pos[4] + pos[7]) / 3, (pos[2] + pos[5] + pos[8]) / 3); - - direction.applyMatrix4(mesh.matrixWorld); - } - - // now push first object in intersects to the front - for (var k1 = 0; k1 < intersects.length - 1; ++k1) { - const mesh1 = intersects[k1], mesh2 = intersects[k1 + 1], - i1 = mesh1.$jsroot_index, i2 = mesh2.$jsroot_index; - if (i1 < i2) continue; - for (let ii = i2; ii < i1; ++ii) { - resort[ii] = resort[ii + 1]; - resort[ii].$jsroot_index = ii; - } - resort[i1] = mesh2; - mesh2.$jsroot_index = i1; - } - - } - - for (var i = 0; i < resort.length; ++i) { - resort[i].renderOrder = maxorder - (i + 1) / (resort.length + 1) * (maxorder - minorder); - delete resort[i].$jsroot_index; - delete resort[i].$jsroot_distance; - } - - return true; - } - - function process(obj, lvl, minorder, maxorder) { - const arr = []; - let did_sort = false; - - traverse(obj, lvl, arr); - - if (!arr.length) return; - - if (minorder === maxorder) { - for (var k = 0; k < arr.length; ++k) - arr[k].renderOrder = minorder; - } else { - did_sort = sort(arr, minorder, maxorder); - if (!did_sort) minorder = maxorder = (minorder + maxorder) / 2; - } - - for (var k = 0; k < arr.length; ++k) { - const next = arr[k].parent; - let min = minorder, max = maxorder; - - if (did_sort) { - max = arr[k].renderOrder; - min = max - (maxorder - minorder) / (arr.length + 2); - } - - process(next, lvl + 1, min, max); - } - } - - if (!method || (method === "dflt")) - setdefaults(toplevel); - else - process(toplevel, 0, 1, 1000000); -} - -export function build(obj, opt) { - // function can be used to build three.js model for TGeo object - - if (!obj) return; - - if (!opt) opt = {}; - if (!opt.numfaces) opt.numfaces = 100000; - if (!opt.numnodes) opt.numnodes = 1000; - - opt.res_mesh = opt.res_faces = 0; - - let shape = null; - - if (('fShapeBits' in obj) && ('fShapeId' in obj)) { - shape = obj; - obj = null; - } else if ((obj._typename === 'TGeoVolumeAssembly') || (obj._typename === 'TGeoVolume')) { - shape = obj.fShape; - } else if ((obj._typename === "TEveGeoShapeExtract") || (obj._typename === "ROOT::Experimental::TEveGeoShapeExtract")) { - shape = obj.fShape; - } else if (obj._typename === 'TGeoManager') { - obj = obj.fMasterVolume; - SetBit(obj, BITS.kVisThis, false); - shape = obj.fShape; - } else if ('fVolume' in obj) { - if (obj.fVolume) shape = obj.fVolume.fShape; - } else { - obj = null; - } - - if (opt.composite && shape && (shape._typename === 'TGeoCompositeShape') && shape.fNode) { - obj = buildCompositeVolume(shape); - } - - // if (!obj && shape) - // obj = extend(JSROOT.Create("TEveGeoShapeExtract"), - // {fTrans: null, fShape: shape, fRGBA: [0, 1, 0, 1], fElements: null, fRnrSelf: true}); - - if (!obj) return null; - - if (obj._typename.indexOf('TGeoVolume') === 0) - obj = {_typename: "TGeoNode", fVolume: obj, fName: obj.fName, $geoh: obj.$geoh, _proxy: true}; - - const clones = new ClonedNodes(obj); - - let uniquevis = clones.markVisisble(true); - - if (uniquevis <= 0) - uniquevis = clones.markVisisble(false); - else - uniquevis = clones.markVisisble(true, true); // copy bits once and use normal visibility bits - - const numvis = clones.markVisisble(); - - const frustum = null; - - // collect visible nodes - const res = clones.CollectVisibles(opt.numfaces, frustum, opt.numnodes); - - const draw_nodes = res.lst; - - // collect shapes - const shapes = clones.CollectShapes(draw_nodes); - - clones.BuildShapes(shapes, opt.numfaces); - - let toplevel = new THREE.Object3D(); - - for (let n = 0; n < draw_nodes.length; ++n) { - let entry = draw_nodes[n]; - if (entry.done) continue; - - let shape = shapes[entry.shapeid]; - if (!shape.ready) { - console.warn('shape marked as not ready when should'); - break; - } - entry.done = true; - shape.used = true; // indicate that shape was used in building - - if (!shape.geom || (shape.nfaces === 0)) { - // node is visible, but shape does not created - clones.createObject3D(entry.stack, toplevel, 'delete_mesh'); - continue; - } - - const prop = clones.getDrawEntryProperties(entry); - - opt.res_mesh++; - opt.res_faces += shape.nfaces; - - const obj3d = clones.createObject3D(entry.stack, toplevel, opt); - - prop.material.wireframe = opt.wireframe; - - prop.material.side = opt.doubleside ? THREE.DoubleSide : THREE.FrontSide; - - let mesh = null; - - if (obj3d.matrixWorld.determinant() > -0.9) { - mesh = new THREE.Mesh(shape.geom, prop.material); - } else { - mesh = createFlippedMesh(obj3d, shape, prop.material); - } - - obj3d.add(mesh); - // specify rendering order, required for transparency handling - //if (obj3d.$jsroot_depth !== undefined) - // mesh.renderOrder = clones.maxdepth - obj3d.$jsroot_depth; - //else - // mesh.renderOrder = clones.maxdepth - entry.stack.length; - } - - //JSROOT.CallBack(call_back, toplevel); - - return toplevel; -} - -function getBoundingBox(node, box3) { - - // extract code of Box3.expandByObject - // Major difference - do not traverse hierarchy - - if (!node || !node.geometry) return box3; - - if (!box3) { - box3 = new THREE.Box3(); - box3.makeEmpty(); - } - - node.updateMatrixWorld(); - - const v1 = new THREE.Vector3(), - geometry = node.geometry; - - if (geometry.isGeometry) { - const vertices = geometry.vertices; - for (let i = 0, l = vertices.length; i < l; i++) { - v1.copy(vertices[i]); - v1.applyMatrix4(node.matrixWorld); - box3.expandByPoint(v1); - } - } else if (geometry.isBufferGeometry) { - const attribute = geometry.attributes.position; - if (attribute !== undefined) { - for (let i = 0, l = attribute.count; i < l; i++) { - // v1.fromAttribute( attribute, i ).applyMatrix4( node.matrixWorld ); - v1.fromBufferAttribute(attribute, i).applyMatrix4(node.matrixWorld); - box3.expandByPoint(v1); - } - } - } - - return box3; -} - diff --git a/dataforge-vis-jsroot/src/main/resources/JSRootUtils.js b/dataforge-vis-jsroot/src/main/resources/JSRootUtils.js deleted file mode 100644 index d162cc23..00000000 --- a/dataforge-vis-jsroot/src/main/resources/JSRootUtils.js +++ /dev/null @@ -1,765 +0,0 @@ - -/** Generate mask for given bit - * - * @param {number} n bit number - * @returns {Number} produced make - * @private */ -export function BIT(n) { - return 1 << (n); -} - -/** Wrapper for console.log, let redirect output to specified div element - * @private */ -function console(value, divid) { - if ((typeof divid == 'string') && document.getElementById(divid)) - document.getElementById(divid).innerHTML = value; - else if ((typeof console != 'undefined') && (typeof console.log == 'function')) - console.log(value); -} - - -/** @summary Wrapper for alert, throws Error in Node.js - * @private */ -export function alert(msg) { - if (this.nodeis) throw new Error(msg); - if (typeof alert === 'function') alert(msg); - else console('ALERT: ' + msg); -} - -/** - * @summary Seed simple random generator - * - * @private - * @param {number} i seed value - */ -export function seed(i) { - i = Math.abs(i); - if (i > 1e8) i = Math.abs(1e8 * Math.sin(i)); else if (i < 1) i *= 1e8; - this.m_w = Math.round(i); - this.m_z = 987654321; -} - -/** - * @summary Simple random generator - * - * @desc Works like Math.random(), but with configurable seed - see {@link JSROOT.seed} - * @private - * @returns {number} random value between 0 (inclusive) and 1.0 (exclusive) - */ -export function random() { - if (this.m_z === undefined) return Math.random(); - this.m_z = (36969 * (this.m_z & 65535) + (this.m_z >> 16)) & 0xffffffff; - this.m_w = (18000 * (this.m_w & 65535) + (this.m_w >> 16)) & 0xffffffff; - var result = ((this.m_z << 16) + this.m_w) & 0xffffffff; - result /= 4294967296; - return result + 0.5; -} - - -/** @summary Should be used to reintroduce objects references, produced by TBufferJSON. - * - * @desc Replace all references inside object, object should not be null - * Idea of the code taken from JSON-R code, found on - * https://github.com/graniteds/jsonr - * Only unref part was used, arrays are not accounted as objects - * @param {object} obj object where references will be replaced - * @returns {object} same object with replaced references - * @private */ -function JSONR_unref(obj) { - - let map = [], newfmt = undefined; - - function unref_value(value) { - if ((value === null) || (value === undefined)) return; - - /* - if object is a reference string in "old format" - Old format seems to be single string with "$ref:" prefix. New format is an object - */ - if (typeof value === 'string') { - if (newfmt || (value.length < 6) || (value.indexOf("$ref:") !== 0)) return; //switch to "new format" if needed - let ref = parseInt(value.substr(5)); // get ref number - if (isNaN(ref) || (ref < 0) || (ref >= map.length)) return; //skip if not a ref - newfmt = false; - return map[ref]; //return an object from cache - } - - if (typeof value !== 'object') return; - - let i, k, res, proto = Object.prototype.toString.apply(value); - - // scan array - it can contain other objects - if ((proto.indexOf('[object') === 0) && (proto.indexOf('Array]') > 0)) { - for (i = 0; i < value.length; ++i) { - res = unref_value(value[i]); - if (res !== undefined) value[i] = res; - } - return; - } - - let ks = Object.keys(value), len = ks.length; - - if ((newfmt !== false) && (len === 1) && (ks[0] === '$ref')) { - let ref = parseInt(value['$ref']); - if (isNaN(ref) || (ref < 0) || (ref >= map.length)) return; - newfmt = true; - return map[ref]; - } - - if ((newfmt !== false) && (len > 1) && (ks[0] === '$arr') && (ks[1] === 'len')) { - // this is ROOT-coded array - var arr = null, dflt = (value.$arr === "Bool") ? false : 0; - switch (value.$arr) { - case "Int8" : - arr = new Int8Array(value.len); - break; - case "Uint8" : - arr = new Uint8Array(value.len); - break; - case "Int16" : - arr = new Int16Array(value.len); - break; - case "Uint16" : - arr = new Uint16Array(value.len); - break; - case "Int32" : - arr = new Int32Array(value.len); - break; - case "Uint32" : - arr = new Uint32Array(value.len); - break; - case "Float32" : - arr = new Float32Array(value.len); - break; - case "Int64" : - case "Uint64" : - case "Float64" : - arr = new Float64Array(value.len); - break; - default : - arr = new Array(value.len); - break; - } - for (let k = 0; k < value.len; ++k) arr[k] = dflt; - - var nkey = 2, p = 0; - while (nkey < len) { - if (ks[nkey][0] === "p") p = value[ks[nkey++]]; // position - if (ks[nkey][0] !== 'v') throw new Error('Unexpected member ' + ks[nkey] + ' in array decoding'); - let v = value[ks[nkey++]]; // value - if (typeof v === 'object') { - for (let k = 0; k < v.length; ++k) arr[p++] = v[k]; - } else { - arr[p++] = v; - if ((nkey < len) && (ks[nkey][0] === 'n')) { - let cnt = value[ks[nkey++]]; // counter - while (--cnt) arr[p++] = v; - } - } - } - - return arr; - } - - if ((newfmt !== false) && (len === 3) && (ks[0] === '$pair') && (ks[1] === 'first') && (ks[2] === 'second')) { - newfmt = true; - let f1 = unref_value(value.first), - s1 = unref_value(value.second); - if (f1 !== undefined) value.first = f1; - if (s1 !== undefined) value.second = s1; - value._typename = value['$pair']; - delete value['$pair']; - return; // pair object is not counted in the objects map - } - - // debug code, can be commented out later - if (map.indexOf(value) >= 0) { - console('should never happen - object already in the map'); - return; - } - - // add object to object map - map.push(value); - - // add methods to all objects, where _typename is specified - //if ('_typename' in value) JSROOT.addMethods(value); - - for (let k = 0; k < len; ++k) { - i = ks[k]; - res = unref_value(value[i]); - if (res !== undefined) value[i] = res; - } - } - - unref_value(obj); - - return obj; -} - - -/** @summary Just copies (not clone) all fields from source to the target object - * @desc This is simple replacement of jQuery.extend method - * @private */ -function extend(tgt, src) { - if ((src === null) || (typeof src !== 'object')) return tgt; - if ((tgt === null) || (typeof tgt !== 'object')) tgt = {}; - - for (var k in src) - tgt[k] = src[k]; - - return tgt; -} - - -/** - * @summary Parse JSON code produced with TBufferJSON. - * - * @param {string} json string to parse - * @return {object|null} returns parsed object - */ -export function parse(json) { - if (!json) return null; - let obj = JSON.parse(json); - if (obj) obj = JSONR_unref(obj); - return obj; -} - - -/** - * @summary Parse multi.json request results - * @desc Method should be used to parse JSON code, produced by multi.json request of THttpServer - * - * @param {string} json string to parse - * @return {Array|null} returns array of parsed elements - */ -export function parse_multi(json) { - if (!json) return null; - let arr = JSON.parse(json); - if (arr && arr.length) - for (let i = 0; i < arr.length; ++i) - arr[i] = JSONR_unref(arr[i]); - return arr; -} - -/** - * @summary Method converts JavaScript object into ROOT-like JSON - * - * @desc Produced JSON can be used in JSROOT.parse() again - * When performed properly, JSON can be used in TBufferJSON to read data back with C++ - */ -export function toJSON(obj) { - if (!obj || typeof obj !== 'object') return ""; - - var map = []; // map of stored objects - - function copy_value(value) { - if (typeof value === "function") return undefined; - - if ((value === undefined) || (value === null) || (typeof value !== 'object')) return value; - - var proto = Object.prototype.toString.apply(value); - - // typed array need to be converted into normal array, otherwise looks strange - if ((proto.indexOf('[object ') === 0) && (proto.indexOf('Array]') === proto.length - 6)) { - var arr = new Array(value.length); - for (var i = 0; i < value.length; ++i) - arr[i] = copy_value(value[i]); - return arr; - } - - // this is how reference is code - var refid = map.indexOf(value); - if (refid >= 0) return {$ref: refid}; - - var ks = Object.keys(value), len = ks.length, tgt = {}; - - if ((len === 3) && (ks[0] === '$pair') && (ks[1] === 'first') && (ks[2] === 'second')) { - // special handling of pair objects which does not included into objects map - tgt.$pair = value.$pair; - tgt.first = copy_value(value.first); - tgt.second = copy_value(value.second); - return tgt; - } - - map.push(value); - - for (var k = 0; k < len; ++k) { - var name = ks[k]; - tgt[name] = copy_value(value[name]); - } - - return tgt; - } - - var tgt = copy_value(obj); - - return JSON.stringify(tgt); -} - - -/** - * @summary Parse string value as array. - * - * @desc It could be just simple string: "value" or - * array with or without string quotes: [element], ['elem1',elem2] - * - * @private - */ -function ParseAsArray(val) { - - var res = []; - - if (typeof val != 'string') return res; - - val = val.trim(); - if (val === "") return res; - - // return as array with single element - if ((val.length < 2) || (val[0] !== '[') || (val[val.length - 1] !== ']')) { - res.push(val); - return res; - } - - // try to split ourself, checking quotes and brackets - var nbr = 0, nquotes = 0, ndouble = 0, last = 1; - - for (var indx = 1; indx < val.length; ++indx) { - if (nquotes > 0) { - if (val[indx] === "'") nquotes--; - continue; - } - if (ndouble > 0) { - if (val[indx] === '"') ndouble--; - continue; - } - switch (val[indx]) { - case "'": - nquotes++; - break; - case '"': - ndouble++; - break; - case "[": - nbr++; - break; - case "]": - if (indx < val.length - 1) { - nbr--; - break; - } - case ",": - if (nbr === 0) { - var sub = val.substring(last, indx).trim(); - if ((sub.length > 1) && (sub[0] === sub[sub.length - 1]) && ((sub[0] === '"') || (sub[0] === "'"))) - sub = sub.substr(1, sub.length - 2); - res.push(sub); - last = indx + 1; - } - break; - } - } - - if (res.length === 0) - res.push(val.substr(1, val.length - 2).trim()); - - return res; -} - -/** - * @summary Find function with given name. - * - * @desc Function name may include several namespaces like 'JSROOT.Painter.drawFrame' - * - * @private - */ -function findFunction(name) { - if (typeof name === 'function') return name; - if (typeof name !== 'string') return null; - var names = name.split('.'), elem = null; - if (typeof window === 'object') elem = window; - if (names[0] === 'JSROOT') { - elem = this; - names.shift(); - } - - for (var n = 0; elem && (n < names.length); ++n) - elem = elem[names[n]]; - - return (typeof elem == 'function') ? elem : null; -} - -/** - * @summary Generic method to invoke callback function. - * - * @param {object|function} func either normal function or container like - * { obj: object_pointer, func: name of method to call } - * @param arg1 first optional argument of callback - * @param arg2 second optional argument of callback - * - * @private - */ -function callBack(func, arg1, arg2) { - - if (typeof func == 'string') func = findFunction(func); - - if (!func) return; - - if (typeof func == 'function') return func(arg1, arg2); - - if (typeof func != 'object') return; - - if (('obj' in func) && ('func' in func) && - (typeof func.obj == 'object') && (typeof func.func == 'string') && - (typeof func.obj[func.func] == 'function')) { - return func.obj[func.func](arg1, arg2); - } -} - -let methodsCache = {}; // variable used to keep methods for known classes - - -/** @summary Returns methods for given typename - * @private - */ -function getMethods(typename, obj) { - - var m = methodsCache[typename], - has_methods = (m !== undefined); - - if (!has_methods) m = {}; - - // Due to binary I/O such TObject methods may not be set for derived classes - // Therefore when methods requested for given object, check also that basic methods are there - if ((typename === "TObject") || (typename === "TNamed") || (obj && (obj.fBits !== undefined))) - if (m.TestBit === undefined) { - m.TestBit = function (f) { - return (this.fBits & f) !== 0; - }; - m.InvertBit = function (f) { - this.fBits = this.fBits ^ (f & 0xffffff); - }; - } - - if (has_methods) return m; - - if ((typename === 'TList') || (typename === 'THashList')) { - m.Clear = function () { - this.arr = []; - this.opt = []; - }; - m.Add = function (obj, opt) { - this.arr.push(obj); - this.opt.push((opt && typeof opt == 'string') ? opt : ""); - }; - m.AddFirst = function (obj, opt) { - this.arr.unshift(obj); - this.opt.unshift((opt && typeof opt == 'string') ? opt : ""); - }; - m.RemoveAt = function (indx) { - this.arr.splice(indx, 1); - this.opt.splice(indx, 1); - } - } - - // if ((typename === "TPaveText") || (typename === "TPaveStats")) { - // m.AddText = function (txt) { - // // this.fLines.Add({ _typename: 'TLatex', fTitle: txt, fTextColor: 1 }); - // var line = JSROOT.Create("TLatex"); - // line.fTitle = txt; - // this.fLines.Add(line); - // }; - // m.Clear = function () { - // this.fLines.Clear(); - // } - // } - // - // if ((typename.indexOf("TF1") === 0) || (typename === "TF2")) { - // m.addFormula = function (obj) { - // if (!obj) return; - // if (this.formulas === undefined) this.formulas = []; - // this.formulas.push(obj); - // }; - // - // m.evalPar = function (x, y) { - // if (!('_func' in this) || (this._title !== this.fTitle)) { - // - // var _func = this.fTitle, isformula = false, pprefix = "["; - // if (_func === "gaus") _func = "gaus(0)"; - // if (this.fFormula && typeof this.fFormula.fFormula == "string") { - // if (this.fFormula.fFormula.indexOf("[](double*x,double*p)") === 0) { - // isformula = true; - // pprefix = "p["; - // _func = this.fFormula.fFormula.substr(21); - // } else { - // _func = this.fFormula.fFormula; - // pprefix = "[p"; - // } - // if (this.fFormula.fClingParameters && this.fFormula.fParams) { - // for (var i = 0; i < this.fFormula.fParams.length; ++i) { - // var regex = new RegExp('(\\[' + this.fFormula.fParams[i].first + '\\])', 'g'), - // parvalue = this.fFormula.fClingParameters[this.fFormula.fParams[i].second]; - // _func = _func.replace(regex, (parvalue < 0) ? "(" + parvalue + ")" : parvalue); - // } - // } - // } - // - // if ('formulas' in this) - // for (var i = 0; i < this.formulas.length; ++i) - // while (_func.indexOf(this.formulas[i].fName) >= 0) - // _func = _func.replace(this.formulas[i].fName, this.formulas[i].fTitle); - // _func = _func.replace(/\b(abs)\b/g, 'TMath::Abs') - // .replace(/TMath::Exp\(/g, 'Math.exp(') - // .replace(/TMath::Abs\(/g, 'Math.abs('); - // if (typeof JSROOT.Math == 'object') { - // this._math = JSROOT.Math; - // _func = _func.replace(/TMath::Prob\(/g, 'this._math.Prob(') - // .replace(/TMath::Gaus\(/g, 'this._math.Gaus(') - // .replace(/TMath::BreitWigner\(/g, 'this._math.BreitWigner(') - // .replace(/xygaus\(/g, 'this._math.gausxy(this, x, y, ') - // .replace(/gaus\(/g, 'this._math.gaus(this, x, ') - // .replace(/gausn\(/g, 'this._math.gausn(this, x, ') - // .replace(/expo\(/g, 'this._math.expo(this, x, ') - // .replace(/landau\(/g, 'this._math.landau(this, x, ') - // .replace(/landaun\(/g, 'this._math.landaun(this, x, ') - // .replace(/ROOT::Math::/g, 'this._math.'); - // } - // for (var i = 0; i < this.fNpar; ++i) { - // var parname = pprefix + i + "]"; - // while (_func.indexOf(parname) !== -1) - // _func = _func.replace(parname, '(' + this.GetParValue(i) + ')'); - // } - // _func = _func.replace(/\b(sin)\b/gi, 'Math.sin') - // .replace(/\b(cos)\b/gi, 'Math.cos') - // .replace(/\b(tan)\b/gi, 'Math.tan') - // .replace(/\b(exp)\b/gi, 'Math.exp') - // .replace(/\b(pow)\b/gi, 'Math.pow') - // .replace(/pi/g, 'Math.PI'); - // for (var n = 2; n < 10; ++n) - // _func = _func.replace('x^' + n, 'Math.pow(x,' + n + ')'); - // - // if (isformula) { - // _func = _func.replace(/x\[0\]/g, "x"); - // if (this._typename === "TF2") { - // _func = _func.replace(/x\[1\]/g, "y"); - // this._func = new Function("x", "y", _func).bind(this); - // } else { - // this._func = new Function("x", _func).bind(this); - // } - // } else if (this._typename === "TF2") - // this._func = new Function("x", "y", "return " + _func).bind(this); - // else - // this._func = new Function("x", "return " + _func).bind(this); - // - // this._title = this.fTitle; - // } - // - // return this._func(x, y); - // }; - // m.GetParName = function (n) { - // if (this.fFormula && this.fFormula.fParams) return this.fFormula.fParams[n].first; - // if (this.fNames && this.fNames[n]) return this.fNames[n]; - // return "p" + n; - // }; - // m.GetParValue = function (n) { - // if (this.fFormula && this.fFormula.fClingParameters) return this.fFormula.fClingParameters[n]; - // if (this.fParams) return this.fParams[n]; - // return undefined; - // }; - // m.GetParError = function (n) { - // return this.fParErrors ? this.fParErrors[n] : undefined; - // }; - // m.GetNumPars = function () { - // return this.fNpar; - // } - // } - - if (((typename.indexOf("TGraph") === 0) || (typename === "TCutG")) && (typename !== "TGraphPolargram") && (typename !== "TGraphTime")) { - // check if point inside figure specified by the TGraph - m.IsInside = function (xp, yp) { - var i, j = this.fNpoints - 1, x = this.fX, y = this.fY, oddNodes = false; - - for (i = 0; i < this.fNpoints; ++i) { - if ((y[i] < yp && y[j] >= yp) || (y[j] < yp && y[i] >= yp)) { - if (x[i] + (yp - y[i]) / (y[j] - y[i]) * (x[j] - x[i]) < xp) { - oddNodes = !oddNodes; - } - } - j = i; - } - - return oddNodes; - }; - } - - if (typename.indexOf("TH1") === 0 || - typename.indexOf("TH2") === 0 || - typename.indexOf("TH3") === 0) { - m.getBinError = function (bin) { - // -*-*-*-*-*Return value of error associated to bin number bin*-*-*-*-* - // if the sum of squares of weights has been defined (via Sumw2), - // this function returns the sqrt(sum of w2). - // otherwise it returns the sqrt(contents) for this bin. - if (bin >= this.fNcells) bin = this.fNcells - 1; - if (bin < 0) bin = 0; - if (bin < this.fSumw2.length) - return Math.sqrt(this.fSumw2[bin]); - return Math.sqrt(Math.abs(this.fArray[bin])); - }; - m.setBinContent = function (bin, content) { - // Set bin content - only trivial case, without expansion - this.fEntries++; - this.fTsumw = 0; - if ((bin >= 0) && (bin < this.fArray.length)) - this.fArray[bin] = content; - }; - } - - if (typename.indexOf("TH1") === 0) { - m.getBin = function (x) { - return x; - }; - m.getBinContent = function (bin) { - return this.fArray[bin]; - }; - m.Fill = function (x, weight) { - var axis = this.fXaxis, - bin = 1 + Math.floor((x - axis.fXmin) / (axis.fXmax - axis.fXmin) * axis.fNbins); - if (bin < 0) bin = 0; else if (bin > axis.fNbins + 1) bin = axis.fNbins + 1; - this.fArray[bin] += ((weight === undefined) ? 1 : weight); - } - } - - if (typename.indexOf("TH2") === 0) { - m.getBin = function (x, y) { - return (x + (this.fXaxis.fNbins + 2) * y); - }; - m.getBinContent = function (x, y) { - return this.fArray[this.getBin(x, y)]; - }; - m.Fill = function (x, y, weight) { - var axis1 = this.fXaxis, axis2 = this.fYaxis, - bin1 = 1 + Math.floor((x - axis1.fXmin) / (axis1.fXmax - axis1.fXmin) * axis1.fNbins), - bin2 = 1 + Math.floor((y - axis2.fXmin) / (axis2.fXmax - axis2.fXmin) * axis2.fNbins); - if (bin1 < 0) bin1 = 0; else if (bin1 > axis1.fNbins + 1) bin1 = axis1.fNbins + 1; - if (bin2 < 0) bin2 = 0; else if (bin2 > axis2.fNbins + 1) bin2 = axis2.fNbins + 1; - this.fArray[bin1 + (axis1.fNbins + 2) * bin2] += ((weight === undefined) ? 1 : weight); - } - } - - if (typename.indexOf("TH3") === 0) { - m.getBin = function (x, y, z) { - return (x + (this.fXaxis.fNbins + 2) * (y + (this.fYaxis.fNbins + 2) * z)); - }; - m.getBinContent = function (x, y, z) { - return this.fArray[this.getBin(x, y, z)]; - }; - m.Fill = function (x, y, z, weight) { - var axis1 = this.fXaxis, axis2 = this.fYaxis, axis3 = this.fZaxis, - bin1 = 1 + Math.floor((x - axis1.fXmin) / (axis1.fXmax - axis1.fXmin) * axis1.fNbins), - bin2 = 1 + Math.floor((y - axis2.fXmin) / (axis2.fXmax - axis2.fXmin) * axis2.fNbins), - bin3 = 1 + Math.floor((z - axis3.fXmin) / (axis3.fXmax - axis3.fXmin) * axis3.fNbins); - if (bin1 < 0) bin1 = 0; else if (bin1 > axis1.fNbins + 1) bin1 = axis1.fNbins + 1; - if (bin2 < 0) bin2 = 0; else if (bin2 > axis2.fNbins + 1) bin2 = axis2.fNbins + 1; - if (bin3 < 0) bin3 = 0; else if (bin3 > axis3.fNbins + 1) bin3 = axis3.fNbins + 1; - this.fArray[bin1 + (axis1.fNbins + 2) * (bin2 + (axis2.fNbins + 2) * bin3)] += ((weight === undefined) ? 1 : weight); - } - } - - if (typename.indexOf("TProfile") === 0) { - if (typename.indexOf("TProfile2D") === 0) { - m.getBin = function (x, y) { - return (x + (this.fXaxis.fNbins + 2) * y); - }; - m.getBinContent = function (x, y) { - var bin = this.getBin(x, y); - if (bin < 0 || bin >= this.fNcells) return 0; - if (this.fBinEntries[bin] < 1e-300) return 0; - if (!this.fArray) return 0; - return this.fArray[bin] / this.fBinEntries[bin]; - }; - m.getBinEntries = function (x, y) { - var bin = this.getBin(x, y); - if (bin < 0 || bin >= this.fNcells) return 0; - return this.fBinEntries[bin]; - } - } else { - m.getBin = function (x) { - return x; - }; - m.getBinContent = function (bin) { - if (bin < 0 || bin >= this.fNcells) return 0; - if (this.fBinEntries[bin] < 1e-300) return 0; - if (!this.fArray) return 0; - return this.fArray[bin] / this.fBinEntries[bin]; - }; - } - m.getBinEffectiveEntries = function (bin) { - if (bin < 0 || bin >= this.fNcells) return 0; - var sumOfWeights = this.fBinEntries[bin]; - if (!this.fBinSumw2 || this.fBinSumw2.length !== this.fNcells) { - // this can happen when reading an old file - return sumOfWeights; - } - var sumOfWeightsSquare = this.fBinSumw2[bin]; - return (sumOfWeightsSquare > 0) ? sumOfWeights * sumOfWeights / sumOfWeightsSquare : 0; - }; - m.getBinError = function (bin) { - if (bin < 0 || bin >= this.fNcells) return 0; - var cont = this.fArray[bin], // sum of bin w *y - sum = this.fBinEntries[bin], // sum of bin weights - err2 = this.fSumw2[bin], // sum of bin w * y^2 - neff = this.getBinEffectiveEntries(bin); // (sum of w)^2 / (sum of w^2) - if (sum < 1e-300) return 0; // for empty bins - var EErrorType = {kERRORMEAN: 0, kERRORSPREAD: 1, kERRORSPREADI: 2, kERRORSPREADG: 3}; - // case the values y are gaussian distributed y +/- sigma and w = 1/sigma^2 - if (this.fErrorMode === EErrorType.kERRORSPREADG) - return 1.0 / Math.sqrt(sum); - // compute variance in y (eprim2) and standard deviation in y (eprim) - var contsum = cont / sum, eprim = Math.sqrt(Math.abs(err2 / sum - contsum * contsum)); - if (this.fErrorMode === EErrorType.kERRORSPREADI) { - if (eprim !== 0) return eprim / Math.sqrt(neff); - // in case content y is an integer (so each my has an error +/- 1/sqrt(12) - // when the std(y) is zero - return 1.0 / Math.sqrt(12 * neff); - } - // if approximate compute the sums (of w, wy and wy2) using all the bins - // when the variance in y is zero - // case option "S" return standard deviation in y - if (this.fErrorMode === EErrorType.kERRORSPREAD) return eprim; - // default case : fErrorMode = kERRORMEAN - // return standard error on the mean of y - return (eprim / Math.sqrt(neff)); - }; - } - - if (typename === "TAxis") { - m.GetBinLowEdge = function (bin) { - if (this.fNbins <= 0) return 0; - if ((this.fXbins.length > 0) && (bin > 0) && (bin <= this.fNbins)) return this.fXbins[bin - 1]; - return this.fXmin + (bin - 1) * (this.fXmax - this.fXmin) / this.fNbins; - }; - m.GetBinCenter = function (bin) { - if (this.fNbins <= 0) return 0; - if ((this.fXbins.length > 0) && (bin > 0) && (bin < this.fNbins)) return (this.fXbins[bin - 1] + this.fXbins[bin]) / 2; - return this.fXmin + (bin - 0.5) * (this.fXmax - this.fXmin) / this.fNbins; - } - } - - if (typeof getMoreMethods == "function") - getMoreMethods(m, typename, obj); - - methodsCache[typename] = m; - return m; -} - - -/** @summary Adds specific methods to the object. - * - * JSROOT implements some basic methods for different ROOT classes. - * @param {object} obj - object where methods are assigned - * @param {string} typename - optional typename, if not specified, obj._typename will be used - * @private - */ -function addMethods(obj, typename) { - this.extend(obj, getMethods(typename || obj._typename, obj)); -} diff --git a/dataforge-vis-jsroot/src/main/resources/ThreeCSG.js b/dataforge-vis-jsroot/src/main/resources/ThreeCSG.js deleted file mode 100644 index 18e9f856..00000000 --- a/dataforge-vis-jsroot/src/main/resources/ThreeCSG.js +++ /dev/null @@ -1,869 +0,0 @@ -import * as THREE from "three" - -const EPSILON = 1e-5, - COPLANAR = 0, - FRONT = 1, - BACK = 2, - SPANNING = 3; - -export function Geometry(geometry, transfer_matrix, nodeid, flippedMesh) { - // Convert THREE.Geometry to ThreeBSP - - if (geometry instanceof THREE.Geometry) { - this.matrix = null; // new THREE.Matrix4; not create matrix when do not needed - } else if (geometry instanceof THREE.Mesh) { - // #todo: add hierarchy support - geometry.updateMatrix(); - transfer_matrix = this.matrix = geometry.matrix.clone(); - geometry = geometry.geometry; - } else if (geometry instanceof Node) { - this.tree = geometry; - this.matrix = null; // new THREE.Matrix4; - return this; - } else if (geometry instanceof THREE.BufferGeometry) { - var pos_buf = geometry.getAttribute('position').array, - norm_buf = geometry.getAttribute('normal').array, - polygons = [], polygon, vert1, vert2, vert3; - - for (var i = 0; i < pos_buf.length; i += 9) { - polygon = new Polygon; - - vert1 = new Vertex(pos_buf[i], pos_buf[i + 1], pos_buf[i + 2], norm_buf[i], norm_buf[i + 1], norm_buf[i + 2]); - if (transfer_matrix) vert1.applyMatrix4(transfer_matrix); - - vert2 = new Vertex(pos_buf[i + 3], pos_buf[i + 4], pos_buf[i + 5], norm_buf[i + 3], norm_buf[i + 4], norm_buf[i + 5]); - if (transfer_matrix) vert2.applyMatrix4(transfer_matrix); - - vert3 = new Vertex(pos_buf[i + 6], pos_buf[i + 7], pos_buf[i + 8], norm_buf[i + 6], norm_buf[i + 7], norm_buf[i + 8]); - if (transfer_matrix) vert3.applyMatrix4(transfer_matrix); - - if (flippedMesh) polygon.vertices.push(vert1, vert3, vert2); - else polygon.vertices.push(vert1, vert2, vert3); - - polygon.calculateProperties(); - polygons.push(polygon); - } - - this.tree = new Node(polygons, nodeid); - if (nodeid !== undefined) this.maxid = this.tree.maxnodeid; - return this; - - } else if (geometry.polygons && (geometry.polygons[0] instanceof Polygon)) { - var polygons = geometry.polygons; - - for (var i = 0; i < polygons.length; ++i) { - var polygon = polygons[i]; - if (transfer_matrix) { - for (var n = 0; n < polygon.vertices.length; ++n) - polygon.vertices[n].applyMatrix4(transfer_matrix); - } - - polygon.calculateProperties(); - } - - this.tree = new Node(polygons, nodeid); - if (nodeid !== undefined) this.maxid = this.tree.maxnodeid; - return this; - - } else { - throw 'ThreeBSP: Given geometry is unsupported'; - } - - var polygons = [], - nfaces = geometry.faces.length, - face, polygon, vertex; - - for (var i = 0; i < nfaces; ++i) { - face = geometry.faces[i]; - // faceVertexUvs = geometry.faceVertexUvs[0][i]; - polygon = new Polygon; - - if (face instanceof THREE.Face3) { - vertex = geometry.vertices[face.a]; - // uvs = faceVertexUvs ? new THREE.Vector2( faceVertexUvs[0].x, faceVertexUvs[0].y ) : null; - vertex = new Vertex(vertex.x, vertex.y, vertex.z, face.vertexNormals[0].x, face.vertexNormals[0].y, face.vertexNormals[0].z /*face.normal , uvs */); - if (transfer_matrix) vertex.applyMatrix4(transfer_matrix); - polygon.vertices.push(vertex); - - vertex = geometry.vertices[face.b]; - //uvs = faceVertexUvs ? new THREE.Vector2( faceVertexUvs[1].x, faceVertexUvs[1].y ) : null; - vertex = new Vertex(vertex.x, vertex.y, vertex.z, face.vertexNormals[1].x, face.vertexNormals[1].y, face.vertexNormals[1].z/*face.normal , uvs */); - if (transfer_matrix) vertex.applyMatrix4(transfer_matrix); - polygon.vertices.push(vertex); - - vertex = geometry.vertices[face.c]; - // uvs = faceVertexUvs ? new THREE.Vector2( faceVertexUvs[2].x, faceVertexUvs[2].y ) : null; - vertex = new Vertex(vertex.x, vertex.y, vertex.z, face.vertexNormals[2].x, face.vertexNormals[2].y, face.vertexNormals[2].z /*face.normal, uvs */); - if (transfer_matrix) vertex.applyMatrix4(transfer_matrix); - polygon.vertices.push(vertex); - } else { - throw 'Invalid face type at index ' + i; - } - - polygon.calculateProperties(); - polygons.push(polygon); - } - - this.tree = new Node(polygons, nodeid); - if (nodeid !== undefined) this.maxid = this.tree.maxnodeid; -} - -Geometry.prototype.subtract = function (other_tree) { - var a = this.tree.clone(), - b = other_tree.tree.clone(); - - a.invert(); - a.clipTo(b); - b.clipTo(a); - b.invert(); - b.clipTo(a); - b.invert(); - a.build(b.allPolygons()); - a.invert(); - a = new Geometry(a); - a.matrix = this.matrix; - return a; -}; - -Geometry.prototype.union = function (other_tree) { - var a = this.tree.clone(), - b = other_tree.tree.clone(); - - a.clipTo(b); - b.clipTo(a); - b.invert(); - b.clipTo(a); - b.invert(); - a.build(b.allPolygons()); - a = new Geometry(a); - a.matrix = this.matrix; - return a; -}; - -Geometry.prototype.intersect = function (other_tree) { - var a = this.tree.clone(), - b = other_tree.tree.clone(); - - a.invert(); - b.clipTo(a); - b.invert(); - a.clipTo(b); - b.clipTo(a); - a.build(b.allPolygons()); - a.invert(); - a = new Geometry(a); - a.matrix = this.matrix; - return a; -}; - -Geometry.prototype.tryToCompress = function (polygons) { - - if (this.maxid === undefined) return; - - var arr = [], parts, foundpair, - nreduce = 0, n, len = polygons.length, - p, p1, p2, i1, i2; - - // sort out polygons - for (n = 0; n < len; ++n) { - p = polygons[n]; - if (p.id === undefined) continue; - if (arr[p.id] === undefined) arr[p.id] = []; - - arr[p.id].push(p); - } - - for (n = 0; n < arr.length; ++n) { - parts = arr[n]; - if (parts === undefined) continue; - - len = parts.length; - - foundpair = (len > 1); - - while (foundpair) { - foundpair = false; - - for (i1 = 0; i1 < len - 1; ++i1) { - p1 = parts[i1]; - if (!p1 || !p1.parent) continue; - for (i2 = i1 + 1; i2 < len; ++i2) { - p2 = parts[i2]; - if (p2 && (p1.parent === p2.parent) && (p1.nsign === p2.nsign)) { - - if (p1.nsign !== p1.parent.nsign) p1.parent.flip(); - - nreduce++; - parts[i1] = p1.parent; - parts[i2] = null; - if (p1.parent.vertices.length < 3) console.log('something wrong with parent'); - foundpair = true; - break; - } - } - } - } - } - - if (nreduce > 0) { - polygons.splice(0, polygons.length); - - for (n = 0; n < arr.length; ++n) { - parts = arr[n]; - if (parts !== undefined) - for (i1 = 0, len = parts.length; i1 < len; ++i1) - if (parts[i1]) polygons.push(parts[i1]); - } - - } -}; - -Geometry.prototype.direct_subtract = function (other_tree) { - var a = this.tree, - b = other_tree.tree; - a.invert(); - a.clipTo(b); - b.clipTo(a); - b.invert(); - b.clipTo(a); - b.invert(); - a.build(b.collectPolygons([])); - a.invert(); - return this; -}; - -Geometry.prototype.direct_union = function (other_tree) { - var a = this.tree, - b = other_tree.tree; - - a.clipTo(b); - b.clipTo(a); - b.invert(); - b.clipTo(a); - b.invert(); - a.build(b.collectPolygons([])); - return this; -}; - -Geometry.prototype.direct_intersect = function (other_tree) { - var a = this.tree, - b = other_tree.tree; - - a.invert(); - b.clipTo(a); - b.invert(); - a.clipTo(b); - b.clipTo(a); - a.build(b.collectPolygons([])); - a.invert(); - return this; -}; - -export function CreateNormal(axis_name, pos, size) { - // create geometry to make cut on specified axis - - var vert1, vert2, vert3; - - if (!size || (size < 10000)) size = 10000; - - switch (axis_name) { - case "x": - vert1 = new Vertex(pos, -3 * size, size, 1, 0, 0), - vert3 = new Vertex(pos, size, size, 1, 0, 0), - vert2 = new Vertex(pos, size, -3 * size, 1, 0, 0); - break; - case "y": - vert1 = new Vertex(-3 * size, pos, size, 0, 1, 0), - vert2 = new Vertex(size, pos, size, 0, 1, 0), - vert3 = new Vertex(size, pos, -3 * size, 0, 1, 0); - break; - case "z": - vert1 = new Vertex(-3 * size, size, pos, 0, 0, 1), - vert3 = new Vertex(size, size, pos, 0, 0, 1), - vert2 = new Vertex(size, -3 * size, pos, 0, 0, 1); - break; - } - - var polygon = new Polygon([vert1, vert2, vert3]); - polygon.calculateProperties(); - - var node = new Node([polygon]); - - return new Geometry(node); -} - -Geometry.prototype.cut_from_plane = function (other_tree) { - // just cut peaces from second geometry, which just simple plane - - var a = this.tree, - b = other_tree.tree; - - a.invert(); - b.clipTo(a); - - return this; -}; - - -Geometry.prototype.toGeometry = function () { - var i, j, - matrix = this.matrix ? new THREE.Matrix4().getInverse(this.matrix) : null, - geometry = new THREE.Geometry(), - polygons = this.tree.collectPolygons([]), - polygon_count = polygons.length, - polygon, polygon_vertice_count, - vertice_dict = {}, - vertex_idx_a, vertex_idx_b, vertex_idx_c, - vertex, face; - - for (i = 0; i < polygon_count; ++i) { - polygon = polygons[i]; - polygon_vertice_count = polygon.vertices.length; - - for (j = 2; j < polygon_vertice_count; ++j) { - // verticeUvs = []; - - vertex = polygon.vertices[0]; - // verticeUvs.push( new THREE.Vector2( vertex.uv.x, vertex.uv.y ) ); - vertex = new THREE.Vector3(vertex.x, vertex.y, vertex.z); - if (matrix) vertex.applyMatrix4(matrix); - - if (typeof vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z] !== 'undefined') { - vertex_idx_a = vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z]; - } else { - geometry.vertices.push(vertex); - vertex_idx_a = vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z] = geometry.vertices.length - 1; - } - - vertex = polygon.vertices[j - 1]; - // verticeUvs.push( new THREE.Vector2( vertex.uv.x, vertex.uv.y ) ); - vertex = new THREE.Vector3(vertex.x, vertex.y, vertex.z); - if (matrix) vertex.applyMatrix4(matrix); - if (typeof vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z] !== 'undefined') { - vertex_idx_b = vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z]; - } else { - geometry.vertices.push(vertex); - vertex_idx_b = vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z] = geometry.vertices.length - 1; - } - - vertex = polygon.vertices[j]; - // verticeUvs.push( new THREE.Vector2( vertex.uv.x, vertex.uv.y ) ); - vertex = new THREE.Vector3(vertex.x, vertex.y, vertex.z); - if (matrix) vertex.applyMatrix4(matrix); - if (typeof vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z] !== 'undefined') { - vertex_idx_c = vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z]; - } else { - geometry.vertices.push(vertex); - vertex_idx_c = vertice_dict[vertex.x + ',' + vertex.y + ',' + vertex.z] = geometry.vertices.length - 1; - } - - face = new THREE.Face3( - vertex_idx_a, - vertex_idx_b, - vertex_idx_c, - new THREE.Vector3(polygon.normal.x, polygon.normal.y, polygon.normal.z) - ); - - geometry.faces.push(face); - // geometry.faceVertexUvs[0].push( verticeUvs ); - } - - } - return geometry; -}; - -Geometry.prototype.scale = function (x, y, z) { - // try to scale as THREE.BufferGeometry - var polygons = this.tree.collectPolygons([]); - - for (var i = 0; i < polygons.length; ++i) { - var polygon = polygons[i]; - for (var k = 0; k < polygon.vertices.length; ++k) { - var v = polygon.vertices[k]; - v.x *= x; - v.y *= y; - v.z *= z; - } - delete polygon.normal; - polygon.calculateProperties(); - } -}; - -Geometry.prototype.toPolygons = function () { - var polygons = this.tree.collectPolygons([]); - - this.tryToCompress(polygons); - - for (var i = 0; i < polygons.length; ++i) { - delete polygons[i].id; - delete polygons[i].parent; - } - - return polygons; -}; - -Geometry.prototype.toBufferGeometry = function () { - return CreateBufferGeometry(this.toPolygons()); -}; - -export function CreateBufferGeometry(polygons) { - var i, j, polygon_count = polygons.length, buf_size = 0; - - for (i = 0; i < polygon_count; ++i) - buf_size += (polygons[i].vertices.length - 2) * 9; - - var positions_buf = new Float32Array(buf_size), - normals_buf = new Float32Array(buf_size), - iii = 0, polygon; - - function CopyVertex(vertex) { - - positions_buf[iii] = vertex.x; - positions_buf[iii + 1] = vertex.y; - positions_buf[iii + 2] = vertex.z; - - normals_buf[iii] = polygon.nsign * vertex.nx; - normals_buf[iii + 1] = polygon.nsign * vertex.ny; - normals_buf[iii + 2] = polygon.nsign * vertex.nz; - iii += 3; - } - - for (i = 0; i < polygon_count; ++i) { - polygon = polygons[i]; - for (j = 2; j < polygon.vertices.length; ++j) { - CopyVertex(polygon.vertices[0]); - CopyVertex(polygon.vertices[j - 1]); - CopyVertex(polygon.vertices[j]); - } - } - - var geometry = new THREE.BufferGeometry(); - geometry.addAttribute('position', new THREE.BufferAttribute(positions_buf, 3)); - geometry.addAttribute('normal', new THREE.BufferAttribute(normals_buf, 3)); - - // geometry.computeVertexNormals(); - return geometry; -} - -Geometry.prototype.toMesh = function (material) { - var geometry = this.toGeometry(), - mesh = new THREE.Mesh(geometry, material); - - if (this.matrix) { - mesh.position.setFromMatrixPosition(this.matrix); - mesh.rotation.setFromRotationMatrix(this.matrix); - } - - return mesh; -}; - -export class Polygon { - constructor(vertices, normal, w) { - if (!(vertices instanceof Array)) { - vertices = []; - } - - this.vertices = vertices; - this.nsign = 1; - if (vertices.length > 0) { - this.calculateProperties(); - } else { - this.normal = this.w = undefined; - } - }; -} - - -Polygon.prototype.copyProperties = function (parent, more) { - this.normal = parent.normal; // .clone(); - this.w = parent.w; - this.nsign = parent.nsign; - if (more && (parent.id !== undefined)) { - this.id = parent.id; - this.parent = parent; - } - return this; -}; - -Polygon.prototype.calculateProperties = function () { - if (this.normal) return; - - var a = this.vertices[0], - b = this.vertices[1], - c = this.vertices[2]; - - this.nsign = 1; - - this.normal = b.clone().subtract(a).cross( - c.clone().subtract(a) - ).normalize(); - - this.w = this.normal.clone().dot(a); - return this; -}; - -Polygon.prototype.clone = function () { - var vertice_count = this.vertices.length, - polygon = new Polygon; - - for (var i = 0; i < vertice_count; ++i) - polygon.vertices.push(this.vertices[i].clone()); - - return polygon.copyProperties(this); -}; - -Polygon.prototype.flip = function () { - - /// normal is not changed, only sign variable - //this.normal.multiplyScalar( -1 ); - //this.w *= -1; - - this.nsign *= -1; - - this.vertices.reverse(); - - return this; -}; - -Polygon.prototype.classifyVertex = function (vertex) { - var side_value = this.nsign * (this.normal.dot(vertex) - this.w); - - if (side_value < -EPSILON) return BACK; - if (side_value > EPSILON) return FRONT; - return COPLANAR; -}; - -Polygon.prototype.classifySide = function (polygon) { - var i, classification, - num_positive = 0, num_negative = 0, - vertice_count = polygon.vertices.length; - - for (i = 0; i < vertice_count; ++i) { - classification = this.classifyVertex(polygon.vertices[i]); - if (classification === FRONT) { - ++num_positive; - } else if (classification === BACK) { - ++num_negative; - } - } - - if (num_positive > 0 && num_negative === 0) return FRONT; - if (num_positive === 0 && num_negative > 0) return BACK; - if (num_positive === 0 && num_negative === 0) return COPLANAR; - return SPANNING; -}; - -Polygon.prototype.splitPolygon = function (polygon, coplanar_front, coplanar_back, front, back) { - var classification = this.classifySide(polygon); - - if (classification === COPLANAR) { - - ((this.nsign * polygon.nsign * this.normal.dot(polygon.normal) > 0) ? coplanar_front : coplanar_back).push(polygon); - - } else if (classification === FRONT) { - - front.push(polygon); - - } else if (classification === BACK) { - - back.push(polygon); - - } else { - - var vertice_count = polygon.vertices.length, - nnx = this.normal.x, - nny = this.normal.y, - nnz = this.normal.z, - i, j, ti, tj, vi, vj, - t, v, - f = [], b = []; - - for (i = 0; i < vertice_count; ++i) { - - j = (i + 1) % vertice_count; - vi = polygon.vertices[i]; - vj = polygon.vertices[j]; - ti = this.classifyVertex(vi); - tj = this.classifyVertex(vj); - - if (ti != BACK) f.push(vi); - if (ti != FRONT) b.push(vi); - if ((ti | tj) === SPANNING) { - // t = ( this.w - this.normal.dot( vi ) ) / this.normal.dot( vj.clone().subtract( vi ) ); - //v = vi.clone().lerp( vj, t ); - - t = (this.w - (nnx * vi.x + nny * vi.y + nnz * vi.z)) / (nnx * (vj.x - vi.x) + nny * (vj.y - vi.y) + nnz * (vj.z - vi.z)); - - v = vi.interpolate(vj, t); - f.push(v); - b.push(v); - } - } - - //if ( f.length >= 3 ) front.push( new Polygon( f ).calculateProperties() ); - //if ( b.length >= 3 ) back.push( new Polygon( b ).calculateProperties() ); - if (f.length >= 3) front.push(new Polygon(f).copyProperties(polygon, true)); - if (b.length >= 3) back.push(new Polygon(b).copyProperties(polygon, true)); - } -}; - -export class Vertex { - constructor(x, y, z, nx, ny, nz) { - this.x = x; - this.y = y; - this.z = z; - this.nx = nx; - this.ny = ny; - this.nz = nz; - }; -} - -Vertex.prototype.setnormal = function (nx, ny, nz) { - this.nx = nx; - this.ny = ny; - this.nz = nz; -}; - -Vertex.prototype.clone = function () { - return new Vertex(this.x, this.y, this.z, this.nx, this.ny, this.nz); -}; - -Vertex.prototype.add = function (vertex) { - this.x += vertex.x; - this.y += vertex.y; - this.z += vertex.z; - return this; -}; - -Vertex.prototype.subtract = function (vertex) { - this.x -= vertex.x; - this.y -= vertex.y; - this.z -= vertex.z; - return this; -}; - -Vertex.prototype.multiplyScalar = function (scalar) { - this.x *= scalar; - this.y *= scalar; - this.z *= scalar; - return this; -}; - -Vertex.prototype.cross = function (vertex) { - var x = this.x, - y = this.y, - z = this.z; - - this.x = y * vertex.z - z * vertex.y; - this.y = z * vertex.x - x * vertex.z; - this.z = x * vertex.y - y * vertex.x; - - return this; -}; - -Vertex.prototype.normalize = function () { - var length = Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z); - - this.x /= length; - this.y /= length; - this.z /= length; - - return this; -}; - -Vertex.prototype.dot = function (vertex) { - return this.x * vertex.x + this.y * vertex.y + this.z * vertex.z; -}; - -Vertex.prototype.diff = function (vertex) { - var dx = (this.x - vertex.x), - dy = (this.y - vertex.y), - dz = (this.z - vertex.z), - len2 = this.x * this.x + this.y * this.y + this.z * this.z; - - return (dx * dx + dy * dy + dz * dz) / (len2 > 0 ? len2 : 1e-10); -}; - -/* - Vertex.prototype.lerp = function( a, t ) { - this.add( - a.clone().subtract( this ).multiplyScalar( t ) - ); - - this.normal.add( - a.normal.clone().sub( this.normal ).multiplyScalar( t ) - ); - - //this.uv.add( - // a.uv.clone().sub( this.uv ).multiplyScalar( t ) - //); - - return this; - }; - Vertex.prototype.interpolate = function( other, t ) { - return this.clone().lerp( other, t ); - }; -*/ - -Vertex.prototype.interpolate = function (a, t) { - var t1 = 1 - t; - return new Vertex(this.x * t1 + a.x * t, this.y * t1 + a.y * t, this.z * t1 + a.z * t, - this.nx * t1 + a.nx * t, this.ny * t1 + a.ny * t, this.nz * t1 + a.nz * t); -}; - -Vertex.prototype.applyMatrix4 = function (m) { - - // input: THREE.Matrix4 affine matrix - - var x = this.x, y = this.y, z = this.z, e = m.elements; - - this.x = e[0] * x + e[4] * y + e[8] * z + e[12]; - this.y = e[1] * x + e[5] * y + e[9] * z + e[13]; - this.z = e[2] * x + e[6] * y + e[10] * z + e[14]; - - x = this.nx; - y = this.ny; - z = this.nz; - - this.nx = e[0] * x + e[4] * y + e[8] * z; - this.ny = e[1] * x + e[5] * y + e[9] * z; - this.nz = e[2] * x + e[6] * y + e[10] * z; - - return this; -}; - -// ================================================================================================ - -export class Node { - constructor(polygons, nodeid) { - this.polygons = []; - this.front = this.back = undefined; - - if (!(polygons instanceof Array) || polygons.length === 0) return; - - this.divider = polygons[0].clone(); - - var polygon_count = polygons.length, - front = [], back = []; - - for (var i = 0; i < polygon_count; ++i) { - if (nodeid !== undefined) { - polygons[i].id = nodeid++; - delete polygons[i].parent; - } - - this.divider.splitPolygon(polygons[i], this.polygons, this.polygons, front, back); - } - - if (nodeid !== undefined) this.maxnodeid = nodeid; - - if (front.length > 0) - this.front = new Node(front); - - if (back.length > 0) - this.back = new Node(back); - }; -} - -Node.isConvex = function (polygons) { - var i, j, len = polygons.length; - for (i = 0; i < len; ++i) - for (j = 0; j < len; ++j) - if (i !== j && polygons[i].classifySide(polygons[j]) !== BACK) return false; - return true; -}; - -Node.prototype.build = function (polygons) { - var polygon_count = polygons.length, - front = [], back = []; - - if (!this.divider) - this.divider = polygons[0].clone(); - - for (var i = 0; i < polygon_count; ++i) - this.divider.splitPolygon(polygons[i], this.polygons, this.polygons, front, back); - - if (front.length > 0) { - if (!this.front) this.front = new Node(); - this.front.build(front); - } - - if (back.length > 0) { - if (!this.back) this.back = new Node(); - this.back.build(back); - } -}; - -Node.prototype.collectPolygons = function (arr) { - var len = this.polygons.length; - for (var i = 0; i < len; ++i) arr.push(this.polygons[i]); - if (this.front) this.front.collectPolygons(arr); - if (this.back) this.back.collectPolygons(arr); - return arr; -}; - -Node.prototype.allPolygons = function () { - var polygons = this.polygons.slice(); - if (this.front) polygons = polygons.concat(this.front.allPolygons()); - if (this.back) polygons = polygons.concat(this.back.allPolygons()); - return polygons; -}; - -Node.prototype.numPolygons = function () { - var res = this.polygons.length; - if (this.front) res += this.front.numPolygons(); - if (this.back) res += this.back.numPolygons(); - return res; -}; - -Node.prototype.clone = function () { - var node = new Node(); - - node.divider = this.divider.clone(); - node.polygons = this.polygons.map(function (polygon) { - return polygon.clone(); - }); - node.front = this.front && this.front.clone(); - node.back = this.back && this.back.clone(); - - return node; -}; - -Node.prototype.invert = function () { - var polygon_count = this.polygons.length; - - for (var i = 0; i < polygon_count; ++i) - this.polygons[i].flip(); - - this.divider.flip(); - if (this.front) this.front.invert(); - if (this.back) this.back.invert(); - - var temp = this.front; - this.front = this.back; - this.back = temp; - - return this; -}; - -Node.prototype.clipPolygons = function (polygons) { - - if (!this.divider) return polygons.slice(); - - var polygon_count = polygons.length, front = [], back = []; - - for (var i = 0; i < polygon_count; ++i) - this.divider.splitPolygon(polygons[i], front, back, front, back); - - if (this.front) front = this.front.clipPolygons(front); - if (this.back) back = this.back.clipPolygons(back); - else back = []; - - return front.concat(back); -}; - -Node.prototype.clipTo = function (node) { - this.polygons = node.clipPolygons(this.polygons); - if (this.front) this.front.clipTo(node); - if (this.back) this.back.clipTo(node); -}; \ No newline at end of file diff --git a/dataforge-vis-jsroot/src/main/web/index.html b/dataforge-vis-jsroot/src/main/web/index.html deleted file mode 100644 index 233412fd..00000000 --- a/dataforge-vis-jsroot/src/main/web/index.html +++ /dev/null @@ -1,33 +0,0 @@ - - - - - - Three js demo for particle physics - - - - -
- Загрузить данные -
- (перетащить файл сюда) -
-
-

Demo grid

-
-
- - - - - - \ No newline at end of file