A lower bound on Voronoi diagram complexity

被引：10

作者：

Aronov, B ^{[1
]}

机构：

[1] Polytech Univ, Dept Comp & Informat Sci, Brooklyn, NY 11201 USA

来源：

INFORMATION PROCESSING LETTERS | 2002年 / 83卷 / 04期

基金：

美国国家科学基金会;

关键词：

Voronoi diagram; computational geometry; computational complexity;

D O I：

10.1016/S0020-0190(01)00336-2

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A lower bound on Voronoi diagram complexity is presented. The Voronoi diagram is a classification of points of the ambient space according to the identity of the closest site or sites. Results provided evidence that the bound derived from envelope analysis is closer to the truth as the conjecture of Sharir does not hold.

引用

页码：183 / 185

页数：3

共 50 条

[21] LOWER BOUND FOR THE ARITHMETICAL COMPLEXITY OF STURMIAN WORDS
Frid, A. E.
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2005, 2 : 14 - 22
[22] A NONLINEAR LOWER BOUND ON THE PRACTICAL COMBINATIONAL COMPLEXITY
GUBAS, X
HROMKOVIC, J
WACZULIK, J
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 293 - 302
[23] A LOWER BOUND ON THE COMPLEXITY OF ORTHOGONAL RANGE QUERIES
FREDMAN, ML
JOURNAL OF THE ACM, 1981, 28 (04) : 696 - 705
[24] A Lower Bound on the Complexity of Testing Grained Distributions
Oded Goldreich
Dana Ron
computational complexity, 2023, 32
[25] How to derive a quantum complexity lower bound
Nishino, Tetsuro
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 2007, 90 (10): : 9 - 17
[26] A Lower Bound for the Hardware Complexity of FIR Filters
Mehrnia, Alireza
Willson, Alan N., Jr.
IEEE CIRCUITS AND SYSTEMS MAGAZINE, 2018, 18 (01) : 10 - 28
[27] A lower bound on complexity of optimization on the Wiener space
Calvin, James M.
THEORETICAL COMPUTER SCIENCE, 2007, 383 (2-3) : 132 - 139
[28] Randomized Complexity Lower Bound for Arrangements and Polyhedra
D. Grigoriev
Discrete & Computational Geometry, 1999, 21 : 329 - 344
[29] A LOWER BOUND FOR THE COMPLEXITY OF MONOTONE GRAPH PROPERTIES
Scheidweiler, Robert
Triesch, Eberhard
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 257 - 265
[30] Complexity Considerations, cSAT problem lower bound
Hofman, Radoslaw
IMECS 2007: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2007, : 451 - 458

← 1 2 3 4 5 →