townforge/geometry
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

[doc][index] Improve the description of key features and comment the planned features out.

Browse Source
This commit is contained in:
Adam Wulkiewicz 2014-07-11 03:14:49 +02:00
parent 5ee3a89455
commit bb8cf8a411
1 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
doc/index/introduction.qbk
View File

@ -77,26 +77,30 @@ Key features of this implementation of the __rtree__ are:
* creation using packing algorithm,
* parameters (including maximal and minimal number of elements) may be passed as compile- or run-time parameters, in compile-time
version nodes elements are stored in static-size containers,
* advanced queries - e.g. search for 5 nearest Values to some point and intersecting some Geometry but not within the other one,
* iterative queries - by use of iterators,
* C++11 conformant: move semantics, stateful allocators,
* advanced queries, e.g. search for 5 nearest Values to some point and intersecting some Geometry but not within the other one,
* iterative queries by use of iterators,
* C++11 conformant - move semantics, stateful allocators,
* capable to store __value__ type with no default constructor,
* in-memory storage (shared memory by use of Boost.Interprocess allocator).
* in-memory storage by use of the default std::allocator<>,
* other storage options - shared memory and mapped file by use of Boost.Interprocess allocators.
[/
[heading Planned features]
Below you can find features that will (or probably will) be added in the future releases:
/]
[/ Done
* rstar optimization (planned for release in Boost 1.55),
* bulk loading (planned for release in Boost 1.55),
* 'reversed' spatial predicates or additional spatial predicates like contains(),
* iterative queries - query iterators / type-erased query iterators,
/]
[/
* path/ray query predicate - search for Values along Segment or LineString, closest to the starting point,
* user-defined distance calculation in nearest() predicate,
* serialization,
* persistent storage.
/]
[/ Maybe
* other geometries as Indexables, e.g. NSpheres. Rings would probably require using move semantics instead of copying
* bounding tree - rtree variation capable to use other Geometries as bounds, e.g. NSpheres, Rings/convex polygons/ (moving required), Capsules, Elipses, Variants etc.