@webviz/subsurface-viewer 0.0.2-alpha.6 → 0.0.2-alpha.8
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/SubsurfaceViewer.d.ts +8 -5
- package/dist/SubsurfaceViewer.js +1 -2
- package/dist/SubsurfaceViewer.js.map +1 -1
- package/dist/components/ColorLegend.d.ts +4 -4
- package/dist/components/ColorLegends.d.ts +2 -2
- package/dist/components/DistanceScale.d.ts +1 -1
- package/dist/components/DistanceScale.js.map +1 -1
- package/dist/components/InfoCard.d.ts +1 -1
- package/dist/components/Map.d.ts +24 -8
- package/dist/components/Map.js +122 -26
- package/dist/components/Map.js.map +1 -1
- package/dist/components/StatusIndicator.d.ts +1 -1
- package/dist/components/settings/DrawModeSelector.js.map +1 -1
- package/dist/components/settings/LayerProperty.js.map +1 -1
- package/dist/components/settings/LayerSettingsButton.js.map +1 -1
- package/dist/components/settings/LayersButton.js.map +1 -1
- package/dist/components/settings/NumericInput.d.ts +2 -1
- package/dist/components/settings/NumericInput.js.map +1 -1
- package/dist/components/settings/SliderInput.d.ts +2 -1
- package/dist/components/settings/SliderInput.js.map +1 -1
- package/dist/components/settings/ToggleButton.d.ts +2 -1
- package/dist/components/settings/ToggleButton.js.map +1 -1
- package/dist/index.d.ts +3 -1
- package/dist/index.js +1 -1
- package/dist/index.js.map +1 -1
- package/dist/layers/BoxSelectionLayer/boxSelectionLayer.d.ts +5 -4
- package/dist/layers/BoxSelectionLayer/boxSelectionLayer.js.map +1 -1
- package/dist/layers/axes/axesLayer.d.ts +3 -2
- package/dist/layers/axes/axesLayer.js.map +1 -1
- package/dist/layers/axes/boxLayer.d.ts +4 -3
- package/dist/layers/axes/boxLayer.js +1 -1
- package/dist/layers/axes/boxLayer.js.map +1 -1
- package/dist/layers/axes2d/axes2DLayer.d.ts +4 -3
- package/dist/layers/axes2d/axes2DLayer.js.map +1 -1
- package/dist/layers/colormap/colormapLayer.d.ts +7 -6
- package/dist/layers/colormap/colormapLayer.js.map +1 -1
- package/dist/layers/drawing/drawingLayer.d.ts +4 -3
- package/dist/layers/drawing/drawingLayer.js +1 -1
- package/dist/layers/drawing/drawingLayer.js.map +1 -1
- package/dist/layers/fault_polygons/faultPolygonsLayer.d.ts +3 -2
- package/dist/layers/fault_polygons/faultPolygonsLayer.js.map +1 -1
- package/dist/layers/grid3d/grid3dLayer.d.ts +9 -5
- package/dist/layers/grid3d/grid3dLayer.js +2 -3
- package/dist/layers/grid3d/grid3dLayer.js.map +1 -1
- package/dist/layers/grid3d/privateLayer.d.ts +6 -4
- package/dist/layers/grid3d/privateLayer.js +4 -2
- package/dist/layers/grid3d/privateLayer.js.map +1 -1
- package/dist/layers/grid3d/webworker.d.ts +1 -1
- package/dist/layers/grid3d/webworker.js +520 -2
- package/dist/layers/grid3d/webworker.js.map +1 -1
- package/dist/layers/hillshading2d/hillshading2dLayer.d.ts +5 -4
- package/dist/layers/hillshading2d/hillshading2dLayer.js.map +1 -1
- package/dist/layers/index.d.ts +16 -16
- package/dist/layers/intersection/unfoldedGeoJsonLayer.d.ts +2 -2
- package/dist/layers/map/mapLayer.d.ts +5 -3
- package/dist/layers/map/mapLayer.js.map +1 -1
- package/dist/layers/map/privateMapLayer.d.ts +5 -4
- package/dist/layers/map/privateMapLayer.js +1 -1
- package/dist/layers/map/privateMapLayer.js.map +1 -1
- package/dist/layers/map/webworker.d.ts +1 -1
- package/dist/layers/northarrow/northArrow3DLayer.d.ts +4 -3
- package/dist/layers/northarrow/northArrow3DLayer.js +1 -1
- package/dist/layers/northarrow/northArrow3DLayer.js.map +1 -1
- package/dist/layers/piechart/pieChartLayer.d.ts +4 -3
- package/dist/layers/piechart/pieChartLayer.js +2 -2
- package/dist/layers/piechart/pieChartLayer.js.map +1 -1
- package/dist/layers/points/pointsLayer.d.ts +3 -2
- package/dist/layers/points/pointsLayer.js +1 -1
- package/dist/layers/points/pointsLayer.js.map +1 -1
- package/dist/layers/polylines/polylinesLayer.d.ts +3 -2
- package/dist/layers/polylines/polylinesLayer.js +1 -1
- package/dist/layers/polylines/polylinesLayer.js.map +1 -1
- package/dist/layers/selectable_geojson/selectableGeoJsonLayer.d.ts +2 -2
- package/dist/layers/shader_modules/decoder.d.ts +1 -1
- package/dist/layers/terrain/map3DLayer.d.ts +6 -4
- package/dist/layers/terrain/map3DLayer.js.map +1 -1
- package/dist/layers/terrain/terrainMapLayer.d.ts +4 -3
- package/dist/layers/terrain/terrainMapLayer.js +2 -2
- package/dist/layers/terrain/terrainMapLayer.js.map +1 -1
- package/dist/layers/triangle/privateTriangleLayer.d.ts +5 -4
- package/dist/layers/triangle/privateTriangleLayer.js +1 -1
- package/dist/layers/triangle/privateTriangleLayer.js.map +1 -1
- package/dist/layers/triangle/triangleLayer.d.ts +6 -4
- package/dist/layers/triangle/triangleLayer.js.map +1 -1
- package/dist/layers/triangle/webworker.d.ts +1 -1
- package/dist/layers/utils/layerTools.d.ts +4 -4
- package/dist/layers/utils/propertyMapTools.d.ts +1 -1
- package/dist/layers/wells/utils/spline.d.ts +2 -2
- package/dist/layers/wells/utils/spline.js.map +1 -1
- package/dist/layers/wells/wellsLayer.d.ts +7 -6
- package/dist/layers/wells/wellsLayer.js +3 -3
- package/dist/layers/wells/wellsLayer.js.map +1 -1
- package/dist/redux/reducer.d.ts +2 -2
- package/dist/redux/reducer.js +0 -1
- package/dist/redux/reducer.js.map +1 -1
- package/dist/redux/store.d.ts +1 -1
- package/dist/redux/store.js.map +1 -1
- package/dist/utils/measurement.d.ts +1 -1
- package/dist/utils/specExtractor.d.ts +1 -1
- package/dist/views/intersectionView.d.ts +2 -1
- package/dist/views/intersectionView.js.map +1 -1
- package/package.json +50 -49
- package/dist/inputSchema/ColorTables.json +0 -51
- package/dist/inputSchema/FaultPolygons.json +0 -80
- package/dist/inputSchema/Grid.json +0 -39
- package/dist/inputSchema/PieChart.json +0 -72
- package/dist/inputSchema/WellLog.json +0 -126
- package/dist/inputSchema/WellLogTemplate.json +0 -131
- package/dist/inputSchema/WellLogs.json +0 -5
- package/dist/inputSchema/Wells.json +0 -106
- package/dist/inputSchema/schemaValidationUtil.d.ts +0 -5
- package/dist/inputSchema/schemaValidationUtil.js +0 -48
- package/dist/inputSchema/schemaValidationUtil.js.map +0 -1
- package/dist/inputSchema/validator.d.ts +0 -1
- package/dist/inputSchema/validator.js +0 -64
- package/dist/inputSchema/validator.js.map +0 -1
- package/dist/layers/grid3d/earcut.d.ts +0 -5
- package/dist/layers/grid3d/earcut.js +0 -563
- package/dist/layers/grid3d/earcut.js.map +0 -1
- package/dist/storybook/schemaValidation/sampleData.d.ts +0 -122
- package/dist/storybook/schemaValidation/sampleData.js +0 -172
- package/dist/storybook/schemaValidation/sampleData.js.map +0 -1
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"grid3dLayer.js","sourceRoot":"","sources":["../../../src/layers/grid3d/grid3dLayer.ts"],"names":[],"mappings":";;;;;;;;;
|
|
1
|
+
{"version":3,"file":"grid3dLayer.js","sourceRoot":"","sources":["../../../src/layers/grid3d/grid3dLayer.ts"],"names":[],"mappings":";;;;;;;;;AACA,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAErD,OAAO,YAAY,MAAM,gBAAgB,CAAC;AAK1C,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,QAAQ,CAAC;AACjC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AASpD,SAAS,OAAO,CACZ,MAAgB,EAChB,sBAA+B;IAE/B,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IAErB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;IAEpB,MAAM,MAAM,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACxC,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3D,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE3D,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3D,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE3D,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC3D,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;KAC9D;IACD,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC;AAClE,CAAC;AAED,SAAe,SAAS,CACpB,UAA6B,EAC7B,SAA4B,EAC5B,cAAiC;;QAEjC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;YACpC,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,MAAM,IAAI,CAAC,UAAoB,EAAE,UAAU,CAAC,CAAC;QAEnD,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC;YAClC,CAAC,CAAC,SAAS;YACX,CAAC,CAAC,MAAM,IAAI,CAAC,SAAmB,EAAE,UAAU,CAAC,CAAC;QAElD,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC;YAC5C,CAAC,CAAC,cAAc;YAChB,CAAC,CAAC,MAAM,IAAI,CAAC,cAAwB,EAAE,UAAU,CAAC,CAAC;QAEvD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC;IACpD,CAAC;CAAA;AA0ED,MAAM,YAAY,GAAG;IACjB,QAAQ,EAAE,aAAa;IACvB,IAAI,EAAE,SAAS;IACf,EAAE,EAAE,eAAe;IACnB,OAAO,EAAE,IAAI;IACb,QAAQ,EAAE,IAAI;IACd,YAAY,EAAE,EAAE;IAChB,SAAS,EAAE,IAAI;IACf,kBAAkB,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;IAC9B,SAAS,EAAE,IAAI;IACf,oBAAoB,EAAE,IAAI;CAC7B,CAAC;AAEF,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,cAAgC;IACrE,IAAI,QAAQ;;QACR,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACtC,MAAM,QAAQ,GACV,KAAK,CAAC,QAAQ;YACd,SAAS,CAAC,MAAM,GAAG,CAAC;YACpB,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAE/C,MAAM,UAAU,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,0CAAG,mBAAmB,CAAC,mCAAI,KAAK,CAAC;QAC9D,OAAO,QAAQ,IAAI,UAAU,CAAC;IAClC,CAAC;IAED,WAAW,CAAC,iBAA0B;QAClC,MAAM,CAAC,GAAG,SAAS,CACf,IAAI,CAAC,KAAK,CAAC,UAAU,EACrB,IAAI,CAAC,KAAK,CAAC,SAAS,EACpB,IAAI,CAAC,KAAK,CAAC,cAAc,CAC5B,CAAC;QAEF,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,EAAE;YACnC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC;YAE9D,iEAAiE;YACjE,mDAAmD;YACnD,MAAM,IAAI,GAAG,IAAI,IAAI,CACjB,CAAC,mBAAmB,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,EAC9C,EAAE,IAAI,EAAE,iBAAiB,EAAE,CAC9B,CAAC;YACF,MAAM,GAAG,GAAG,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC;YAElC,MAAM,eAAe,GAAoB;gBACrC,MAAM;gBACN,KAAK;gBACL,UAAU;gBACV,sBAAsB,EAAE,IAAI,CAAC,KAAK,CAAC,oBAAoB;aAC1D,CAAC;YAEF,SAAS,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;YACvC,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,EAAE;;gBACxB,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;gBACtD,MAAM,MAAM,GAAG;oBACX,QAAQ,EAAE,KAAK;oBACf,UAAU,EAAE,MAAA,IAAI,CAAC,KAAK,CAAC,aAAa,mCAAI,kBAAkB;oBAC1D,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY;oBAClC,KAAK,EAAE,UAAU;oBACjB,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB;iBAChD,CAAC;gBAEF,IAAI,CAAC,QAAQ,CAAC;oBACV,IAAI;oBACJ,UAAU;oBACV,kBAAkB;oBAClB,MAAM;iBACT,CAAC,CAAC;gBAEH,IACI,OAAO,IAAI,CAAC,KAAK,CAAC,sBAAsB,KAAK,WAAW;oBACxD,iBAAiB,EACnB;oBACE,IAAI,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;iBAC3C;gBAED,SAAS,CAAC,SAAS,EAAE,CAAC;gBAEtB,IAAI,CAAC,QAAQ,iCACN,IAAI,CAAC,KAAK,KACb,iBAAiB,EAAE,IAAI,IACzB,CAAC;YACP,CAAC,CAAC;QACN,CAAC,CAAC,CAAC;IACP,CAAC;IAED,eAAe;QACX,IAAI,CAAC,QAAQ,iCACN,IAAI,CAAC,KAAK,KACb,iBAAiB,EAAE,KAAK,IAC1B,CAAC;QACH,MAAM,iBAAiB,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC;IACxC,CAAC;IAED,WAAW,CAAC,EACR,KAAK,EACL,QAAQ,GAIX;QACG,MAAM,YAAY,GACd,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,UAAU,CAAC;YAC/C,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC;YAC7C,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,CAAC;YACvD,CAAC,OAAO,CAAC,KAAK,CAAC,oBAAoB,EAAE,QAAQ,CAAC,oBAAoB,CAAC,CAAC;QAExE,IAAI,YAAY,EAAE;YACd,IAAI,CAAC,QAAQ,iCACN,IAAI,CAAC,KAAK,KACb,iBAAiB,EAAE,KAAK,IAC1B,CAAC;YACH,MAAM,iBAAiB,GAAG,KAAK,CAAC;YAChC,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC;SACvC;IACL,CAAC;IAED,YAAY;QACR,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;YACtC,kCAAkC;YAClC,OAAO,EAAE,CAAC;SACb;QAED,MAAM,KAAK,GAAG,IAAI,YAAY,CAC1B,IAAI,CAAC,gBAAgB,CAAC;YAClB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACxB,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;YACnC,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY;YACrC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa;YACvC,kBAAkB,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB;YACjD,gBAAgB,EAAE,IAAI,CAAC,KAAK,CAAC,gBAAgB;YAC7C,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS;YAC/B,kBAAkB,EAAE,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC;YACpD,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ;YAC7B,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS;SAClC,CAAC,CACL,CAAC;QACF,OAAO,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;CACJ;AAED,WAAW,CAAC,SAAS,GAAG,aAAa,CAAC;AACtC,WAAW,CAAC,YAAY,GAAG,YAA2C,CAAC"}
|
|
@@ -1,8 +1,9 @@
|
|
|
1
|
-
import {
|
|
2
|
-
import {
|
|
1
|
+
import type { PickingInfo, UpdateParameters, Color } from "@deck.gl/core/typed";
|
|
2
|
+
import { Layer } from "@deck.gl/core/typed";
|
|
3
|
+
import type { LayerPickInfo } from "../utils/layerTools";
|
|
3
4
|
import { Model } from "@luma.gl/engine";
|
|
4
|
-
import { DeckGLLayerContext } from "../../components/Map";
|
|
5
|
-
import { ExtendedLayerProps, colorMapFunctionType } from "../utils/layerTools";
|
|
5
|
+
import type { DeckGLLayerContext } from "../../components/Map";
|
|
6
|
+
import type { ExtendedLayerProps, colorMapFunctionType } from "../utils/layerTools";
|
|
6
7
|
export type MeshType = {
|
|
7
8
|
drawMode?: number;
|
|
8
9
|
attributes: {
|
|
@@ -56,6 +57,7 @@ export interface privateLayerProps extends ExtendedLayerProps {
|
|
|
56
57
|
colorMapRange: [number, number];
|
|
57
58
|
colorMapClampColor: Color | undefined | boolean;
|
|
58
59
|
colorMapFunction?: colorMapFunctionType | false;
|
|
60
|
+
gridLines: boolean;
|
|
59
61
|
propertyValueRange: [number, number];
|
|
60
62
|
depthTest: boolean;
|
|
61
63
|
}
|
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import { COORDINATE_SYSTEM, Layer, picking, project, phongLighting, } from "@deck.gl/core/typed";
|
|
2
|
-
import { createPropertyData
|
|
2
|
+
import { createPropertyData } from "../utils/layerTools";
|
|
3
3
|
import { Model, Geometry } from "@luma.gl/engine";
|
|
4
4
|
import vsShader from "./vertex.glsl";
|
|
5
5
|
import fsShader from "./fragment.fs.glsl";
|
|
@@ -142,7 +142,9 @@ export default class privateLayer extends Layer {
|
|
|
142
142
|
.draw();
|
|
143
143
|
gl.disable(gl.POLYGON_OFFSET_FILL);
|
|
144
144
|
// Draw lines.
|
|
145
|
-
|
|
145
|
+
if (this.props.gridLines) {
|
|
146
|
+
mesh_lines_model.draw();
|
|
147
|
+
}
|
|
146
148
|
if (!this.props.depthTest) {
|
|
147
149
|
gl.enable(gl.DEPTH_TEST);
|
|
148
150
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"privateLayer.js","sourceRoot":"","sources":["../../../src/layers/grid3d/privateLayer.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"privateLayer.js","sourceRoot":"","sources":["../../../src/layers/grid3d/privateLayer.ts"],"names":[],"mappings":"AACA,OAAO,EACH,iBAAiB,EACjB,KAAK,EACL,OAAO,EACP,OAAO,EACP,aAAa,GAChB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAMlD,OAAO,QAAQ,MAAM,eAAe,CAAC;AACrC,OAAO,QAAQ,MAAM,oBAAoB,CAAC;AAC1C,OAAO,YAAY,MAAM,qBAAqB,CAAC;AAC/C,OAAO,YAAY,MAAM,uBAAuB,CAAC;AAGjD,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,iCAAiC,EAAE,MAAM,qEAAqE,CAAC;AACxH,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAEpC,MAAM,0BAA0B,GAAG;IAC/B,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,EAAE,CAAC,oBAAoB;IAChD,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,EAAE,CAAC,MAAM;IAClC,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,aAAa;IACrC,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,aAAa;CACxC,CAAC;AAgCF,SAAS,YAAY,CACjB,YAAoB,EACpB,WAA6B,EAC7B,gBAA0D;IAE1D,MAAM,yBAAyB,GAAG,OAAO,gBAAgB,KAAK,UAAU,CAAC;IACzE,MAAM,qBAAqB,GAAG,CAAC,CAAC,YAAY,CAAC;IAE7C,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAErC,MAAM,eAAe,GAAG,iCAAiC,CAAC;IAE1D,IAAI,QAAQ,GAAG,gBAAgB,CAAC;IAChC,IAAI,CAAC,yBAAyB,EAAE;QAC5B,QAAQ,GAAG,qBAAqB;YAC5B,CAAC,CAAC,CAAC,KAAa,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,YAAY,EAAE,WAAW,CAAC;YAChE,CAAC,CAAC,eAAe,EAAE,CAAC;KAC3B;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC1B,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC;QACxB,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,IAAI,KAAK,EAAE;YACP,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;SAC9B;KACJ;IAED,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AACnC,CAAC;AAcD,MAAM,YAAY,GAAG;IACjB,YAAY,EAAE,EAAE;IAChB,gBAAgB,EAAE,iBAAiB,CAAC,SAAS;IAC7C,kBAAkB,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;IAC9B,SAAS,EAAE,IAAI;CAClB,CAAC;AAEF,gEAAgE;AAChE,MAAM,CAAC,OAAO,OAAO,YAAa,SAAQ,KAAwB;IAC9D,eAAe,CAAC,OAA2B;QACvC,MAAM,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC;QACvB,MAAM,CAAC,UAAU,EAAE,gBAAgB,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3D,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,UAAU,EAAE,gBAAgB,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,iBAAiB,CAAC,EACd,KAAK,EACL,QAAQ,EACR,OAAO,EACP,WAAW,GACU;QACrB,OAAO,CACH,KAAK,CAAC,iBAAiB,CAAC;YACpB,KAAK;YACL,QAAQ;YACR,OAAO;YACP,WAAW;SACd,CAAC,IAAI,WAAW,CAAC,kBAAkB,CACvC,CAAC;IACN,CAAC;IAED,WAAW,CAAC,EAAE,OAAO,EAA0B;QAC3C,IAAI,CAAC,eAAe,CAAC,OAA6B,CAAC,CAAC;IACxD,CAAC;IAED,0BAA0B;IAC1B,UAAU,CAAC,EAAO;QACd,aAAa;QACb,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,EAAE,EAAE;YAC7B,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO;YAC3B,EAAE,EAAE,QAAQ;YACZ,EAAE,EAAE,QAAQ;YACZ,QAAQ,EAAE,IAAI,QAAQ,CAAC;gBACnB,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ;gBAClC,UAAU,EAAE;oBACR,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS;oBAC/C,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU;oBACjD,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,aAAa;iBAC1D;gBACD,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW;gBACxC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO;aACnC,CAAC;YACF,OAAO,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,aAAa,CAAC;YAC1C,WAAW,EAAE,KAAK,EAAE,qCAAqC;SAC5D,CAAC,CAAC;QAEH,aAAa;QACb,MAAM,gBAAgB,GAAG,IAAI,KAAK,CAAC,EAAE,EAAE;YACnC,EAAE,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ;YAC5B,EAAE,EAAE,YAAY;YAChB,EAAE,EAAE,YAAY;YAChB,QAAQ,EAAE,IAAI,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;YAC5C,OAAO,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;YAC3B,WAAW,EAAE,KAAK;SACrB,CAAC,CAAC;QAEH,OAAO,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC;IAC1C,CAAC;IAED,mEAAmE;IACnE,2BAA2B;IAC3B,IAAI,CAAC,IAAS;;QACV,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE;YACvB,OAAO;SACV;QAED,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QACnC,MAAM,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC;QAEvB,MAAM,CAAC,UAAU,EAAE,gBAAgB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAE5D,MAAM,aAAa,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,kBAAkB,0CAAG,CAAC,CAAC,mCAAI,GAAG,CAAC;QAChE,MAAM,aAAa,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,kBAAkB,0CAAG,CAAC,CAAC,mCAAI,GAAG,CAAC;QAEhE,gFAAgF;QAChF,gEAAgE;QAChE,MAAM,gBAAgB,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,aAAa,0CAAG,CAAC,CAAC,mCAAI,aAAa,CAAC;QACxE,MAAM,gBAAgB,GAAG,MAAA,MAAA,IAAI,CAAC,KAAK,CAAC,aAAa,0CAAG,CAAC,CAAC,mCAAI,aAAa,CAAC;QAExE,MAAM,YAAY,GACd,IAAI,CAAC,KAAK,CAAC,kBAAkB,KAAK,SAAS;YAC3C,IAAI,CAAC,KAAK,CAAC,kBAAkB,KAAK,IAAI;YACtC,IAAI,CAAC,KAAK,CAAC,kBAAkB,KAAK,KAAK,CAAC;QAC5C,IAAI,kBAAkB,GAAG,YAAY;YACjC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,kBAAkB;YAC/B,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhB,4BAA4B;QAC5B,6DAA6D;QAC7D,aAAa;QACb,kBAAkB,GAAI,kBAA4B,CAAC,GAAG,CAClD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAD,CAAC,cAAD,CAAC,GAAI,CAAC,CAAC,GAAG,GAAG,CACxB,CAAC;QAEF,MAAM,+BAA+B,GAChC,IAAI,CAAC,KAAK,CAAC,kBAA8B,KAAK,KAAK,CAAC;QAEzD,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,mBAAmB,CAAC,CAAC;QAClC,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;YACvB,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;SAC7B;QAED,UAAU;aACL,WAAW,iCACL,QAAQ,KACX,QAAQ,EAAE,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE;gBAChC,KAAK,EAAE,GAAG;gBACV,MAAM,EAAE,CAAC;gBACT,MAAM,EAAE,EAAE,CAAC,GAAG;gBACd,IAAI,EAAE,YAAY,CACd,IAAI,CAAC,KAAK,CAAC,YAAY,EACtB,IAAI,CAAC,OAA8B,CAAC,QAAQ;qBACxC,WAAW,EAChB,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAC9B;gBACD,UAAU,EAAE,0BAA0B;aACzC,CAAC,EACF,aAAa;YACb,aAAa;YACb,gBAAgB;YAChB,gBAAgB;YAChB,kBAAkB;YAClB,+BAA+B;YAC/B,YAAY,IACd;aACD,IAAI,EAAE,CAAC;QACZ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,mBAAmB,CAAC,CAAC;QAEnC,cAAc;QACd,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;YACtB,gBAAgB,CAAC,IAAI,EAAE,CAAC;SAC3B;QAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;YACvB,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;SAC5B;IACL,CAAC;IAED,kBAAkB;QACd,OAAO,IAAI,CAAC,gBAAgB,EAAuB,CAAC;IACxD,CAAC;IAED,kBAAkB;QACd,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC;IACnC,CAAC;IAED,cAAc,CAAC,EAAE,IAAI,EAAyB;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACb,OAAO,IAAI,CAAC;SACf;QAED,MAAM,gBAAgB,GAAuB,EAAE,CAAC;QAEhD,4CAA4C;QAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAExB,MAAM,WAAW,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAEhD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC;QAC3D,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;QAC5C,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;QAE1D,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC;QAC/D,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;QACzC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QAEhE,uCACO,IAAI,KACP,UAAU,EAAE,gBAAgB,IAC9B;IACN,CAAC;CACJ;AAED,YAAY,CAAC,SAAS,GAAG,cAAc,CAAC;AACxC,YAAY,CAAC,YAAY,GAAG,YAAY,CAAC"}
|
|
@@ -1,4 +1,523 @@
|
|
|
1
1
|
export function makeFullMesh(e) {
|
|
2
|
+
class Node {
|
|
3
|
+
constructor(i, x, y) {
|
|
4
|
+
// vertex index in coordinates array
|
|
5
|
+
this.i = i;
|
|
6
|
+
// vertex coordinates
|
|
7
|
+
this.x = x;
|
|
8
|
+
this.y = y;
|
|
9
|
+
// previous and next vertex nodes in a polygon ring
|
|
10
|
+
this.prev = this;
|
|
11
|
+
this.next = this;
|
|
12
|
+
// z-order curve value
|
|
13
|
+
this.z = 0;
|
|
14
|
+
// previous and next nodes in z-order
|
|
15
|
+
this.prevZ = this;
|
|
16
|
+
this.nextZ = this;
|
|
17
|
+
// indicates whether this is a steiner point
|
|
18
|
+
this.steiner = false;
|
|
19
|
+
}
|
|
20
|
+
}
|
|
21
|
+
/**
|
|
22
|
+
* The fastest and smallest JavaScript polygon triangulation library for your WebGL apps.
|
|
23
|
+
* https://github.com/mapbox/earcut
|
|
24
|
+
* The library is used as source code because of issues with imports in webworkers.
|
|
25
|
+
*/
|
|
26
|
+
function earcut(data, dim) {
|
|
27
|
+
dim = dim || 2;
|
|
28
|
+
const outerLen = data.length;
|
|
29
|
+
const outerNode = linkedList(data, 0, outerLen, dim, true);
|
|
30
|
+
const triangles = [];
|
|
31
|
+
if (!outerNode || outerNode.next === outerNode.prev)
|
|
32
|
+
return triangles;
|
|
33
|
+
let minX = Number.POSITIVE_INFINITY, minY = Number.POSITIVE_INFINITY, maxX = Number.NEGATIVE_INFINITY, maxY = Number.NEGATIVE_INFINITY, x, y, invSize = 0;
|
|
34
|
+
// if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox
|
|
35
|
+
if (data.length > 80 * dim) {
|
|
36
|
+
minX = maxX = data[0];
|
|
37
|
+
minY = maxY = data[1];
|
|
38
|
+
for (let i = dim; i < outerLen; i += dim) {
|
|
39
|
+
x = data[i];
|
|
40
|
+
y = data[i + 1];
|
|
41
|
+
if (x < minX)
|
|
42
|
+
minX = x;
|
|
43
|
+
if (y < minY)
|
|
44
|
+
minY = y;
|
|
45
|
+
if (x > maxX)
|
|
46
|
+
maxX = x;
|
|
47
|
+
if (y > maxY)
|
|
48
|
+
maxY = y;
|
|
49
|
+
}
|
|
50
|
+
// minX, minY and invSize are later used to transform coords into integers for z-order calculation
|
|
51
|
+
invSize = Math.max(maxX - minX, maxY - minY);
|
|
52
|
+
invSize = invSize !== 0 ? 32767 / invSize : 0;
|
|
53
|
+
}
|
|
54
|
+
earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
|
|
55
|
+
return triangles;
|
|
56
|
+
// create a circular doubly linked list from polygon points in the specified winding order
|
|
57
|
+
function linkedList(data, start, end, dim, clockwise) {
|
|
58
|
+
let i;
|
|
59
|
+
let last = null;
|
|
60
|
+
if (clockwise === signedArea(data, start, end, dim) > 0) {
|
|
61
|
+
for (i = start; i < end; i += dim)
|
|
62
|
+
last = insertNode(i, data[i], data[i + 1], last);
|
|
63
|
+
}
|
|
64
|
+
else {
|
|
65
|
+
for (i = end - dim; i >= start; i -= dim)
|
|
66
|
+
last = insertNode(i, data[i], data[i + 1], last);
|
|
67
|
+
}
|
|
68
|
+
if (last && equals(last, last.next)) {
|
|
69
|
+
removeNode(last);
|
|
70
|
+
last = last.next;
|
|
71
|
+
}
|
|
72
|
+
return last;
|
|
73
|
+
}
|
|
74
|
+
// eliminate colinear or duplicate points
|
|
75
|
+
function filterPoints(start, end) {
|
|
76
|
+
if (!start)
|
|
77
|
+
return start;
|
|
78
|
+
if (!end)
|
|
79
|
+
end = start;
|
|
80
|
+
let p = start, again;
|
|
81
|
+
do {
|
|
82
|
+
again = false;
|
|
83
|
+
if (!p.steiner &&
|
|
84
|
+
(equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
|
|
85
|
+
removeNode(p);
|
|
86
|
+
p = end = p.prev;
|
|
87
|
+
if (p === p.next)
|
|
88
|
+
break;
|
|
89
|
+
again = true;
|
|
90
|
+
}
|
|
91
|
+
else {
|
|
92
|
+
p = p.next;
|
|
93
|
+
}
|
|
94
|
+
} while (again || p !== end);
|
|
95
|
+
return end;
|
|
96
|
+
}
|
|
97
|
+
// main ear slicing loop which triangulates a polygon (given as a linked list)
|
|
98
|
+
function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
|
|
99
|
+
if (!ear)
|
|
100
|
+
return;
|
|
101
|
+
// interlink polygon nodes in z-order
|
|
102
|
+
if (!pass && invSize)
|
|
103
|
+
indexCurve(ear, minX, minY, invSize);
|
|
104
|
+
let stop = ear, prev, next;
|
|
105
|
+
// iterate through ears, slicing them one by one
|
|
106
|
+
while (ear.prev !== ear.next) {
|
|
107
|
+
prev = ear.prev;
|
|
108
|
+
next = ear.next;
|
|
109
|
+
if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
|
|
110
|
+
// cut off the triangle
|
|
111
|
+
triangles.push((prev.i / dim) | 0);
|
|
112
|
+
triangles.push((ear.i / dim) | 0);
|
|
113
|
+
triangles.push((next.i / dim) | 0);
|
|
114
|
+
removeNode(ear);
|
|
115
|
+
// skipping the next vertex leads to less sliver triangles
|
|
116
|
+
ear = next.next;
|
|
117
|
+
stop = next.next;
|
|
118
|
+
continue;
|
|
119
|
+
}
|
|
120
|
+
ear = next;
|
|
121
|
+
// if we looped through the whole remaining polygon and can't find any more ears
|
|
122
|
+
if (ear === stop) {
|
|
123
|
+
// try filtering points and slicing again
|
|
124
|
+
if (!pass) {
|
|
125
|
+
earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
|
|
126
|
+
// if this didn't work, try curing all small self-intersections locally
|
|
127
|
+
}
|
|
128
|
+
else if (pass === 1) {
|
|
129
|
+
ear = cureLocalIntersections(filterPoints(ear), triangles, dim);
|
|
130
|
+
earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
|
|
131
|
+
// as a last resort, try splitting the remaining polygon into two
|
|
132
|
+
}
|
|
133
|
+
else if (pass === 2) {
|
|
134
|
+
splitEarcut(ear, triangles, dim, minX, minY, invSize);
|
|
135
|
+
}
|
|
136
|
+
break;
|
|
137
|
+
}
|
|
138
|
+
}
|
|
139
|
+
}
|
|
140
|
+
//min & max are calculated like this for speed
|
|
141
|
+
function getMin(a, b, c) {
|
|
142
|
+
if (a < b) {
|
|
143
|
+
if (a < c) {
|
|
144
|
+
return a;
|
|
145
|
+
}
|
|
146
|
+
return c;
|
|
147
|
+
}
|
|
148
|
+
if (b < c) {
|
|
149
|
+
return b;
|
|
150
|
+
}
|
|
151
|
+
return c;
|
|
152
|
+
}
|
|
153
|
+
function getMax(a, b, c) {
|
|
154
|
+
if (a > b) {
|
|
155
|
+
if (a > c) {
|
|
156
|
+
return a;
|
|
157
|
+
}
|
|
158
|
+
return c;
|
|
159
|
+
}
|
|
160
|
+
if (b > c) {
|
|
161
|
+
return b;
|
|
162
|
+
}
|
|
163
|
+
return c;
|
|
164
|
+
}
|
|
165
|
+
function triangleBBox(ax, bx, cx, ay, by, cy) {
|
|
166
|
+
const x0 = getMin(ax, bx, cx);
|
|
167
|
+
const y0 = getMin(ay, by, cy);
|
|
168
|
+
const x1 = getMax(ax, bx, cx);
|
|
169
|
+
const y1 = getMax(ay, by, cy);
|
|
170
|
+
return [x0, y0, x1, y1];
|
|
171
|
+
}
|
|
172
|
+
// check whether a polygon node forms a valid ear with adjacent nodes
|
|
173
|
+
function isEar(ear) {
|
|
174
|
+
const a = ear.prev, b = ear, c = ear.next;
|
|
175
|
+
if (area(a, b, c) >= 0)
|
|
176
|
+
return false; // reflex, can't be an ear
|
|
177
|
+
// now make sure we don't have other points inside the potential ear
|
|
178
|
+
const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
|
|
179
|
+
const [x0, y0, x1, y1] = triangleBBox(ax, bx, cx, ay, by, cy);
|
|
180
|
+
let p = c.next;
|
|
181
|
+
while (p !== a) {
|
|
182
|
+
if (p.x >= x0 &&
|
|
183
|
+
p.x <= x1 &&
|
|
184
|
+
p.y >= y0 &&
|
|
185
|
+
p.y <= y1 &&
|
|
186
|
+
pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&
|
|
187
|
+
area(p.prev, p, p.next) >= 0)
|
|
188
|
+
return false;
|
|
189
|
+
p = p.next;
|
|
190
|
+
}
|
|
191
|
+
return true;
|
|
192
|
+
}
|
|
193
|
+
function isEarHashed(ear, minX, minY, invSize) {
|
|
194
|
+
const a = ear.prev, b = ear, c = ear.next;
|
|
195
|
+
if (area(a, b, c) >= 0)
|
|
196
|
+
return false; // reflex, can't be an ear
|
|
197
|
+
const ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
|
|
198
|
+
const [x0, y0, x1, y1] = triangleBBox(ax, bx, cx, ay, by, cy);
|
|
199
|
+
// z-order range for the current triangle bbox;
|
|
200
|
+
const minZ = zOrder(x0, y0, minX, minY, invSize), maxZ = zOrder(x1, y1, minX, minY, invSize);
|
|
201
|
+
let p = ear.prevZ;
|
|
202
|
+
let n = ear.nextZ;
|
|
203
|
+
// look for points inside the triangle in both directions
|
|
204
|
+
while (p && p.z >= minZ && n && n.z <= maxZ) {
|
|
205
|
+
if (p.x >= x0 &&
|
|
206
|
+
p.x <= x1 &&
|
|
207
|
+
p.y >= y0 &&
|
|
208
|
+
p.y <= y1 &&
|
|
209
|
+
p !== a &&
|
|
210
|
+
p !== c &&
|
|
211
|
+
pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&
|
|
212
|
+
area(p.prev, p, p.next) >= 0)
|
|
213
|
+
return false;
|
|
214
|
+
p = p.prevZ;
|
|
215
|
+
if (n.x >= x0 &&
|
|
216
|
+
n.x <= x1 &&
|
|
217
|
+
n.y >= y0 &&
|
|
218
|
+
n.y <= y1 &&
|
|
219
|
+
n !== a &&
|
|
220
|
+
n !== c &&
|
|
221
|
+
pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) &&
|
|
222
|
+
area(n.prev, n, n.next) >= 0)
|
|
223
|
+
return false;
|
|
224
|
+
n = n.nextZ;
|
|
225
|
+
}
|
|
226
|
+
// look for remaining points in decreasing z-order
|
|
227
|
+
while (p && p.z >= minZ) {
|
|
228
|
+
if (p.x >= x0 &&
|
|
229
|
+
p.x <= x1 &&
|
|
230
|
+
p.y >= y0 &&
|
|
231
|
+
p.y <= y1 &&
|
|
232
|
+
p !== a &&
|
|
233
|
+
p !== c &&
|
|
234
|
+
pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&
|
|
235
|
+
area(p.prev, p, p.next) >= 0)
|
|
236
|
+
return false;
|
|
237
|
+
p = p.prevZ;
|
|
238
|
+
}
|
|
239
|
+
// look for remaining points in increasing z-order
|
|
240
|
+
while (n && n.z <= maxZ) {
|
|
241
|
+
if (n.x >= x0 &&
|
|
242
|
+
n.x <= x1 &&
|
|
243
|
+
n.y >= y0 &&
|
|
244
|
+
n.y <= y1 &&
|
|
245
|
+
n !== a &&
|
|
246
|
+
n !== c &&
|
|
247
|
+
pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) &&
|
|
248
|
+
area(n.prev, n, n.next) >= 0)
|
|
249
|
+
return false;
|
|
250
|
+
n = n.nextZ;
|
|
251
|
+
}
|
|
252
|
+
return true;
|
|
253
|
+
}
|
|
254
|
+
// go through all polygon nodes and cure small local self-intersections
|
|
255
|
+
function cureLocalIntersections(start, triangles, dim) {
|
|
256
|
+
let p = start;
|
|
257
|
+
do {
|
|
258
|
+
const a = p.prev, b = p.next.next;
|
|
259
|
+
if (!equals(a, b) &&
|
|
260
|
+
intersects(a, p, p.next, b) &&
|
|
261
|
+
locallyInside(a, b) &&
|
|
262
|
+
locallyInside(b, a)) {
|
|
263
|
+
triangles.push((a.i / dim) | 0);
|
|
264
|
+
triangles.push((p.i / dim) | 0);
|
|
265
|
+
triangles.push((b.i / dim) | 0);
|
|
266
|
+
// remove two nodes involved
|
|
267
|
+
removeNode(p);
|
|
268
|
+
removeNode(p.next);
|
|
269
|
+
p = start = b;
|
|
270
|
+
}
|
|
271
|
+
p = p.next;
|
|
272
|
+
} while (p !== start);
|
|
273
|
+
return filterPoints(p);
|
|
274
|
+
}
|
|
275
|
+
// try splitting polygon into two and triangulate them independently
|
|
276
|
+
function splitEarcut(start, triangles, dim, minX, minY, invSize) {
|
|
277
|
+
// look for a valid diagonal that divides the polygon into two
|
|
278
|
+
let a = start;
|
|
279
|
+
do {
|
|
280
|
+
let b = a.next.next;
|
|
281
|
+
while (b !== a.prev) {
|
|
282
|
+
if (a.i !== b.i && isValidDiagonal(a, b)) {
|
|
283
|
+
// split the polygon in two by the diagonal
|
|
284
|
+
let c = splitPolygon(a, b);
|
|
285
|
+
// filter colinear points around the cuts
|
|
286
|
+
a = filterPoints(a, a.next);
|
|
287
|
+
c = filterPoints(c, c.next);
|
|
288
|
+
// run earcut on each half
|
|
289
|
+
earcutLinked(a, triangles, dim, minX, minY, invSize, 0);
|
|
290
|
+
earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
|
|
291
|
+
return;
|
|
292
|
+
}
|
|
293
|
+
b = b.next;
|
|
294
|
+
}
|
|
295
|
+
a = a.next;
|
|
296
|
+
} while (a !== start);
|
|
297
|
+
}
|
|
298
|
+
// interlink polygon nodes in z-order
|
|
299
|
+
function indexCurve(start, minX, minY, invSize) {
|
|
300
|
+
let p = start;
|
|
301
|
+
do {
|
|
302
|
+
if (p.z === 0)
|
|
303
|
+
p.z = zOrder(p.x, p.y, minX, minY, invSize);
|
|
304
|
+
p.prevZ = p.prev;
|
|
305
|
+
p.nextZ = p.next;
|
|
306
|
+
p = p.next;
|
|
307
|
+
} while (p !== start);
|
|
308
|
+
if (p.prevZ) {
|
|
309
|
+
p.prevZ.nextZ = null;
|
|
310
|
+
}
|
|
311
|
+
p.prevZ = null;
|
|
312
|
+
sortLinked(p);
|
|
313
|
+
}
|
|
314
|
+
// Simon Tatham's linked list merge sort algorithm
|
|
315
|
+
// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
|
|
316
|
+
function sortLinked(list) {
|
|
317
|
+
let i, p, q, e, tail, numMerges, pSize, qSize, inSize = 1;
|
|
318
|
+
do {
|
|
319
|
+
p = list;
|
|
320
|
+
list = null;
|
|
321
|
+
tail = null;
|
|
322
|
+
numMerges = 0;
|
|
323
|
+
while (p) {
|
|
324
|
+
numMerges++;
|
|
325
|
+
q = p;
|
|
326
|
+
pSize = 0;
|
|
327
|
+
for (i = 0; i < inSize; i++) {
|
|
328
|
+
pSize++;
|
|
329
|
+
q = q.nextZ;
|
|
330
|
+
if (!q)
|
|
331
|
+
break;
|
|
332
|
+
}
|
|
333
|
+
qSize = inSize;
|
|
334
|
+
while (pSize > 0 || (qSize > 0 && q)) {
|
|
335
|
+
if (p &&
|
|
336
|
+
pSize !== 0 &&
|
|
337
|
+
(qSize === 0 || !q || p.z <= q.z)) {
|
|
338
|
+
e = p;
|
|
339
|
+
p = p === null || p === void 0 ? void 0 : p.nextZ;
|
|
340
|
+
pSize--;
|
|
341
|
+
}
|
|
342
|
+
else {
|
|
343
|
+
e = q;
|
|
344
|
+
q = q === null || q === void 0 ? void 0 : q.nextZ;
|
|
345
|
+
qSize--;
|
|
346
|
+
}
|
|
347
|
+
if (tail)
|
|
348
|
+
tail.nextZ = e;
|
|
349
|
+
else
|
|
350
|
+
list = e;
|
|
351
|
+
if (e === null || e === void 0 ? void 0 : e.prevZ)
|
|
352
|
+
e.prevZ = tail;
|
|
353
|
+
tail = e;
|
|
354
|
+
}
|
|
355
|
+
p = q;
|
|
356
|
+
}
|
|
357
|
+
if (tail)
|
|
358
|
+
tail.nextZ = null;
|
|
359
|
+
inSize *= 2;
|
|
360
|
+
} while (numMerges > 1);
|
|
361
|
+
return list;
|
|
362
|
+
}
|
|
363
|
+
// z-order of a point given coords and inverse of the longer side of data bbox
|
|
364
|
+
function zOrder(x, y, minX, minY, invSize) {
|
|
365
|
+
// coords are transformed into non-negative 15-bit integer range
|
|
366
|
+
x = ((x - minX) * invSize) | 0;
|
|
367
|
+
y = ((y - minY) * invSize) | 0;
|
|
368
|
+
x = (x | (x << 8)) & 0x00ff00ff;
|
|
369
|
+
x = (x | (x << 4)) & 0x0f0f0f0f;
|
|
370
|
+
x = (x | (x << 2)) & 0x33333333;
|
|
371
|
+
x = (x | (x << 1)) & 0x55555555;
|
|
372
|
+
y = (y | (y << 8)) & 0x00ff00ff;
|
|
373
|
+
y = (y | (y << 4)) & 0x0f0f0f0f;
|
|
374
|
+
y = (y | (y << 2)) & 0x33333333;
|
|
375
|
+
y = (y | (y << 1)) & 0x55555555;
|
|
376
|
+
return x | (y << 1);
|
|
377
|
+
}
|
|
378
|
+
// check if a point lies within a convex triangle
|
|
379
|
+
function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
|
|
380
|
+
return ((cx - px) * (ay - py) >= (ax - px) * (cy - py) &&
|
|
381
|
+
(ax - px) * (by - py) >= (bx - px) * (ay - py) &&
|
|
382
|
+
(bx - px) * (cy - py) >= (cx - px) * (by - py));
|
|
383
|
+
}
|
|
384
|
+
// check if a diagonal between two polygon nodes is valid (lies in polygon interior)
|
|
385
|
+
function isValidDiagonal(a, b) {
|
|
386
|
+
return (a.next.i !== b.i &&
|
|
387
|
+
a.prev.i !== b.i &&
|
|
388
|
+
!intersectsPolygon(a, b) && // dones't intersect other edges
|
|
389
|
+
((locallyInside(a, b) &&
|
|
390
|
+
locallyInside(b, a) &&
|
|
391
|
+
middleInside(a, b) && // locally visible
|
|
392
|
+
(area(a.prev, a, b.prev) || area(a, b.prev, b))) || // does not create opposite-facing sectors
|
|
393
|
+
(equals(a, b) &&
|
|
394
|
+
area(a.prev, a, a.next) > 0 &&
|
|
395
|
+
area(b.prev, b, b.next) > 0))); // special zero-length case
|
|
396
|
+
}
|
|
397
|
+
// signed area of a triangle
|
|
398
|
+
function area(p, q, r) {
|
|
399
|
+
return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
|
|
400
|
+
}
|
|
401
|
+
// check if two points are equal
|
|
402
|
+
function equals(p1, p2) {
|
|
403
|
+
return p1.x === p2.x && p1.y === p2.y;
|
|
404
|
+
}
|
|
405
|
+
// check if two segments intersect
|
|
406
|
+
function intersects(p1, q1, p2, q2) {
|
|
407
|
+
const o1 = sign(area(p1, q1, p2));
|
|
408
|
+
const o2 = sign(area(p1, q1, q2));
|
|
409
|
+
const o3 = sign(area(p2, q2, p1));
|
|
410
|
+
const o4 = sign(area(p2, q2, q1));
|
|
411
|
+
if (o1 !== o2 && o3 !== o4)
|
|
412
|
+
return true; // general case
|
|
413
|
+
if (o1 === 0 && onSegment(p1, p2, q1))
|
|
414
|
+
return true; // p1, q1 and p2 are collinear and p2 lies on p1q1
|
|
415
|
+
if (o2 === 0 && onSegment(p1, q2, q1))
|
|
416
|
+
return true; // p1, q1 and q2 are collinear and q2 lies on p1q1
|
|
417
|
+
if (o3 === 0 && onSegment(p2, p1, q2))
|
|
418
|
+
return true; // p2, q2 and p1 are collinear and p1 lies on p2q2
|
|
419
|
+
if (o4 === 0 && onSegment(p2, q1, q2))
|
|
420
|
+
return true; // p2, q2 and q1 are collinear and q1 lies on p2q2
|
|
421
|
+
return false;
|
|
422
|
+
}
|
|
423
|
+
// for collinear points p, q, r, check if point q lies on segment pr
|
|
424
|
+
function onSegment(p, q, r) {
|
|
425
|
+
return (q.x <= Math.max(p.x, r.x) &&
|
|
426
|
+
q.x >= Math.min(p.x, r.x) &&
|
|
427
|
+
q.y <= Math.max(p.y, r.y) &&
|
|
428
|
+
q.y >= Math.min(p.y, r.y));
|
|
429
|
+
}
|
|
430
|
+
function sign(num) {
|
|
431
|
+
if (num > 0) {
|
|
432
|
+
return 1;
|
|
433
|
+
}
|
|
434
|
+
if (num < 0) {
|
|
435
|
+
return -1;
|
|
436
|
+
}
|
|
437
|
+
return 0;
|
|
438
|
+
}
|
|
439
|
+
// check if a polygon diagonal intersects any polygon segments
|
|
440
|
+
function intersectsPolygon(a, b) {
|
|
441
|
+
let p = a;
|
|
442
|
+
do {
|
|
443
|
+
if (p.i !== a.i &&
|
|
444
|
+
p.next.i !== a.i &&
|
|
445
|
+
p.i !== b.i &&
|
|
446
|
+
p.next.i !== b.i &&
|
|
447
|
+
intersects(p, p.next, a, b))
|
|
448
|
+
return true;
|
|
449
|
+
p = p.next;
|
|
450
|
+
} while (p !== a);
|
|
451
|
+
return false;
|
|
452
|
+
}
|
|
453
|
+
// check if a polygon diagonal is locally inside the polygon
|
|
454
|
+
function locallyInside(a, b) {
|
|
455
|
+
return area(a.prev, a, a.next) < 0
|
|
456
|
+
? area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0
|
|
457
|
+
: area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
|
|
458
|
+
}
|
|
459
|
+
// check if the middle point of a polygon diagonal is inside the polygon
|
|
460
|
+
function middleInside(a, b) {
|
|
461
|
+
const px = (a.x + b.x) / 2;
|
|
462
|
+
const py = (a.y + b.y) / 2;
|
|
463
|
+
let p = a;
|
|
464
|
+
let inside = false;
|
|
465
|
+
do {
|
|
466
|
+
if (p.y > py !== p.next.y > py &&
|
|
467
|
+
p.next.y !== p.y &&
|
|
468
|
+
px <
|
|
469
|
+
((p.next.x - p.x) * (py - p.y)) / (p.next.y - p.y) + p.x)
|
|
470
|
+
inside = !inside;
|
|
471
|
+
p = p.next;
|
|
472
|
+
} while (p !== a);
|
|
473
|
+
return inside;
|
|
474
|
+
}
|
|
475
|
+
// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;
|
|
476
|
+
// if one belongs to the outer ring and another to a hole, it merges it into a single ring
|
|
477
|
+
function splitPolygon(a, b) {
|
|
478
|
+
const a2 = new Node(a.i, a.x, a.y), b2 = new Node(b.i, b.x, b.y), an = a.next, bp = b.prev;
|
|
479
|
+
a.next = b;
|
|
480
|
+
b.prev = a;
|
|
481
|
+
a2.next = an;
|
|
482
|
+
an.prev = a2;
|
|
483
|
+
b2.next = a2;
|
|
484
|
+
a2.prev = b2;
|
|
485
|
+
bp.next = b2;
|
|
486
|
+
b2.prev = bp;
|
|
487
|
+
return b2;
|
|
488
|
+
}
|
|
489
|
+
// create a node and optionally link it with previous one (in a circular doubly linked list)
|
|
490
|
+
function insertNode(i, x, y, last) {
|
|
491
|
+
const p = new Node(i, x, y);
|
|
492
|
+
if (!last) {
|
|
493
|
+
p.prev = p;
|
|
494
|
+
p.next = p;
|
|
495
|
+
}
|
|
496
|
+
else {
|
|
497
|
+
p.next = last.next;
|
|
498
|
+
p.prev = last;
|
|
499
|
+
last.next.prev = p;
|
|
500
|
+
last.next = p;
|
|
501
|
+
}
|
|
502
|
+
return p;
|
|
503
|
+
}
|
|
504
|
+
function removeNode(p) {
|
|
505
|
+
p.next.prev = p.prev;
|
|
506
|
+
p.prev.next = p.next;
|
|
507
|
+
if (p.prevZ)
|
|
508
|
+
p.prevZ.nextZ = p.nextZ;
|
|
509
|
+
if (p.nextZ)
|
|
510
|
+
p.nextZ.prevZ = p.prevZ;
|
|
511
|
+
}
|
|
512
|
+
function signedArea(data, start, end, dim) {
|
|
513
|
+
let sum = 0;
|
|
514
|
+
for (let i = start, j = end - dim; i < end; i += dim) {
|
|
515
|
+
sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
|
|
516
|
+
j = i;
|
|
517
|
+
}
|
|
518
|
+
return sum;
|
|
519
|
+
}
|
|
520
|
+
}
|
|
2
521
|
const get3DPoint = (points, index) => {
|
|
3
522
|
return points.slice(index * 3, (index + 1) * 3);
|
|
4
523
|
};
|
|
@@ -81,7 +600,6 @@ export function makeFullMesh(e) {
|
|
|
81
600
|
let pn = 0;
|
|
82
601
|
let i = 0;
|
|
83
602
|
let vertexIndex = 0;
|
|
84
|
-
const triangFunc = Function(params.triangulateParamName, params.triangulateFunc);
|
|
85
603
|
while (i < polys.length) {
|
|
86
604
|
const n = polys[i];
|
|
87
605
|
const propertyValue = properties[pn++];
|
|
@@ -113,7 +631,7 @@ export function makeFullMesh(e) {
|
|
|
113
631
|
// As the triangulation algorythm works in 2D space
|
|
114
632
|
// the polygon should be projected on the plane passing through its points.
|
|
115
633
|
const flatPoly = projectPolygon(polygon);
|
|
116
|
-
const triangles =
|
|
634
|
+
const triangles = earcut(flatPoly, 2);
|
|
117
635
|
for (const t of triangles) {
|
|
118
636
|
positions.push(...get3DPoint(polygon, t));
|
|
119
637
|
vertexProperties.push(propertyValue);
|