Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
Mar 26, 2012 · In this paper, we show that for a uniform cross-polytope in three dimensional space, a minimum volume bounding box would have a face flush with ...
ABSTRACT. In recent years there has been significant use of regular cross-polytopes (regular octahedrons or hyper-diamonds) as.
People also ask
In this paper, we show that for a uniform cross-polytope in three dimensional space, a minimum volume bounding box would have a face flush with the convex hull ...
Pramanik, and C. B. Owen, “Minimum bounding boxes for regular cross- polytopes,” in Proceedings of the 27th Annual ACM Symposium on Applied Computing,. SAC ...
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev. Hosted as a part of SLEBOK on ...
This paper presents algorithms for estimating the minimum volume bounding box based on a three-dimensional point set measured by a coordinate measuring machine.
Missing: polytopes. | Show results with:polytopes.
For example, it is easy to establish that it is not necessary for any face of a minimal box to be flush with a face of the inscribed polyhedron: the minimal box ...
The minimum bounding rectangle (MBR), also known as bounding box (BBOX) or envelope, is an expression of the maximum extents of a two-dimensional object
Missing: cross- polytopes.
Abstract. This paper presents algorithms for estimating the minimum volume bounding box based on a three- dimensional point set measured by a coordinate ...
... polyhedron back to the original space. One can show, as in Section 6.3, that the minimum-volume bounding box of the scaled-up polyhedron is a (1 + ε)- ...