Retrieve all nodes intersecting a bounding box

Retrieve all nodes intersecting a bounding box

The intersection bounding box is defined in terms of its minimum and maximum project space coordinates. The number of returned nodes can be limited to constrain query execution time. Optionally, lists of treenodes and connector IDs can be provided to make sure they are included in the result set, regardless of intersection.

Returned is an array with five entries, plus optionally a sixth one

[[treenodes], [connectors], {labels}, node_limit_reached, {relation_map}, {exstraNodes}]

The list of treenodes has elements of this form:

[id, parent_id, location_x, location_y, location_z, confidence, radius, skeleton_id, edition_time, user_id]

The list connectors has elements of this form:

[id, location_x, location_y, location_z, confidence, edition_time, user_id, [partners]]

The partners arrary represents linked partner nodes, each one represented like this:

[treenode_id, relation_id, link_confidence, link_edition_time, link_id]

If labels are returned, they are represented as an object of the following form, with the labels just being simple strings:

{treenode_id: [labels]}

The fourth top level entry, node_limit_reached, is a boolean that represents if there are more nodes available than the ones returned.

With the last top level element returned the present connector linked relations are mapped to their textural representations:

{relation_id: relation_name}