{"_id":"marching-simplex-table","_rev":"4-efacb4c472798b440f224b05f137c258","name":"marching-simplex-table","description":"Construct the table entries for the marching simplex method","dist-tags":{"latest":"1.0.0"},"versions":{"1.0.0":{"name":"marching-simplex-table","version":"1.0.0","description":"Construct the table entries for the marching simplex method","main":"mstab.js","dependencies":{"convex-hull":"^1.0.3"},"devDependencies":{},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"https://github.com/mikolalysenko/marching-simplex-table.git"},"keywords":["marching","simplex","table","isosurface"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/marching-simplex-table/issues"},"homepage":"https://github.com/mikolalysenko/marching-simplex-table","gitHead":"ba3b68a0e0253b7fdd2dd1ca3fea83dfd35efd60","_id":"marching-simplex-table@1.0.0","_shasum":"bc16256e0f8f9b558aa9b2872f8832d9433f52ea","_from":".","_npmVersion":"2.1.4","_nodeVersion":"0.10.26","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"dist":{"shasum":"bc16256e0f8f9b558aa9b2872f8832d9433f52ea","tarball":"https://registry.npmjs.org/marching-simplex-table/-/marching-simplex-table-1.0.0.tgz","integrity":"sha512-PexXXVF4f5Bux3vGCNlRRBqF/GyTerNo77PbBz8g/MFFXv212b48IGVglj/VfaYBRY6vlFQffa9dFbCCN0+7LA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHH49vAfDh7dWSeHlVvvBHd4fEEhxnkgOaYfFkkaBYBYAiA/wlLDL5n5PiBWqD9bHc2TNpgmbsfZ4sx1lJGWmV2OAQ=="}]}}},"readme":"marching-simplex-table\n======================\nConstructs a look up table for the marching simplex isosurface extraction algorithm.  The entries of this table correspond to the different topologies that can occur for marching simplices.\n\n# Example\n\n```javascript\nvar makeTable = require('marching-simplex-table')\n\nconsole.log(makeTable(2))\nconsole.log(makeTable(3))\n```\n\n# Install\n\n```\nnpm install marching-simplex-table\n```\n\n# API\n\n#### `require('marching-simplex-table')(d)`\nConstructs the marching simplex table for all simplices of dimension `d`.  The result is a table with 2^(d+1) entries, each corresponding to the (d-1) dimensional cells needed to generate the boundary of the simplex.  Each (d-1) cell is coded as an ordered list of edges in the original simplex giving the vertices of the resulting simplex.\n\n* `d` is the dimension of the table to generate\n\n**Returns** A table of simplex topologies\n\n# Credits\n(c) 2014 Mikola Lysenko. MIT License","maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"time":{"modified":"2022-06-19T16:00:35.889Z","created":"2014-11-22T04:44:10.669Z","1.0.0":"2014-11-22T04:44:10.669Z"},"homepage":"https://github.com/mikolalysenko/marching-simplex-table","keywords":["marching","simplex","table","isosurface"],"repository":{"type":"git","url":"https://github.com/mikolalysenko/marching-simplex-table.git"},"author":{"name":"Mikola Lysenko"},"bugs":{"url":"https://github.com/mikolalysenko/marching-simplex-table/issues"},"license":"MIT","readmeFilename":"README.md"}