A lower bound on the number of triangulations of planar point sets

被引：32
作者：
Aichholzer, O
Hurtado, F
Noy, M
机构：
[1] Graz Univ Technol, Inst Software Technol, A-8010 Graz, Austria
[2] Univ Politecn Catalunya, Dept Matemat Aplicada 2, E-08028 Barcelona, Spain
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2004年 / 29卷 / 02期
关键词：
straight-edge triangulations; counting; lower bound;
D O I：
10.1016/j.comgeo.2004.02.003
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by Omega (2.33(n)). (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：135 / 145
页数：11
相关论文
共 50 条
[21]   On the number of 1-perfect binary codes: A lower bound [J].
Krotov, Denis S. ;
Avgustinovich, Sergey V. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (04) :1760-1765
[22]   Lower Bounds for Simplicial Covers and Triangulations of Cubes [J].
Adam Bliss ;
Francis Edward Su .
Discrete & Computational Geometry, 2005, 33 :669-686
[23]   A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs [J].
Xiaoling Ke .
Journal of Mathematical Chemistry, 2012, 50 :131-140
[24]   A LOWER BOUND FOR THE NUMBER OF FUNCTION EVALUATIONS IN AN ERROR ESTIMATE FOR NUMERICAL-INTEGRATION [J].
COOLS, R ;
HAEGEMANS, A .
CONSTRUCTIVE APPROXIMATION, 1990, 6 (04) :353-361
[25]   A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs [J].
Ke, Xiaoling .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2012, 50 (01) :131-140
[26]   COMPUTING A LOWER BOUND FOR THE CANONICAL HEIGHT ON ELLIPTIC CURVES OVER NUMBER FIELDS [J].
Thongjunthug, Thotsaphon .
MATHEMATICS OF COMPUTATION, 2010, 79 (272) :2431-2449
[27]   A Lower Bound on the Number of Nodes with Multiple Slots in Wireless Sensor Networks with Multiple Sinks [J].
Saginbekov, Sain ;
Jhumka, Arshad ;
Mademikhanov, Yerzhan .
SENSORNETS: PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON SENSOR NETWORKS, 2017, :202-206
[28]   An improved lower bound on the covering number K2(9,1) [J].
Kolev, E ;
Hill, R .
DISCRETE MATHEMATICS, 1999, 197 (1-3) :483-489
[29]   A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications [J].
Crowston, Robert ;
Gutin, Gregory ;
Jones, Mark ;
Yeo, Anders .
ALGORITHMICA, 2012, 64 (01) :56-68
[30]   On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class [J].
Bykov D.A. ;
Kolomeec N.A. .
Journal of Applied and Industrial Mathematics, 2023, 17 (03) :507-520
12345