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 条
  • [31] Sparse convex hull coverage
    Klimenko, Georgiy
    Raichel, Benjamin
    Van Buskirk, Gregory
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2021, 98
  • [32] The Convex Hull of Freeform Surfaces
    J.-K. Seong
    G. Elber
    J. K. Johnstone
    M.-S. Kim
    Computing, 2004, 72 : 171 - 183
  • [33] Fast approximation of convex hull
    Kavan, Ladislav
    Kolingerova, Ivana
    Zara, Jiri
    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTER SCIENCE AND TECHNOLOGY, 2006, : 101 - +
  • [34] A simple and efficient preprocessing step for convex hull problem
    Heydari, Mohammad
    Khalifeh, Ashkan
    Rathour, Laxmi
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (07)
  • [35] Convex-Hull Algorithms: Implementation, Testing, and Experimentation
    Gamby, Ask Neve
    Katajainen, Jyrki
    ALGORITHMS, 2018, 11 (12):
  • [36] A Faster Convex-Hull Algorithm via Bucketing
    Gamby, Ask Neve
    Katajainen, Jyrki
    ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 473 - 489
  • [37] Characterizing circles by a convex combinatorial property
    Czédli G.
    Acta Scientiarum Mathematicarum, 2017, 83 (3-4): : 683 - 701
  • [38] On the computation of the digital convex hull and circular hull of a digital region
    Chaudhuri, BB
    Rosenfeld, A
    PATTERN RECOGNITION, 1998, 31 (12) : 2007 - 2016
  • [39] Generalized convex disjunctive programming: Nonlinear convex hull relaxation
    Grossmann, IE
    Lee, S
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2003, 26 (01) : 83 - 100
  • [40] Some results on the convex hull of finitely many convex sets
    Borbely, A
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1998, 126 (05) : 1515 - 1525