An algorithm for constructing the convex hull of a set of spheres in dimension d

被引：12
|
作者：
Boissonnat, JD
Cerezo, A
Devillers, O
Duquesne, J
Yvinec, M
机构：
[1] INRIA,F-06561 VALBONNE,FRANCE
[2] UNIV NICE,F-06034 NICE,FRANCE
[3] CNRS,URA 1376,LAB 13S,F-06560 VALBONNE,FRANCE
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 1996年 / 6卷 / 02期
关键词：
computational geometry; convex hull; spheres;
D O I：
10.1016/0925-7721(95)00024-0
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We present an algorithm which computes the convex hull of a set of it spheres in dimension d in time O(n([d/2]) + n log n). It is worst-case optimal in three dimensions and in even dimensions. The same method can also be used to compute the convex hull of a set of n homothetic convex objects of E(d). If the complexity of each object is constant, the time needed in the worst case is O(n([d/2]) + n log n).
引用
收藏
页码：123 / 130
页数：8
相关论文
共 50 条
  • [1] CONSTRUCTING THE CONVEX HULL OF A SET OF POINTS IN THE PLANE
    GREEN, PJ
    SILVERMAN, BW
    [J]. COMPUTER JOURNAL, 1979, 22 (03): : 262 - 266
  • [2] A new algorithm for constructing dynamic convex hull in the plane
    Wan, M
    Tang, ZS
    [J]. FOURTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN AND COMPUTER GRAPHICS, 1996, 2644 : 273 - 282
  • [3] Fast inline convex hull algorithm in any dimension
    Delpias, C
    [J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XI, PROCEEDINGS: COMPUTER SCIENCE II, 2002, : 171 - 175
  • [4] Neurocomputing model for computation of an approximate convex hull of a set of points and spheres
    Pal, Srimanta
    Bhattacharya, Sabyasachi
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 2007, 18 (02): : 600 - 605
  • [5] A Fast Convex Hull Algorithm of Planar Point Set
    Jiang, Hong-fei
    [J]. MECHATRONICS AND INTELLIGENT MATERIALS III, PTS 1-3, 2013, 706-708 : 1852 - 1855
  • [6] Fast algorithm for convex hull of planer point set
    Zhou, Min
    Yang, Bo
    Liang, Yun
    Huang, Qiong
    Wan, Junzhou
    [J]. Journal of Information and Computational Science, 2013, 10 (04): : 1237 - 1243
  • [7] CONSTRUCTING THE CONVEX-HULL OF A POINT SET AS A SYSTEM OF LINEAR INEQUALITIES
    CHERNYKH, OL
    [J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1992, 32 (08) : 1085 - 1096
  • [8] AN OPTIMAL CONVEX-HULL ALGORITHM IN ANY FIXED DIMENSION
    CHAZELLE, B
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 10 (04) : 377 - 409
  • [9] A new algorithm for computing the convex hull of a planar point set
    Guang-hui Liu
    Chuan-bo Chen
    [J]. Journal of Zhejiang University-SCIENCE A, 2007, 8 : 1210 - 1217
  • [10] AN EFFICIENT ALGORITHM FOR THE CONVEX HULL OF PLANAR SCATTERED POINT SET
    Fu, Zhongliang
    Lu, Yuefeng
    [J]. XXII ISPRS CONGRESS, TECHNICAL COMMISSION II, 2012, 39-B2 : 63 - 66
12345