Convex Approximation by Spherical Patches
نویسندگان
چکیده
Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subset of the input points. We show that deciding whether an approximation with not more than a given number of spherical patches exists is NP-hard by a reduction from planar 3SAT.
منابع مشابه
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Spherical approximation of convex shapes
Given points in convex position in three dimensions, we want to find an approximating convex surface consisting of spherical patches, such that all points are within some specified tolerance bound ε of the approximating surface. We describe a greedy algorithm which constructs an approximating surface whose spherical patches are associated to the faces of an inscribed polytope formed from a subs...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملLinear Approximation of Trimmed Surfaces
Parametric surfaces in various representations, such as Bézier-and B-spline-tensorproduct patches, triangular patches etc., play an important role in CAGD-applications. Connecting patches with different degree of continuity and trimming surfaces are well-known techniques to construct a variety of shapes like ship hulls, car bodies, etc. For finite element analysis, stereolithography, rendering ...
متن کاملA HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملPerturbations and Approximations of Support Functions of Convex Bodies
Let h be the support function of a d-dimensional convex body and a real valued function on the unit sphere. The primary objective of this note is to nd conditions on that imply that h + is again a support function. It is shown that for a large class of convex bodies such a condition can be formulated as an inequality involving and its rst and second order partial derivatives. Furthermore, some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006