Share一个格式化缩进JavaScript的在线工具

IE报Javascript出错了, 第二行, 第六万多个character的位置出错. 打开JavaScript一看, 都挤在一起, 难以辨认. 于是找到了这个工具.

 

工具地址:

Javascript unpacker and beautifier

http://jsbeautifier.org/

 

在IE8中测试通过, 效果非常好. 如果JavaScript脚本非常大, 会遇到如下的弹框. 连续地选择No, 即可.

image

 

运行之前

image

 

运行之后

image

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,以下是使用 JavaScript 实现 Delaunay 算法的代码: ```javascript function Triangle(v1, v2, v3) { this.v1 = v1; this.v2 = v2; this.v3 = v3; } function Edge(v1, v2) { this.v1 = v1; this.v2 = v2; } function delaunay(points) { var triangles = []; // Create a super triangle that covers all the points var superTriangle = new Triangle( { x: -Number.MAX_VALUE, y: -Number.MAX_VALUE }, { x: 0, y: Number.MAX_VALUE }, { x: Number.MAX_VALUE, y: -Number.MAX_VALUE } ); triangles.push(superTriangle); // Add each point to the Delaunay triangulation for (var i = 0; i < points.length; i++) { var edges = []; // Find all the edges of the triangles that intersect with the new point for (var j = 0; j < triangles.length; j++) { var t = triangles[j]; if (circumCircleContains(t, points[i])) { edges.push(new Edge(t.v1, t.v2)); edges.push(new Edge(t.v2, t.v3)); edges.push(new Edge(t.v3, t.v1)); triangles.splice(j, 1); j--; } } // Remove duplicate edges for (var j = 0; j < edges.length; j++) { for (var k = j + 1; k < edges.length; k++) { if ( (edges[j].v1 == edges[k].v1 && edges[j].v2 == edges[k].v2) || (edges[j].v1 == edges[k].v2 && edges[j].v2 == edges[k].v1) ) { edges.splice(k, 1); k--; edges.splice(j, 1); j--; break; } } } // Create new triangles using the new point for (var j = 0; j < edges.length; j++) { triangles.push(new Triangle(edges[j].v1, edges[j].v2, points[i])); } } // Remove any triangles that share vertices with the super triangle for (var i = 0; i < triangles.length; i++) { var t = triangles[i]; if (t.v1 == superTriangle.v1 || t.v1 == superTriangle.v2 || t.v1 == superTriangle.v3 || t.v2 == superTriangle.v1 || t.v2 == superTriangle.v2 || t.v2 == superTriangle.v3 || t.v3 == superTriangle.v1 || t.v3 == superTriangle.v2 || t.v3 == superTriangle.v3) { triangles.splice(i, 1); i--; } } return triangles; } function circumCircleContains(triangle, point) { // Calculate the circumcircle of the triangle var deltaA = triangle.v1.x * triangle.v1.x + triangle.v1.y * triangle.v1.y; var deltaB = triangle.v2.x * triangle.v2.x + triangle.v2.y * triangle.v2.y; var deltaC = triangle.v3.x * triangle.v3.x + triangle.v3.y * triangle.v3.y; var axb = triangle.v1.x * (triangle.v2.y - triangle.v3.y) + triangle.v2.x * (triangle.v3.y - triangle.v1.y) + triangle.v3.x * (triangle.v1.y - triangle.v2.y); var center = { x: ((deltaA * (triangle.v2.y - triangle.v3.y) + deltaB * (triangle.v3.y - triangle.v1.y) + deltaC * (triangle.v1.y - triangle.v2.y)) / (2 * axb)), y: ((deltaA * (triangle.v3.x - triangle.v2.x) + deltaB * (triangle.v1.x - triangle.v3.x) + deltaC * (triangle.v2.x - triangle.v1.x)) / (2 * axb)) }; var radius = Math.sqrt(Math.pow(center.x - triangle.v1.x, 2) + Math.pow(center.y - triangle.v1.y, 2)); // Check if the point is inside the circumcircle var deltaPoint = point.x * point.x + point.y * point.y; return deltaPoint <= Math.pow(radius, 2); } ``` 这段代码实现了基本的 Delaunay 三角剖分算法,可以将给定的一系列点(Point)进行三角剖分并得到对应的三角形(Triangle)列表。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值