Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4643070 | Journal of Computational and Applied Mathematics | 2007 | 7 Pages |
Abstract
This paper discusses algorithms for computing verified convex hull and distance enclosure for objects represented by axis-aligned or unaligned octrees. To find a convex enclosure of an octree, the concept of extreme vertices of boxes on its boundary has been used. The convex hull of all extreme vertices yields an enclosure of the object. Thus, distance algorithms for convex polyhedra to obtain lower bounds for the distance between two octrees can be applied. Since using convex hulls makes it possible to avoid the unwanted wrapping effect that results from repeated decompositions, it also opens a way to dynamic distance algorithms for moving objects.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Eva Dyllong, Wolfram Luther,