CHoCC: Convex Hull of Cospherical Circles and Applications to Lattices

被引:4
作者
Wu, Yaohong [1 ]
Gupta, Ashish [1 ]
Kurzeja, Kelsey [1 ]
Rossignac, Jarek [1 ]
机构
[1] Georgia Inst Technol, Sch Interact Comp, Atlanta, GA 30332 USA
关键词
Convex hull; Cospherical circles; Convex decomposition; Lattice structures; Apollonius diagram; Developable surfaces; ALGORITHM;
D O I
10.1016/j.cad.2020.102903
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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 ICJ that bound disjoint spherical caps of possibly different radii. The faces of B comprise: n disks, each bounded by an input circle, t = 2n - 4 triangles, each having vertices on different circles, and 3t/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. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:10
相关论文
共 50 条
  • [21] A Variational Convex Hull Algorithm
    Li, Lingfeng
    Luo, Shousheng
    Tai, Xue-Cheng
    Yang, Jiang
    SCALE SPACE AND VARIATIONAL METHODS IN COMPUTER VISION, SSVM 2019, 2019, 11603 : 224 - 235
  • [22] ON CONVEX HULL OF GAUSSIAN SAMPLES
    Davydov, Youri
    LITHUANIAN MATHEMATICAL JOURNAL, 2011, 51 (02) : 171 - 179
  • [23] The convex hull of freeform surfaces
    Seong, JK
    Elber, G
    Johnstone, JK
    Kim, MS
    COMPUTING, 2004, 72 (1-2) : 171 - 183
  • [24] On convex hull of Gaussian samples
    Youri Davydov
    Lithuanian Mathematical Journal, 2011, 51 : 171 - 179
  • [25] On Privacy Preserving Convex Hull
    Hans, Sandeep
    Addepalli, Sarat C.
    Gupta, Anuj
    Srinathan, Kannan
    2009 INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY, AND SECURITY (ARES), VOLS 1 AND 2, 2009, : 187 - 192
  • [26] On efficiency in convex hull of DMUs
    Soltanifar, Mehdi
    Jahanshahloo, Gholam Reza
    Lotfi, Farhad Hosseinzadeh
    Mansourzadeh, Seyyed Mehdi
    APPLIED MATHEMATICAL MODELLING, 2013, 37 (04) : 2267 - 2278
  • [27] Estimating the Convex Hull of the Image of a Set with Smooth Boundary: Error Bounds and Applications
    Lew, Thomas
    Bonalli, Riccardo
    Janson, Lucas
    Pavone, Marco
    DISCRETE & COMPUTATIONAL GEOMETRY, 2024,
  • [28] Convex hull properties and algorithms
    Zhang, Xianquan
    Tang, Zhenjun
    Yu, Jinhui
    Guo, Mingming
    Jiang, Lianyuan
    APPLIED MATHEMATICS AND COMPUTATION, 2010, 216 (11) : 3209 - 3218
  • [29] On the convex hull of projective planes
    Maurras, Jean-Francois
    Nedev, Roumen
    RAIRO-OPERATIONS RESEARCH, 2008, 42 (03) : 285 - 289
  • [30] Sparse convex hull coverage
    Klimenko, Georgiy
    Raichel, Benjamin
    Van Buskirk, Gregory
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2021, 98