c++ - How to check if any 2d point in boost r-tree is in a given triangle? -


How to check if any 2d point in the rectangle is in a given rectangle? This is the website I wanted to know about.

But how am I confused that the R-tree in any point is within a given rectangle or not? The C ++ code will be commendable.

R-trees only work on rectangle .

If you are collecting non-rectangular data in an R-tree, then it will only provide you candidates which you check again Requires ("Verify", "Extended", "Refine") and more detail.

The idea of ​​the entire R-tree is as simple (efficiently handling and managing) of almost a bounding box.

The boost library may provide some helpful functionality for this. , But probably outside the RTD package, in the geometric packages itself.


Comments

Popular posts from this blog

java - org.apache.http.ProtocolException: Target host is not specified -

java - Gradle dependencies: compile project by relative path -

ruby on rails - Object doesn't support #inspect when used with .include -