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 条
  • [41] Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
    Ignacio E. Grossmann
    Sangbum Lee
    [J]. Computational Optimization and Applications, 2003, 26 : 83 - 100
  • [42] Minimum Perimeter Convex Hull of Imprecise Points in Convex Regions
    Weibel, Christophe
    Zhang, Linqiao
    [J]. COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 293 - 294
  • [43] Finding the convex hull of a simple polygon
    Sklansky, Jack
    [J]. PATTERN RECOGNITION LETTERS, 1982, 1 (02) : 79 - 83
  • [44] Convex hull characterizations of lexicographic orderings
    Warren Adams
    Pietro Belotti
    Ruobing Shen
    [J]. Journal of Global Optimization, 2016, 66 : 311 - 329
  • [45] Convex hull and closure of a fuzzy set
    Zhu, YG
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2005, 16 (01) : 67 - 73
  • [46] CONVEX HULL FOR VISUAL TRACKING WITH EMD
    Wang, Jun
    Wang, Yuanyun
    Deng, Chengzhi
    Wang, Shengqian
    Zhu, Huasheng
    [J]. PROCEEDINGS OF 2016 INTERNATIONAL CONFERENCE ON AUDIO, LANGUAGE AND IMAGE PROCESSING (ICALIP), 2016, : 433 - 437
  • [47] Convex Hull Formation for Programmable Matter
    Daymude, Joshua J.
    Gmyr, Robert
    Hinnenthal, Kristian
    Kostitsyna, Irina
    Scheideler, Christian
    Richa, Andrea W.
    [J]. PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING (ICDCN 2020), 2020,
  • [48] Convex hull characterizations of lexicographic orderings
    Adams, Warren
    Belotti, Pietro
    Shen, Ruobing
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2016, 66 (02) : 311 - 329
  • [49] Implementation of algorithms to compute the Convex Hull
    Candela, C. A.
    Sepulveda, L. E.
    Chavarro, J. C.
    Meneses, C. A.
    Sanabria, J. A.
    Arcila, O.
    [J]. ENTRE CIENCIA E INGENIERIA, 2022, 16 (32): : 27 - 34
  • [50] On the convex hull generated by orbit of operators
    Rezaei, H.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2013, 438 (11) : 4190 - 4203