Convexhull of Curved Objects via Duality a General Framework and an Optimal 2-D Algorithm (1993)(Make Corrections)(1 citation) Chao-Kuei Hung, Doug Ierardi
Abstract: We address the problem of finding the convex hull of curved polyhedra in Euclidean
spaces of finite dimension. Optimal algorithms for simple curved polygons in E
2
exist
but the more general version of this problem seems missing from the literature.
A precise definition of the objects under consideration is given. It encompasses most
interesting solids that could arise in practical applications of geometric modeling. Based
on the decomposition theorem for the polar set transformation [HI93],... (Update)
...by . The equation of its host surface can be computed symbolically from the equation of and its extent from those of the subfaces of [HI93]. It turns out that f : is a face of Kg forms an arrangement in E d in which the unique convex d cell containing O is exactly...
Chao-Kuei Hung and Doug Ierardi. Convex hulls of curved objects via duality -- a general framework and an optimal 2-d algorithm. Technical Report USC-CS-93-556, University of Southern California, 1993. http://citeseer.nj.nec.com/hung93convexhull.html More
@misc{ hung93convex,
author = "C. Hung and D. Ierardi",
title = "Convex hulls of curved objects via duality -- a general framework and an
optimal 2-d algorithm",
text = "Chao-Kuei Hung and Doug Ierardi. Convex hulls of curved objects via duality
-- a general framework and an optimal 2-d algorithm. Technical Report USC-CS-93-556,
University of Southern California, 1993.",
year = "1993",
url = "citeseer.nj.nec.com/hung93convexhull.html" }