pavlidise / dynamic-convex-hull-on-2-3-4-tree Goto Github PK View Code? Open in Web Editor NEW 3.0 1.0 0.0 38 KB The dynamic convex hull algorithm by Overmars and van Leeuwen, also including concatenable queue, implemented using a leaf-oriented 2-3-4 tree data structure. License: MIT License C++ 100.00% convex-hull convex-hull-algorithms cpp Introduction ยท People ยท Discuss
Bug in ConvexHull::Delete cpp template<typename Point_2D> inline void ConvexHull<Point_2D>::Delete(Point_2D p) { if (!root) return; else if (root->getIsLeaf()) { DeleteFromLeaf(root, p); } else { DeleteAt(root, p); } } template<typename Point_2D> inline void ConvexHull<Point_2D>::DeleteAt(Point_2D p) DeleteAt takes one argument but called with two.
Vue.js ๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
javascript JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Machine learning Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Facebook We are working to build community through open source technology. NB: members must have two-factor auth.