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

22 Commits

Author SHA1 Message Date
Sébastien Loriot dffac51a18 restore old behavior with a forward constructor 
drawback: construction with initilization list become ambiguous
 2024-02-29 19:14:04 +01:00
Sven Oesau 75d1519e26 fixed test 2024-02-07 15:18:36 +01:00
JacksonCampolattaro ed32969908 Prefer `using` over `typedef` universally, for consistency 2023-09-08 12:42:20 +02:00
JacksonCampolattaro 039b693b61 Add support for trees with non-cubic bounding boxes 
High-order orthtrees break, because Epick_d::Point is somehow defined as an array
 2023-09-02 17:37:34 +02:00
JacksonCampolattaro fd34fb5302 `root_node_contents` now produces a Bbox directly 
Some tests fail due to non-cubic bounding boxes
 2023-09-02 16:49:32 +02:00
JacksonCampolattaro 59fafe8e3a Fix issues with superfluous Node typedefs 2023-09-01 16:16:30 +02:00
JacksonCampolattaro b08eabae93 Move point-specific functionality to traits class 
(only Point_3 is currently supported)
 2023-06-26 16:59:02 +02:00
JacksonCampolattaro 774aa1f324 Add node-access convenience functions, and simplify tests 2023-06-22 15:24:39 +02:00
JacksonCampolattaro d1ac73d087 Use index-based access for split predicates 2023-06-21 17:34:26 +02:00
JacksonCampolattaro 53b3278d3f root() now returns an index, like parent() and child() 2023-04-25 15:21:02 +02:00
JacksonCampolattaro e7f236678e Replace children() helper with individual child() access 2023-04-25 13:48:21 +02:00
JacksonCampolattaro b9ed5a4221 Relative node access is now done only by index 2023-04-19 19:11:59 +02:00
JacksonCampolattaro 8c12fd3bc7 Implement desired behavior for repeated refinement 2023-04-12 12:10:53 +02:00
JacksonCampolattaro 45244da9e1 Node can no longer directly access its children without the tree 
This is necessary for the next step, but makes the API a pain to use. Some sort of `Node_handle` type is definitely worthwhile.
 2023-03-27 18:12:20 +02:00
JacksonCampolattaro 035db48542 Nodes can't split, unsplit, or copy themselves. 
This ensures allocating and deallocating nodes is strictly the responsibility of the orthtree object.
 2023-03-26 16:50:06 +02:00
JacksonCampolattaro 4f6d249c1f Eliminate heap allocated `Data *m_data` 
This required changing return types to `Node *` in many cases. All unit tests have been updated to account for the new interface.
 2023-03-23 09:58:20 +01:00
Andreas Fabri 2b836ab7ab no need for int D 2022-06-21 17:11:28 +01:00
Andreas Fabri 9a633432ba change order of parameters 2022-06-21 17:05:35 +01:00
Andreas Fabri 329f52175a Orthtree: Fix memory leak in test code 2022-06-21 16:54:27 +01:00
Simon Giraudot b7057e1785 Make Node a const range and fix encapsulation 2021-01-20 10:14:35 +01:00
Simon Giraudot 74b26e1bf2 Fix tests 2020-10-27 13:35:36 +01:00
Simon Giraudot 066712c881 Use Orthtree everywhere + define Octree/Quadtree aliases 2020-10-22 13:00:34 +02:00