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 条
  • [1] CONVEX HULL PROBLEM, LATTICE POINTS AND APPLICATIONS
    Fanache, Dumitru
    JOURNAL OF SCIENCE AND ARTS, 2011, (02) : 163 - 175
  • [2] α-Concave hull, a generalization of convex hull
    Asaeedi, Saeed
    Didehvar, Farzad
    Mohades, Ali
    THEORETICAL COMPUTER SCIENCE, 2017, 702 : 48 - 59
  • [3] APPLICATIONS OF A SEMIDYNAMIC CONVEX-HULL ALGORITHM
    HERSHBERGER, J
    SURI, S
    BIT, 1992, 32 (02): : 249 - 267
  • [4] A novel connectionist framework for computation of an approximate convex-hull of a set of planar points, circles and ellipses
    Pal, S
    Bhattacharya, S
    Pal, NR
    INTERNATIONAL JOURNAL OF NEURAL SYSTEMS, 2006, 16 (01) : 15 - 28
  • [5] Fast Convex Hull by a Geometric Approach
    Beltran-Herrera, Alberto
    Mendoza, Sonia
    PATTERN RECOGNITION, 2018, 10880 : 51 - 61
  • [6] Extended convex hull
    Fukuda, K
    Liebling, TM
    Lütolf, C
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 20 (1-2): : 13 - 23
  • [7] CONVEX HULL OF THE ORTHOGONAL SIMILARITY SET WITH APPLICATIONS IN QUADRATIC ASSIGNMENT PROBLEMS
    Xia, Yong
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2013, 9 (03) : 689 - 701
  • [8] Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
    Kilinc-Karzan, Fatma
    Kucukyavuz, Simge
    Lee, Dabeen
    Shafieezadeh-Abadeh, Soroosh
    OPERATIONS RESEARCH, 2025, 73 (01) : 251 - 269
  • [9] CONVEX_HULL - A Pascal program for determining the convex hull for planar sets
    Yamamoto, JK
    COMPUTERS & GEOSCIENCES, 1997, 23 (07) : 725 - 738
  • [10] A Preprocessing Technique for Fast Convex Hull Computation
    Alshamrani, Reham
    Alshehri, Fatimah
    Kurdi, Heba
    11TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT) / THE 3RD INTERNATIONAL CONFERENCE ON EMERGING DATA AND INDUSTRY 4.0 (EDI40) / AFFILIATED WORKSHOPS, 2020, 170 : 317 - 324