Andreas Fabri
|
495ce7a8df
|
Add template for LCC template member functions
|
2024-05-15 16:35:08 +02:00 |
Sven Oesau
|
2b254121fe
|
merging LCC creation, point on face projection for reconstruction and fixed t-functions
|
2023-11-08 13:54:41 +01:00 |
Sven Oesau
|
b26e22bca8
|
Merge remote-tracking branch 'remotes/orth/orthtree-generalization' into Kinetic_shape_reconstruction-new_package-soesau
|
2023-11-08 08:58:25 +01:00 |
Sven Oesau
|
696fb83399
|
moving new property system into CGAL::Experimental namespace
fixing msvc compiling issues
|
2023-11-07 15:01:37 +01:00 |
Sven Oesau
|
06904b51e5
|
doc fix
[skip CI]
|
2023-10-02 10:11:59 +02:00 |
JacksonCampolattaro
|
047a9494bd
|
Fix mismatched parameter names in documentation
|
2023-09-30 09:24:20 +02:00 |
JacksonCampolattaro
|
6f86c932c8
|
Update function documentation for consistency
|
2023-09-27 21:13:46 +02:00 |
JacksonCampolattaro
|
4c6084159a
|
Add boost::span to STL_Extension for compatibility with older versions of Boost
|
2023-09-24 14:25:47 +02:00 |
JacksonCampolattaro
|
38c35d83c7
|
Update orthtree documentation and manual
|
2023-09-24 13:56:01 +02:00 |
Sébastien Loriot
|
33dce33e0b
|
fix some doc issues
|
2023-09-14 09:58:04 +02:00 |
JacksonCampolattaro
|
c4e6ad77f7
|
Update documentation for Orthtree member functions.
|
2023-09-13 09:19:33 +02:00 |
JacksonCampolattaro
|
ed32969908
|
Prefer `using` over `typedef` universally, for consistency
|
2023-09-08 12:42:20 +02:00 |
JacksonCampolattaro
|
3e20800b7f
|
Update documentation for Traits concepts
|
2023-09-08 12:13:27 +02:00 |
JacksonCampolattaro
|
32c6d61f27
|
Eliminate Array and Construct_point_d_from_array
|
2023-09-07 11:44:14 +02:00 |
JacksonCampolattaro
|
bf5bbcc0f1
|
Add `construct_point_d_object` to traits classes
Not yet documented by the OrthtreeTraits concept. Will replace construct_point_d_from_array.
|
2023-09-06 14:23:47 +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
|
51aae3a6a8
|
Bbox construction functor is no longer necessary; Bbox_d type must be constructible from a pair of points
|
2023-09-02 15:19:07 +02:00 |
JacksonCampolattaro
|
40b2c0dff0
|
Convert nearest neighbor methods to free functions
|
2023-09-01 17:16:54 +02:00 |
JacksonCampolattaro
|
77f240b1b6
|
Delete Orthtree::Node class, now used nowhere
|
2023-08-31 12:48:52 +02:00 |
JacksonCampolattaro
|
2d8f7d483d
|
Rename Properties.h for clarity
|
2023-08-30 15:32:38 +02:00 |
JacksonCampolattaro
|
07c671e6e9
|
Convert methods to functor objects for consistency (proof-of-concept)
|
2023-08-29 19:13:11 +02:00 |
JacksonCampolattaro
|
8fe57f5adf
|
Rename traverse_indices to traverse (now that it's the only traversal function)
|
2023-07-27 09:49:20 +02:00 |
JacksonCampolattaro
|
5bc0962b81
|
Eliminate non-index versions of split predicates & traversals
|
2023-07-26 14:13:00 +02:00 |
JacksonCampolattaro
|
4998f7bc57
|
Adapt remaining examples to use the generalized orthtree
|
2023-07-26 13:48:36 +02:00 |
JacksonCampolattaro
|
61a29f0fdb
|
Fix an issue where side-per-depth wasn't updated when a node was manually split
|
2023-07-26 09:57:44 +02:00 |
JacksonCampolattaro
|
cfdb167e35
|
Fix a couple of small issues which came up during LCC conversion
|
2023-07-18 10:35:48 +02:00 |
JacksonCampolattaro
|
03cda70191
|
Replace boost::optional with std::optional
|
2023-07-09 17:49:12 +02:00 |
JacksonCampolattaro
|
dc18e1b1db
|
Replace `tree.points(node)` with `tree.data(node)`
|
2023-06-27 14:58:13 +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
|
c41faf1274
|
Delete independent `Node` type, move relevant typedefs to Orthtree.h
|
2023-06-25 13:54:19 +02:00 |
JacksonCampolattaro
|
01aad4af7a
|
Add a minimal test of custom node properties
|
2023-06-25 12:42:24 +02:00 |
JacksonCampolattaro
|
774aa1f324
|
Add node-access convenience functions, and simplify tests
|
2023-06-22 15:24:39 +02:00 |
JacksonCampolattaro
|
bfe584590e
|
Orthtree no longer instantiates Node types
|
2023-06-22 14:44:38 +02:00 |
JacksonCampolattaro
|
08b418bda2
|
Ensure properties of a moved-from tree are also moved-from
|
2023-06-22 14:11:30 +02:00 |
JacksonCampolattaro
|
ed9266e70f
|
Add parallel node system using properties
bug: moved-from is not reset
|
2023-06-22 10:23:29 +02:00 |
JacksonCampolattaro
|
d1ac73d087
|
Use index-based access for split predicates
|
2023-06-21 17:34:26 +02:00 |
JacksonCampolattaro
|
b09e4d0fa6
|
Add a property container with all aspects of the nodes (currently unused)
|
2023-06-21 16:39:17 +02:00 |
JacksonCampolattaro
|
9a52cf7026
|
Add a "Maybe" type hiding the boost::optional implementation detail
|
2023-04-25 16:07:00 +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
|
33358ae838
|
Only access node properties through helpers
This will make later refactoring to use property maps much simpler
|
2023-04-25 12:15:46 +02:00 |
JacksonCampolattaro
|
0707300f99
|
reassign_points() implemented in terms of indices
|
2023-04-25 11:32:11 +02:00 |
JacksonCampolattaro
|
43b7543d3b
|
nearest_k_neighbors() implemented in terms of indices
|
2023-04-25 11:24:56 +02:00 |
JacksonCampolattaro
|
8712032193
|
adjacent_node() implemented in terms of indices
|
2023-04-25 11:11:53 +02:00 |
JacksonCampolattaro
|
d761f6ebc0
|
adjacent_node() now returns an optional index
|
2023-04-25 10:57:56 +02:00 |
JacksonCampolattaro
|
825abd1727
|
Locate now returns a node index
|
2023-04-24 14:01:01 +02:00 |
JacksonCampolattaro
|
782561598e
|
Intersection writes indices to the output iterator
|
2023-04-24 13:49:13 +02:00 |
JacksonCampolattaro
|
b267403b95
|
Recursive intersection now uses indices
|
2023-04-24 13:38:05 +02:00 |
JacksonCampolattaro
|
c0a8bbf2c9
|
Topology equality is done by index
|
2023-04-20 11:57:35 +02:00 |