Decompositions and boundary coverings of non-convex fat polyhedra

被引:3
作者
de Berg, Mark [1 ]
Gray, Chris [2 ]
机构
[1] TU Eindhoven, Dept Comp Sci, NL-5600 MB Eindhoven, Netherlands
[2] TU Braunschweig, Dept Comp Sci, Braunschweig, Germany
来源
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2010年 / 43卷 / 02期
关键词
Decomposition; Tetrahedralization; Fatness; Realistic input models; OBJECTS; UNION; PARTITIONS; COMPLEXITY; 3-SPACE;
D O I
10.1016/j.comgeo.2009.04.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show that any locally-fat (or (alpha, beta)-covered) polyhedron with convex fat faces can be decomposed into O(n) tetrahedra, where n is the number of vertices of the polyhedron. We also show that the restriction that the faces are fat is necessary: there are locally-fat polyhedra with non-fat faces that require Omega(n(2)) pieces in any convex decomposition. Furthermore, we show that if we want the tetrahedra in the decomposition to be fat themselves, then their number cannot be bounded as a function of n in the worst case. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:73 / 83
页数:11
相关论文
共 41 条
[21]   Column enumeration based decomposition techniques for a class of non-convex MINLP problems [J].
Rebennack, Steffen ;
Kallrath, Josef ;
Pardalos, Panos M. .
JOURNAL OF GLOBAL OPTIMIZATION, 2009, 43 (2-3) :277-297
[22]   Best Pair Formulation & Accelerated Scheme for Non-Convex Principal Component Pursuit [J].
Dutta, Aritra ;
Hanzely, Filip ;
Liang, Jingwei ;
Richtarik, Peter .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 :6128-6141
[23]   An approximate dual subgradient algorithm for multi-agent non-convex optimization [J].
Zhu, Minghui ;
Martinez, Sonia .
49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, :7487-7492
[24]   Column enumeration based decomposition techniques for a class of non-convex MINLP problems [J].
Steffen Rebennack ;
Josef Kallrath ;
Panos M. Pardalos .
Journal of Global Optimization, 2009, 43 :277-297
[25]   Newton-type methods for non-convex optimization under inexact Hessian information [J].
Xu, Peng ;
Roosta, Fred ;
Mahoney, Michael W. .
MATHEMATICAL PROGRAMMING, 2020, 184 (1-2) :35-70
[26]   A Fast and Accurate Sparse Continuous Signal Reconstruction by Homotopy DCD with Non-Convex Regularization [J].
Wang, Tianyun ;
Lu, Xinfei ;
Yu, Xiaofei ;
Xi, Zhendong ;
Chen, Weidong .
SENSORS, 2014, 14 (04) :5929-5951
[27]   Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints [J].
Strongin, Roman ;
Barkalov, Konstantin ;
Bevzuk, Semen .
SOFT COMPUTING, 2020, 24 (16) :11853-11865
[28]   Improved Wavelet Denoising by Non-Convex Sparse Regularization Under Double Wavelet Domains [J].
Wu, Yongjun ;
Gao, Guangjun ;
Cui, Can .
IEEE ACCESS, 2019, 7 :30659-30671
[29]   Airline environmental efficiency measures through a non-convex meta-frontier DEA model [J].
Li, Ye ;
Zheng, Jin-kun ;
Zhang, Ya-nan .
ENERGY EFFICIENCY, 2024, 17 (08)
[30]   Tensor Recovery Based on a Novel Non-Convex Function Minimax Logarithmic Concave Penalty Function [J].
Zhang, Hongbing ;
Fan, Hongtao ;
Li, Yajing ;
Liu, Xinyi ;
Liu, Chang ;
Zhu, Xinyun .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2023, 32 :3413-3428