CHoCC: Convex Hull of Cospherical Circles and Applications to Lattices

Abstract We discuss the properties and computation of the boundary B of a CHoCC (Convex Hulls of Cospherical Circles), which we define as the curved convex hull H ( C ) of a set C of n oriented and cospherical circles { C i } that bound disjoint spherical caps of possibly different radii. The faces of B comprise: n disks, each bounded by an input circle, t = 2 n − 4 triangles, each having vertices on different circles, and 3 t ∕ 2 developable surfaces, which we call corridors. The connectivity of B and the vertices of its triangles may be obtained by computing the Apollonius diagram of a flattening of the caps via a stereographic projection. As a more direct alternative, we propose a construction that works directly in 3D. The corridors are each a subset of an elliptic cone and their four vertices are coplanar. We define a beam as the convex hull of two balls (on which it is incident) and a lattice as the union of beams that are incident each on a pair of balls of a given set. We say that a lattice is clean when its beams are disjoint, unless they are incident upon the same ball. To simplify the structure of a clean lattice, one may union it with copies of the balls that are each enlarged so that it includes all intersections of its incident beams. But doing so may increase the total volume of the lattice significantly. To reduce this side-effect, we propose to replace each enlarged ball by a CHoCC and to approximate the lattice by an ACHoCC, which is an assembly of non-interfering CHoCCs for which the contact-faces are disks. We also discuss polyhedral approximations of CHoCCs and of ACHoCCs and advocate their use for processing and printing lattices.

[1]  Mariette Yvinec,et al.  An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension D , 1996, Comput. Geom..

[2]  Gabriel Taubin,et al.  The ball-pivoting algorithm for surface reconstruction , 1999, IEEE Transactions on Visualization and Computer Graphics.

[3]  Ralph Howard,et al.  Capturing the Origin with Random Points: Generalizations of a Putnam Problem , 1996 .

[4]  Jarek Rossignac,et al.  Programmed-Lattice Editor and accelerated processing of parametric program-representations of steady lattices , 2019, Comput. Aided Des..

[5]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[6]  Evan D. Nash,et al.  Convex Hull of Two Circles in R^3 , 2016, 1612.09382.

[7]  H. Coxeter,et al.  Introduction to Geometry. , 1961 .

[8]  John C. Hart,et al.  Sphere tracing: a geometric method for the antialiased ray tracing of implicit surfaces , 1996, The Visual Computer.

[9]  Lorenzo Valdevit,et al.  Compressive strength of hollow microlattices: Experimental characterization, modeling, and optimal design , 2013 .

[10]  Elmar Schömer,et al.  The convex hull of ellipsoids , 2001, SCG '01.

[11]  Mariette Yvinec,et al.  Dynamic Additively Weighted Voronoi Diagrams in 2D , 2002, ESA.

[12]  Eric Galin,et al.  Fast Distance Computation Between a Point and Cylinders, Cones, Line-Swept Spheres and Cone-Spheres , 2004, J. Graphics, GPU, & Game Tools.

[13]  Sudebkumar Prasant Pal,et al.  A convex hull algorithm for discs, and applications , 1992 .

[14]  Nancy M. Amato,et al.  Approximate convex decomposition of polyhedra , 2007, Symposium on Solid and Physical Modeling.

[15]  James F. Blinn,et al.  A Generalization of Algebraic Surface Drawing , 1982, TOGS.

[16]  Jarek Rossignac,et al.  Exact Representations and Geometric Queries for Lattice Structures with Quador Beams , 2019, Comput. Aided Des..

[17]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[18]  Tong Fang,et al.  Automated Structured All-Quadrilateral and Hexahedral Meshing of Tubular Surfaces , 2012, IMR.

[19]  Chia-Wei Wang,et al.  Structure, Mechanics and Failure of Stochastic Fibrous Networks: Part I—Microscale Considerations , 2000 .