Matches in DBpedia 2016-04 for { ?s ?p "In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. \"Smallest\" may refer to volume, area, perimeter, etc. of the box.It is sufficient to find the smallest enclosing box for the convex hull of the objects in question."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Minimum_bounding_box_algorithms comment "In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. \"Smallest\" may refer to volume, area, perimeter, etc. of the box.It is sufficient to find the smallest enclosing box for the convex hull of the objects in question.".