Convex Hulls Of Simple Space Curves
نویسندگان
چکیده
منابع مشابه
Computing simple-path convex hulls in hypergraphs
a r t i c l e i n f o a b s t r a c t Keywords: Graph algorithms Simple-path convexity Simple-path convex hull Totally balanced hypergraphs In a connected hypergraph a vertex set X is simple-path convex (sp-convex, for short) if either |X| 1 or X contains every vertex on every simple path between two vertices in X (Faber and Jamison, 1986 [7]), and the sp-convex hull of a vertex set X is the mi...
متن کاملConvex Hulls in a 3-Dimensional Space
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm is an abstract polyhedron being described by a new data structure, the cell list, suggested by one of the authors. The correctness of the algorithm is proved and experimental results are presented.
متن کاملOn Young Hulls of Convex Curves in R 2n
For a convex curve in an even-dimensional aane space we introduce a series of convex domains (called Young hulls) describe their structure and give a formulas for the volume of the biggest of these domains. A simple smooth curve in R m is called convex if the total multiplicity of its intersection with any aane hyperplane does not exceed m. Note that each convex curve is nondegen-erate, i.e. ha...
متن کاملOn the Convex Hulls of Parametric Plane Curves
Linear-time convex hull algorithms are known to exist for polygons and planar objects bounded by piecewise algebraic curves. Most of the existing algorithms laboriously trace out the so-called “pockets” formed by the concave portions of an object’s boundary. Objects bounded by general parametric curves have been excluded from the previous study partly because the nature of computation is seemin...
متن کاملSemidefinite Representation for Convex Hulls of Real Algebraic Curves
We prove that the closed convex hull of any one-dimensional semialgebraic subset of Rn has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is proved by an application of the moment relaxation method. Given a nonsingular affine real algebraic curve C and a compact semi-algebraic subset K of its R-poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 1956
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-1956-042-3