import java.io.*;
import java.nio.*;
import javax.script.*;
public class CHull
{
static String[][] mat2X ={{"0.064", "0.056", "0.043", "0.052", "0.063", "0.096", "0.101", "0.096", "0.09", "0.09", "0.093" },
{"0.01", "0.008", "0.003", "0.005", "0.025", "0.051", "0.055", "0.057", "0.063", "0.068", "0.064" }};
public static String toJavascriptArray(String[][] arr)
{
StringBuffer sb = new StringBuffer();
sb.append("[");
for(int i=0; i<arr[0].length; i++){
sb.append("[").append(arr[0][i]).append(",");
sb.append(arr[1][i]).append("]");
if(!(i==arr[0].length-1)){
sb.append(",");
}
}
sb.append("]");
return sb.toString();
}
public static void main(String[] args) throws Exception
{
System.out.println("array "+toJavascriptArray(mat2X));
ScriptEngine engine = new ScriptEngineManager().getEngineByName("nashorn");
// TEST
StringWriter sw=new StringWriter();
engine.getContext().setWriter(sw);
engine.eval("var global = this;");
engine.eval("!function(e){\n" +
" if(\"object\"==typeof exports&&\"undefined\"!=typeof module)module.exports=e();\n" +
" else if(\"function\"==typeof define&&define.amd)\n" +
" {\n" +
" print('define[] called');\n" +
" define([],e);\n" +
" }\n" +
" else{\n" +
" print('else branch');\n" +
" var f;\"undefined\"!=typeof window?f=window:\"undefined\"!=typeof global?f=global:\"undefined\"!=typeof self&&(f=self),f.hull=e()\n" +
" }\n" +
" }\n" +
"(function(){\n" +
" var define,module,exports;return (function e(t,n,r){\n" +
" function s(o,u){if(!n[o]){if(!t[o]){\n" +
" var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);\n" +
" if(i)\n" +
" return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");\n" +
" throw f.code=\"MODULE_NOT_FOUND\",f\n" +
" }\n" +
" var l=n[o]={\n" +
" exports:{\n" +
" }\n" +
" };\n" +
" t[o][0].call(l.exports,function(e){\n" +
" var n=t[o][1][e];return s(n?n:e)\n" +
" },l,l.exports,e,t,n,r)\n" +
" }\n" +
" return n[o].exports}var i=typeof require==\"function\"&&require;\n" +
" for(var o=0;o<r.length;o++)s(r[o]);\n" +
" return s\n" +
" }\n" +
" )({\n" +
" 1:[function(require,module,exports){\n" +
"\n" +
"function Grid(points) {\n" +
" var _cells = [];\n" +
"\n" +
" points.forEach(function(point) {\n" +
" var cellXY = this.point2CellXY(point),\n" +
" x = cellXY[0],\n" +
" y = cellXY[1];\n" +
" if (_cells[x] === undefined) {\n" +
" _cells[x] = [];\n" +
" }\n" +
" if (_cells[x][y] === undefined) {\n" +
" _cells[x][y] = [];\n" +
" }\n" +
" _cells[x][y].push(point);\n" +
" }, this);\n" +
"\n" +
" this.cellPoints = function(x, y) { // (Number, Number) -> Array\n" +
" return (_cells[x] !== undefined && _cells[x][y] !== undefined) ? _cells[x][y] : [];\n" +
" };\n" +
"\n" +
" this.removePoint = function(point) { // (Array) -> Array\n" +
" var cellXY = this.point2CellXY(point),\n" +
" cell = _cells[cellXY[0]][cellXY[1]],\n" +
" pointIdxInCell;\n" +
" \n" +
" for (var i = 0; i < cell.length; i++) {\n" +
" if (cell[i][0] === point[0] && cell[i][1] === point[1]) {\n" +
" pointIdxInCell = i;\n" +
" break;\n" +
" }\n" +
" }\n" +
"\n" +
" cell.splice(pointIdxInCell, 1);\n" +
"\n" +
" return cell;\n" +
" };\n" +
"}\n" +
"\n" +
"Grid.prototype = {\n" +
" point2CellXY: function(point) { // (Array) -> Array\n" +
" var x = parseInt(point[0] / Grid.CELL_SIZE),\n" +
" y = parseInt(point[1] / Grid.CELL_SIZE);\n" +
" return [x, y];\n" +
" },\n" +
"\n" +
" rangePoints: function(bbox) { // (Array) -> Array\n" +
" var tlCellXY = this.point2CellXY([bbox[0], bbox[1]]),\n" +
" brCellXY = this.point2CellXY([bbox[2], bbox[3]]),\n" +
" points = [];\n" +
"\n" +
" for (var x = tlCellXY[0]; x <= brCellXY[0]; x++) {\n" +
" for (var y = tlCellXY[1]; y <= brCellXY[1]; y++) {\n" +
" points = points.concat(this.cellPoints(x, y));\n" +
" }\n" +
" }\n" +
"\n" +
" return points;\n" +
" },\n" +
"\n" +
" addBorder2Bbox: function(bbox, border) { // (Array, Number) -> Array\n" +
" return [\n" +
" bbox[0] - (border * Grid.CELL_SIZE),\n" +
" bbox[1] - (border * Grid.CELL_SIZE),\n" +
" bbox[2] + (border * Grid.CELL_SIZE),\n" +
" bbox[3] + (border * Grid.CELL_SIZE)\n" +
" ];\n" +
" }\n" +
"};\n" +
"\n" +
"function grid(points) {\n" +
" return new Grid(points);\n" +
"}\n" +
"\n" +
"Grid.CELL_SIZE = 10;\n" +
"\n" +
"module.exports = grid;\n" +
"},{}],2:[function(require,module,exports){\n" +
"/*\n" +
" (c) 2014-2015, Andrii Heonia\n" +
" Hull.js, a JavaScript library for concave hull generation by set of points.\n" +
" https://github.com/AndriiHeonia/hull\n" +
"*/\n" +
"\n" +
"'use strict';\n" +
"\n" +
"var intersect = require('./intersect.js');\n" +
"var grid = require('./grid.js');\n" +
"\n" +
"function _formatToXy(pointset, format) {\n" +
" if (format === undefined) {\n" +
" print('_formatToXy() - format undefined, return the pointset');\n" +
" return pointset;\n" +
" }\n" +
" print('Format is defined, keep going');\n" +
" return pointset.map(function(pt) {\n" +
" /*jslint evil: true */\n" +
" print('_formatToXy check#1');\n" +
" var _getXY = new Function('pt', 'return [pt' + format[0] + ',' + 'pt' + format[1] + '];');\n" +
" print('_formatToXy check#2');\n" +
" return _getXY(pt);\n" +
" });\n" +
"}\n" +
"\n" +
"function _xyToFormat(pointset, format) {\n" +
" if (format === undefined) {\n" +
" return pointset;\n" +
" }\n" +
" return pointset.map(function(pt) {\n" +
" /*jslint evil: true */\n" +
" var _getObj = new Function('pt', 'var o = {}; o' + format[0] + '= pt[0]; o' + format[1] + '= pt[1]; return o;');\n" +
" return _getObj(pt);\n" +
" });\n" +
"}\n" +
"\n" +
"function _sortByX(pointset) {\n" +
" return pointset.sort(function(a, b) {\n" +
" if (a[0] == b[0]) {\n" +
" return a[1] - b[1]; \n" +
" } else { \n" +
" return a[0] - b[0]; \n" +
" }\n" +
" });\n" +
"}\n" +
"\n" +
"function _getMaxY(pointset) {\n" +
" var maxY = -Infinity;\n" +
" for (var i = pointset.length - 1; i >= 0; i--) {\n" +
" if (pointset[i][1] > maxY) {\n" +
" maxY = pointset[i][1];\n" +
" }\n" +
" }\n" +
" return maxY;\n" +
"}\n" +
"\n" +
"function _upperTangent(pointset) {\n" +
" var lower = [];\n" +
" for (var l = 0; l < pointset.length; l++) {\n" +
" while (lower.length >= 2 && (_cross(lower[lower.length - 2], lower[lower.length - 1], pointset[l]) <= 0)) {\n" +
" lower.pop();\n" +
" }\n" +
" lower.push(pointset[l]);\n" +
" }\n" +
" lower.pop();\n" +
" return lower;\n" +
"}\n" +
"\n" +
"function _lowerTangent(pointset) {\n" +
" print('lowerTangent() called with pointset=' + pointset);\n" +
" var reversed = pointset.reverse(),\n" +
" upper = [];\n" +
" for (var u = 0; u < reversed.length; u++) {\n" +
" while (upper.length >= 2 && (_cross(upper[upper.length - 2], upper[upper.length - 1], reversed[u]) <= 0)) {\n" +
" upper.pop();\n" +
" }\n" +
" upper.push(reversed[u]);\n" +
" }\n" +
" upper.pop();\n" +
" return upper;\n" +
"}\n" +
"\n" +
"function _cross(o, a, b) {\n" +
" return (a[0] - o[0]) * (b[1] - o[1]) - (a[1] - o[1]) * (b[0] - o[0]); \n" +
"}\n" +
"\n" +
"function _sqLength(a, b) {\n" +
" return Math.pow(b[0] - a[0], 2) + Math.pow(b[1] - a[1], 2);\n" +
"}\n" +
"\n" +
"function _cos(o, a, b) {\n" +
" var aShifted = [a[0] - o[0], a[1] - o[1]],\n" +
" bShifted = [b[0] - o[0], b[1] - o[1]],\n" +
" sqALen = _sqLength(o, a),\n" +
" sqBLen = _sqLength(o, b),\n" +
" dot = aShifted[0] * bShifted[0] + aShifted[1] * bShifted[1];\n" +
"\n" +
" return dot / Math.sqrt(sqALen * sqBLen);\n" +
"}\n" +
"\n" +
"function _intersect(segment, pointset) {\n" +
" for (var i = 0; i < pointset.length - 1; i++) {\n" +
" var seg = [pointset[i], pointset[i + 1]];\n" +
" if (segment[0][0] === seg[0][0] && segment[0][1] === seg[0][1] ||\n" +
" segment[0][0] === seg[1][0] && segment[0][1] === seg[1][1]) {\n" +
" continue;\n" +
" }\n" +
" if (intersect(segment, seg)) {\n" +
" return true;\n" +
" }\n" +
" }\n" +
" return false;\n" +
"}\n" +
"\n" +
"function _bBoxAround(edge, boxSize) {\n" +
" var minX, maxX, minY, maxY;\n" +
"\n" +
" if (edge[0][0] < edge[1][0]) {\n" +
" minX = edge[0][0] - boxSize;\n" +
" maxX = edge[1][0] + boxSize;\n" +
" } else {\n" +
" minX = edge[1][0] - boxSize;\n" +
" maxX = edge[0][0] + boxSize;\n" +
" }\n" +
"\n" +
" if (edge[0][1] < edge[1][1]) {\n" +
" minY = edge[0][1] - boxSize;\n" +
" maxY = edge[1][1] + boxSize;\n" +
" } else {\n" +
" minY = edge[1][1] - boxSize;\n" +
" maxY = edge[0][1] + boxSize;\n" +
" }\n" +
"\n" +
" return [\n" +
" minX, minY, // tl\n" +
" maxX, maxY // br\n" +
" ];\n" +
"}\n" +
"\n" +
"function _midPoint(edge, innerPoints, convex) {\n" +
" var point = null,\n" +
" angle1Cos = MAX_CONCAVE_ANGLE_COS,\n" +
" angle2Cos = MAX_CONCAVE_ANGLE_COS,\n" +
" a1Cos, a2Cos;\n" +
"\n" +
" for (var i = 0; i < innerPoints.length; i++) {\n" +
" a1Cos = _cos(edge[0], edge[1], innerPoints[i]);\n" +
" a2Cos = _cos(edge[1], edge[0], innerPoints[i]);\n" +
"\n" +
" if (a1Cos > angle1Cos && a2Cos > angle2Cos &&\n" +
" !_intersect([edge[0], innerPoints[i]], convex) &&\n" +
" !_intersect([edge[1], innerPoints[i]], convex)) {\n" +
"\n" +
" angle1Cos = a1Cos;\n" +
" angle2Cos = a2Cos;\n" +
" point = innerPoints[i];\n" +
" }\n" +
" }\n" +
"\n" +
" return point;\n" +
"}\n" +
"\n" +
"function _concave(convex, maxSqEdgeLen, maxSearchBBoxSize, grid) {\n" +
" var edge,\n" +
" border,\n" +
" bBoxSize,\n" +
" midPoint,\n" +
" bBoxAround, \n" +
" midPointInserted = false;\n" +
"\n" +
" for (var i = 0; i < convex.length - 1; i++) {\n" +
" edge = [convex[i], convex[i + 1]];\n" +
"\n" +
" if (_sqLength(edge[0], edge[1]) < maxSqEdgeLen) { continue; }\n" +
"\n" +
" border = 0;\n" +
" bBoxSize = MIN_SEARCH_BBOX_SIZE;\n" +
" bBoxAround = _bBoxAround(edge, bBoxSize);\n" +
" do {\n" +
" bBoxAround = grid.addBorder2Bbox(bBoxAround, border);\n" +
" bBoxSize = bBoxAround[2] - bBoxAround[0];\n" +
" midPoint = _midPoint(edge, grid.rangePoints(bBoxAround), convex); \n" +
" border++;\n" +
" } while (midPoint === null && maxSearchBBoxSize > bBoxSize);\n" +
"\n" +
" if (midPoint !== null) {\n" +
" convex.splice(i + 1, 0, midPoint);\n" +
" grid.removePoint(midPoint);\n" +
" midPointInserted = true;\n" +
" }\n" +
" }\n" +
"\n" +
" if (midPointInserted) {\n" +
" return _concave(convex, maxSqEdgeLen, maxSearchBBoxSize, grid);\n" +
" }\n" +
"\n" +
" return convex;\n" +
"}\n" +
"\n" +
"function hull(pointset, concavity, format) {\n" +
" print('Ho chiamato la funzione hull()');\n" +
" print('pointset = ' + pointset);\n" +
" print('concavity = ' + concavity);\n" +
" print('format = ' + format);\n" +
" var lower, upper, convex,\n" +
" innerPoints,\n" +
" maxSearchBBoxSize,\n" +
" maxEdgeLen = concavity || 20;\n" +
"\n" +
" if (pointset.length < 4) {\n" +
" print('Point set length is ' + pointset.length + ' that is < 4; therefore I return it');\n" +
" print('here the pointset:');\n" +
" for (var i = 0; i < pointset.length; i++)\n" +
" print('pointset[' + i + '] = (' + pointset[i][0] + ', ' + pointset[i][1] + ')');\n" +
" return pointset;\n" +
" }\n" +
"\n" +
" print('Sort the pointset by X');\n" +
" pointset = _sortByX(_formatToXy(pointset, format));\n" +
" upper = _upperTangent(pointset);\n" +
" lower = _lowerTangent(pointset);\n" +
" convex = lower.concat(upper);\n" +
" convex.push(pointset[0]);\n" +
"\n" +
" maxSearchBBoxSize = Math.max(pointset[pointset.length - 1][0], _getMaxY(convex)) * MAX_SEARCH_BBOX_SIZE_PERCENT;\n" +
" innerPoints = pointset.filter(function(pt) {\n" +
" return convex.indexOf(pt) < 0;\n" +
" });\n" +
" \n" +
" return _xyToFormat(_concave(convex, Math.pow(maxEdgeLen, 2), maxSearchBBoxSize, grid(innerPoints)), format);\n" +
"}\n" +
"\n" +
"var MAX_CONCAVE_ANGLE_COS = Math.cos(90 / (180 / Math.PI)); // angle = 90 deg\n" +
"var MIN_SEARCH_BBOX_SIZE = 5;\n" +
"var MAX_SEARCH_BBOX_SIZE_PERCENT = 0.8;\n" +
"\n" +
"module.exports = hull;\n" +
"},{\"./grid.js\":1,\"./intersect.js\":3}],3:[function(require,module,exports){\n" +
"function ccw(x1, y1, x2, y2, x3, y3) { \n" +
" var cw = ((y3 - y1) * (x2 - x1)) - ((y2 - y1) * (x3 - x1));\n" +
" return cw > 0 ? true : cw < 0 ? false : true; // colinear\n" +
"}\n" +
"\n" +
"function intersect(seg1, seg2) {\n" +
" var x1 = seg1[0][0], y1 = seg1[0][1],\n" +
" x2 = seg1[1][0], y2 = seg1[1][1],\n" +
" x3 = seg2[0][0], y3 = seg2[0][1],\n" +
" x4 = seg2[1][0], y4 = seg2[1][1];\n" +
" return ccw(x1, y1, x3, y3, x4, y4) !== ccw(x2, y2, x3, y3, x4, y4) && ccw(x1, y1, x2, y2, x3, y3) !== ccw(x1, y1, x2, y2, x4, y4);\n" +
"}\n" +
"\n" +
"module.exports = intersect;\n" +
"},{}]},{},[2])(2)\n" +
"})");
Invocable jsInvoke = (Invocable) engine;
Object[] result = (Object[]) jsInvoke.invokeFunction("hull", new Object[][] {
{ 0.441, 0.436, 0.386, 0.389, 0.389, 0.386, 0.386, 0.386, 0.386, 0.383, 0.377, 0.377, 0.377, 0.368, 0.278, 0.26, 0.258, 0.258, 0.257,
0.231, 0.229, 0.226, 0.215, 0.122, 0.114, 0.102, 0.102, 0.093, 0.003, 0.01, 0.064, 0.146, 0.213, 0.228, 0.268, 0.28,
0.345, 0.373, 0.377, 0.378, 0.38, 0.381, 0.383, 0.422, 0.441},
{ 0.229, 0.237, 0.308, 0.273, 0.269, 0.264, 0.252, 0.251, 0.249, 0.244, 0.239, 0.207, 0.204, 0.199, 0.168, 0.154, 0.153, 0.144,
0.128, 0.119, 0.111, 0.105, 0.1, 0.088, 0.087, 0.075, 0.067, 0.049, 0.02, 0.01, -0.026, 0, 0.005, 0.001, 0.081, 0.093,
0.163, 0.16, 0.159, 0.159, 0.159, 0.159, 0.159, 0.199, 0.229}}, 0.50);
System.out.println("Captured output:\n"+sw);
// Output Dati
for(Object obj : result) {
Object[] points = (Object[]) obj;
for(Object d : points) System.out.print(d + "; ");
System.out.println();
}
// Devo Ottenere in outPut questi valori:
// 0.441,0.229,0.436,0.237,0.386,0.308,0.003,0.02,0.01,0.01,0.064,-0.026,0.228,0.001,0.383,0.159,0.422,0.199,0.441,0.229
}
}
Questo e' il tuo codice con l'output da me modificato.
Non c'e' la correzione, ma a questo punto te la dico: quando passi l'array alla hull, fai cosi:
Object[] result = (Object[]) jsInvoke.invokeFunction("hull", new Object[][] {
{ 0.441, 0.436, 0.386, 0.389, 0.389, 0.386, 0.386, 0.386, 0.386, 0.383, 0.377, 0.377, 0.377, 0.368, 0.278, 0.26, 0.258, 0.258, 0.257,
0.231, 0.229, 0.226, 0.215, 0.122, 0.114, 0.102, 0.102, 0.093, 0.003, 0.01, 0.064, 0.146, 0.213, 0.228, 0.268, 0.28,
0.345, 0.373, 0.377, 0.378, 0.38, 0.381, 0.383, 0.422, 0.441},
{ 0.229, 0.237, 0.308, 0.273, 0.269, 0.264, 0.252, 0.251, 0.249, 0.244, 0.239, 0.207, 0.204, 0.199, 0.168, 0.154, 0.153, 0.144,
0.128, 0.119, 0.111, 0.105, 0.1, 0.088, 0.087, 0.075, 0.067, 0.049, 0.02, 0.01, -0.026, 0, 0.005, 0.001, 0.081, 0.093,
0.163, 0.16, 0.159, 0.159, 0.159, 0.159, 0.159, 0.199, 0.229}}, 0.50);
quindi crei un array di soli 2 (DUE) punti, n-dimensionali.
Devi fare il contrario, avere un array di n punti con due dimensioni (x,y).
Nel tuo array apparentemente hai messo le X nella prima dimensione e le Y nella seconda. Ecco, cambia quell'array di oggetti.
Si tratta di Java, non Javascript!!!