Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Special purpose automatic programming for hidden surface elimination
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Red-blue separability problems in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Hi-index | 0.00 |
A method for computing extreme separating planes for a pair of disjoint polytopes is presented. A projective transformation, determined by a strict separating plane, is applied to each of the original polytopes to produce a transformed polytope with the same face structure as the original. Computing the convex hull of the transformed pair of polytopes is shown to be equivalent to the original problem. General convex hull algorithms which work in all dimensions are well established, but in dimensions 2 and 3 the merge step of Preparata and Hong uses the face structure of the transformed polytopes to make the computation of their convex hull more efficient. An application of extreme separating planes to hidden surface elimination is also presented.