{"action":"created","issue":{"url":"https://api.github.com/repos/d3/d3-delaunay/issues/34","repository_url":"https://api.github.com/repos/d3/d3-delaunay","labels_url":"https://api.github.com/repos/d3/d3-delaunay/issues/34/labels{/name}","comments_url":"https://api.github.com/repos/d3/d3-delaunay/issues/34/comments","events_url":"https://api.github.com/repos/d3/d3-delaunay/issues/34/events","html_url":"https://github.com/d3/d3-delaunay/issues/34","id":308385084,"node_id":"MDU6SXNzdWUzMDgzODUwODQ=","number":34,"title":"voronoi.index of triangle vertexes?","user":{"login":"mbostock","id":230541,"node_id":"MDQ6VXNlcjIzMDU0MQ==","avatar_url":"https://avatars2.githubusercontent.com/u/230541?v=4","gravatar_id":"","url":"https://api.github.com/users/mbostock","html_url":"https://github.com/mbostock","followers_url":"https://api.github.com/users/mbostock/followers","following_url":"https://api.github.com/users/mbostock/following{/other_user}","gists_url":"https://api.github.com/users/mbostock/gists{/gist_id}","starred_url":"https://api.github.com/users/mbostock/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/mbostock/subscriptions","organizations_url":"https://api.github.com/users/mbostock/orgs","repos_url":"https://api.github.com/users/mbostock/repos","events_url":"https://api.github.com/users/mbostock/events{/privacy}","received_events_url":"https://api.github.com/users/mbostock/received_events","type":"User","site_admin":false},"labels":[{"id":801896454,"node_id":"MDU6TGFiZWw4MDE4OTY0NTQ=","url":"https://api.github.com/repos/d3/d3-delaunay/labels/enhancement","name":"enhancement","color":"84b6eb","default":true}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-03-25T20:59:05Z","updated_at":"2018-06-29T18:24:01Z","closed_at":null,"author_association":"MEMBER","body":"What if voronoi.index pointed to the first triangle vertex for a given cell, and then we used the halfedge traversal algorithm lazily? Then we wouldn’t need to precompute voronoi.edges."},"comment":{"url":"https://api.github.com/repos/d3/d3-delaunay/issues/comments/401435475","html_url":"https://github.com/d3/d3-delaunay/issues/34#issuecomment-401435475","issue_url":"https://api.github.com/repos/d3/d3-delaunay/issues/34","id":401435475,"node_id":"MDEyOklzc3VlQ29tbWVudDQwMTQzNTQ3NQ==","user":{"login":"redblobgames","id":8757369,"node_id":"MDQ6VXNlcjg3NTczNjk=","avatar_url":"https://avatars0.githubusercontent.com/u/8757369?v=4","gravatar_id":"","url":"https://api.github.com/users/redblobgames","html_url":"https://github.com/redblobgames","followers_url":"https://api.github.com/users/redblobgames/followers","following_url":"https://api.github.com/users/redblobgames/following{/other_user}","gists_url":"https://api.github.com/users/redblobgames/gists{/gist_id}","starred_url":"https://api.github.com/users/redblobgames/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/redblobgames/subscriptions","organizations_url":"https://api.github.com/users/redblobgames/orgs","repos_url":"https://api.github.com/users/redblobgames/repos","events_url":"https://api.github.com/users/redblobgames/events{/privacy}","received_events_url":"https://api.github.com/users/redblobgames/received_events","type":"User","site_admin":false},"created_at":"2018-06-29T18:24:01Z","updated_at":"2018-06-29T18:24:01Z","author_association":"NONE","body":"This is what I do, except I point to the first(*) halfedge. From the halfedge I can get the triangle vertex but I can also traverse in other fun ways.\r\n\r\n(*) I've simplified a bit more by adding “ghost” triangles around the convex hull. These link to an “infinity” site. With the ghost elements, halfedges[e] is never -1, which simplifies some of the traversal logic. In exchange, whenever drawing I need to test for ghosts, but overall it's been a big win for my projects.\r\n"}}
{"actor":{"display_login":"redblobgames"}}