{"_id":"planar-dual","_rev":"10-901a07c459e1903675afdca39b8f768c","name":"planar-dual","description":"Find the faces of a planar graph","dist-tags":{"latest":"1.0.2"},"versions":{"0.0.0":{"name":"planar-dual","version":"0.0.0","description":"Find the faces of a planar graph","main":"loops.js","directories":{"test":"test"},"dependencies":{"compare-angle":"^0.0.1","dup":"^0.0.0"},"devDependencies":{"tape":"~2.12.3"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/planar-dual.git"},"keywords":["planar","graph","dual","faces","geometry"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/planar-dual/issues"},"homepage":"https://github.com/mikolalysenko/planar-dual","_id":"planar-dual@0.0.0","dist":{"shasum":"9706e20cbe3e86f44c53f901d1b2b99f0e507ea8","tarball":"https://registry.npmjs.org/planar-dual/-/planar-dual-0.0.0.tgz","integrity":"sha512-PU/OE+a2WI0VWAiVQMH+tg8lPPKmvl7Etg8xYx6jabCZ2vx5t+iIdUgB84skenQLZAfGsdCN7mFdCc2m53zKfw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIA1Q7tVMJyHe5D/S33jg1hxfdB7dJnvo14PxmbIyWBTzAiAzg34SUYxLfpoOa2AAXKxz78y3U7166YjFnQFMfr6SvA=="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.0":{"name":"planar-dual","version":"1.0.0","description":"Find the faces of a planar graph","main":"loops.js","directories":{"test":"test"},"dependencies":{"compare-angle":"^0.0.1","dup":"^0.0.0"},"devDependencies":{"tape":"~2.12.3","random-permutation":"0.0.0","dup":"0.0.0","invert-permutation":"^0.1.0","shuffle-array":"0.0.0"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/planar-dual.git"},"keywords":["planar","graph","dual","faces","geometry"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/planar-dual/issues"},"homepage":"https://github.com/mikolalysenko/planar-dual","_id":"planar-dual@1.0.0","dist":{"shasum":"79538757ca9d5bdbcd3692eca6a3016c82f8dfe5","tarball":"https://registry.npmjs.org/planar-dual/-/planar-dual-1.0.0.tgz","integrity":"sha512-1hnQMh5kuM1J84zPRrWzkB+/LGHIsQHeaGrrDoc1V7EEMnoZZrf6ic9uClsw+k1HpHWHjze2qT8zLfsnRac8AQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBtpdEA+IWYMUPWYZujtc7UkLGK3UjiuoLaaNT2N2V+ZAiEAi7P67uemZ/rEz0LcXzu9zAUFSB+u3XFVngpgUbBCQ4k="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.1":{"name":"planar-dual","version":"1.0.1","description":"Find the faces of a planar graph","main":"loops.js","directories":{"test":"test"},"dependencies":{"compare-angle":"^1.0.0","dup":"^0.0.0"},"devDependencies":{"tape":"~2.12.3","random-permutation":"0.0.0","dup":"0.0.0","invert-permutation":"^0.1.0","shuffle-array":"0.0.0"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/planar-dual.git"},"keywords":["planar","graph","dual","faces","geometry"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/planar-dual/issues"},"homepage":"https://github.com/mikolalysenko/planar-dual","_id":"planar-dual@1.0.1","dist":{"shasum":"95b3a19f3f6c2b04f63adf8d94823760f6d49aa5","tarball":"https://registry.npmjs.org/planar-dual/-/planar-dual-1.0.1.tgz","integrity":"sha512-BGu0i3gsjoRyhzqeN4GV9eEPzYUrS7mPTJ/N7UkuFEXV3HPtnwCPYOJim16lP4/GIldIb3tt8VI4M6f5NwyKGw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCVN5xqRqptdpfhheG2y0W9MMxEKtazidzDtLAxM8Z9QwIgJsyPUDqNhmYEdLuJ13zh3jMMGhsSyUUur6JbFNEEpDU="}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]},"1.0.2":{"name":"planar-dual","version":"1.0.2","description":"Find the faces of a planar graph","main":"loops.js","directories":{"test":"test"},"dependencies":{"compare-angle":"^1.0.0","dup":"^1.0.0"},"devDependencies":{"tape":"~2.12.3","random-permutation":"0.0.0","dup":"0.0.0","invert-permutation":"^0.1.0","shuffle-array":"0.0.0"},"scripts":{"test":"tape test/*.js"},"repository":{"type":"git","url":"git://github.com/mikolalysenko/planar-dual.git"},"keywords":["planar","graph","dual","faces","geometry"],"author":{"name":"Mikola Lysenko"},"license":"MIT","bugs":{"url":"https://github.com/mikolalysenko/planar-dual/issues"},"homepage":"https://github.com/mikolalysenko/planar-dual","_id":"planar-dual@1.0.2","dist":{"shasum":"b6a4235523b1b0cb79e5f926f8ea335dd982d563","tarball":"https://registry.npmjs.org/planar-dual/-/planar-dual-1.0.2.tgz","integrity":"sha512-jfQCbX1kXu53+enC+BPQlfoZI1u5m8IUhFVtFG+9tUj84wnuaYNheR69avYWCNXWnUCkwUajmYMqX9M2Ruh4ug==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDBiZnSm54Wn/5iD57a7RBS2AemBP8UHcukPssGHiG61gIhAJ5k8lkBx+eobsp5Bg7n4K1Y3z8JErMRpAcUIH6qcAME"}]},"_from":".","_npmVersion":"1.4.3","_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}]}},"readme":"planar-dual\n===========\nGiven a planar embedding of a graph, find all faces.\n\n# Example\n\n```javascript\nvar getFaces = require(\"planar-dual\")\n\n//Create a triforce\nvar positions = [\n  [0, 0],\n  [-1, -1],\n  [0, 1],\n  [1, -1]\n]\nvar edges = [\n  [1, 2],\n  [2, 3],\n  [3, 1],\n  [0, 1],\n  [0, 2],\n  [0, 3]\n]\n\n//Compute dual graph\nconsole.log(getFaces(edges, positions))\n```\n\nOutput:\n\n```javascript\n[ [ 0, 1, 2 ], [ 0, 2, 3 ], [ 0, 3, 1 ], [ 1, 3, 2 ] ]\n```\n\n# Install\n\n```\nnpm install planar-dual\n```\n\n# API\n\n#### `require(\"planar-dual\")(edges, positions)`\nSplits an embedded planar graph into a collection of faces\n\n* `edges` are the edges of the graph\n* `positions` are the locations of the vertices of the graph\n\n**Returns** A list of faces of the graph represented as ordered lists of vertices\n\n# Credits\n(c) 2014 Mikola Lysenko. MIT License","maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"time":{"modified":"2022-06-24T02:27:49.939Z","created":"2014-04-21T02:21:29.860Z","0.0.0":"2014-04-21T02:21:29.860Z","1.0.0":"2014-04-22T18:16:41.133Z","1.0.1":"2014-04-28T22:42:16.583Z","1.0.2":"2014-04-29T14:06:07.760Z"},"homepage":"https://github.com/mikolalysenko/planar-dual","keywords":["planar","graph","dual","faces","geometry"],"repository":{"type":"git","url":"git://github.com/mikolalysenko/planar-dual.git"},"author":{"name":"Mikola Lysenko"},"bugs":{"url":"https://github.com/mikolalysenko/planar-dual/issues"},"license":"MIT","readmeFilename":"README.md"}