文件名称：planar-graph-find-intersections
文件大小：4KB
文件格式：ZIP
更新时间：2024-06-19 12:40:44
JavaScript
简单交叉边 找到相交的两个单纯复形中的所有段 安装 npm install each-edge-crossing 用 var find = require ( 'planar-graph-find-edge-crossings' ) ; var apositions = [ [ 0 , 0 ] , [ 0 , 10 ] , [ 10 , 10 ] , [ 10 , 0 ] ] ; var aedges = [ [ 0 , 1 ] , [ 1 , 2 ] , [ 2 , 3 ] , [ 3 , 0 ] ] ; var bpositions = [ [ 5 , 5 ] , [ 5 , 20 ] , [ 20 , 20 ] , [ 20 , 5 ] ] ; var bedges = [ [ 0 , 1 ] , [ 1 , 2 ] , [ 2 , 3 ] , [ 3 , 0 ] ] ; var
【文件预览】：
planar-graph-find-intersections-master
----.gitignore(13B)
----README.md(1KB)
----package.json(179B)
----LICENSE.txt(1KB)
----test.js(2KB)
----planar-graph-find-intersections.js(802B)