songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
90,786 Commits 3 Branches 156 Tags 992 MiB
Commit Graph

90786 Commits

Author SHA1 Message Date
Jackson Campolattaro c32fb24efb Begin implementing depth first traversal 2020-06-25 00:10:44 -04:00
Jackson Campolattaro 0ae7a4f07a Add print method which takes a tree walker as an argument 2020-06-24 21:39:25 -04:00
Jackson Campolattaro 719afe8a35 Add 'Siblings' tree walker method 2020-06-24 21:01:44 -04:00
Jackson Campolattaro 25566d6511 Add method for an octree node to determine what its index is. 2020-06-24 18:01:47 -04:00
Jackson Campolattaro 65d2ceb394 Begin implementing siblings tree walker 2020-06-24 17:18:24 -04:00
Jackson Campolattaro 9315feea2b Switch to std::max when finding the longest side of the bounding box in the constructor 2020-06-24 15:20:47 -04:00
Jackson Campolattaro 35e3ce8097 Remove non-recursive split solution 2020-06-24 14:53:57 -04:00
Jackson Campolattaro 88d82d9728 Add default arguments to recursive split 2020-06-24 14:52:04 -04:00
Jackson Campolattaro 4532d40b83 Rearrange recursive split arguments 2020-06-24 14:44:36 -04:00
Jackson Campolattaro 51ff391d18 Benchmark recursive split 2020-06-24 14:36:56 -04:00
Jackson Campolattaro 76b62fdfe0 Implement recursive split method 2020-06-24 14:27:17 -04:00
Jackson Campolattaro 918f878ad3 Begin defining a recursive split method 2020-06-24 13:23:31 -04:00
Jackson Campolattaro 8a459b2e61 Add a couple of Tree walker algorithms with code outlines 2020-06-24 13:04:42 -04:00
Jackson Campolattaro c322b9e38a Add empty tree-walker criterion file 2020-06-24 12:48:25 -04:00
Jackson Campolattaro 025b712011 Fix error in Split_to_bucket_size 2020-06-24 12:23:45 -04:00
Jackson Campolattaro 69e1afc8c7 Add bucket size split criterion 2020-06-24 10:40:26 -04:00
Jackson Campolattaro a4df98a212 Remove naive partitioning algorithm 2020-06-22 23:05:32 -04:00
Jackson Campolattaro 312dd581b7 Benchmark naive algorithm 2020-06-22 23:04:48 -04:00
Jackson Campolattaro 4954286977 Add naive partitioning algorithm for comparison. 2020-06-22 22:54:09 -04:00
Jackson Campolattaro 883f1bf1e9 Kernel is now deduced from other template parameters 2020-06-22 12:22:55 -04:00
Jackson Campolattaro cdd3ad38ff Replace stop criterion with split criterion 2020-06-20 19:51:16 -04:00
Jackson Campolattaro ed1395d63b Change stop criterion to accept node references 2020-06-20 12:22:00 -04:00
Jackson Campolattaro 7fd6799a60 Run benchmark 2020-06-20 12:02:30 -04:00
Jackson Campolattaro a46b3068f0 Stop criterion now provided in Stop_criterion.h 2020-06-20 12:01:06 -04:00
Jackson Campolattaro 3425f7a216 Add refinement method which takes a stop criterion 2020-06-19 22:58:03 -04:00
Jackson Campolattaro 7997b878c3 Remove recursive refinement method 2020-06-19 21:12:28 -04:00
Jackson Campolattaro baa1fd0f28 Add sequential refinement method 2020-06-19 21:08:37 -04:00
Jackson Campolattaro 99d2e678ff Add criterion.h, where tree building oracle functors will be added 2020-06-19 14:39:09 -04:00
Jackson Campolattaro f7771125a7 Make point iterators contained by nodes private 2020-06-19 11:41:15 -04:00
Jackson Campolattaro 4cf3bf1435 Underscore now denotes older versions of files. 2020-06-18 23:24:09 -04:00
Jackson Campolattaro 3abdeb00e4 Re-run benchmark 2020-06-18 19:09:45 -04:00
Jackson Campolattaro 5caf27fcb7 Add latest benchmark results 2020-06-18 19:03:02 -04:00
Jackson Campolattaro 8dfc913049 Remove member variables used by old refinement method 2020-06-18 18:56:37 -04:00
Jackson Campolattaro 84ef681376 Remove points() accessor 2020-06-18 18:51:44 -04:00
Jackson Campolattaro 88db1e6100 Remove underscores from new refinement functions. 2020-06-18 18:50:59 -04:00
Jackson Campolattaro 02e65fb738 Remove old refinement methods 2020-06-18 18:47:26 -04:00
Jackson Campolattaro 555d42d938 Add benchmark results 2020-06-18 17:30:36 -04:00
Jackson Campolattaro e8eae80bd8 New refinement method produces identical trees to original 2020-06-18 15:57:47 -04:00
Jackson Campolattaro 2dc052784c New refinement method can now produce trees, but doesn't account for points near edges 2020-06-18 14:57:01 -04:00
Jackson Campolattaro d8659c6131 Add new versions of important methods, preceded by underscores 2020-06-18 14:48:26 -04:00
Jackson Campolattaro ec2f269cb3 Add rudimentary function for partitioning the points of a node among its children 2020-06-18 12:30:59 -04:00
Jackson Campolattaro fc1dc85464 Run benchmark to measure effects of tweaks 2020-06-17 16:15:51 -04:00
Jackson Campolattaro 0584d318db Fix test of equality operator 2020-06-17 15:42:08 -04:00
Jackson Campolattaro 5e2498dc60 Change root accessor to return a reference 2020-06-17 15:38:39 -04:00
Jackson Campolattaro cdecee6279 Add recursive check to node equality operator 2020-06-17 15:36:05 -04:00
Jackson Campolattaro 73c0db153c Remove child() accessor, prefer references over pointers 2020-06-17 15:18:40 -04:00
Jackson Campolattaro b6990aa887 Add array index operator for accessing Node children 2020-06-17 15:10:39 -04:00
Jackson Campolattaro d58bb2731a Begin implementing Node equality operator 2020-06-17 15:06:33 -04:00
Jackson Campolattaro db4d0d1a1a Implement miminal Octree equality operator 2020-06-17 14:20:26 -04:00
Jackson Campolattaro 0567fda363 Add empty equality test 2020-06-17 13:42:33 -04:00