{"push_id":1158902138,"size":1,"distinct_size":1,"ref":"refs/heads/Line-Intersection","head":"c2a0343a57323b5bd22760c81bef031fc83f7c54","before":"a87991693b2b814205d7d70ee26c2c0aef452c07","commits":[{"sha":"c2a0343a57323b5bd22760c81bef031fc83f7c54","author":{"name":"Jeff Peterson","email":"c11560307e9a9ce503cb3996c85d3dd5b79a2601@gmail.com"},"message":"First pass at line sweep algorithm\n\nFirst draft of line sweep algorithm (3.1 in my notebook) implemented.\nHas yet to be tested though.\n\nSignificant changes were required for the algorithm to find all\nintersections which means that the worst-case scenario is n^2\nperformance but on average it should perform better than that.","distinct":true,"url":"https://api.github.com/repos/jhpeterson/DXFtoMesh/commits/c2a0343a57323b5bd22760c81bef031fc83f7c54"}]}
{"actor":{"display_login":"jhpeterson"}}