Sciweavers

Share
66 search results - page 1 / 14
» On a Geometric Generalization of the Upper Bound Theorem
Sort
View
FOCS
2006
IEEE
9 years 6 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
ICL
2016
39views more  ICL 2016»
3 years 8 months ago
BER Upper Bound Expressions in Coded Two-Transmission Schemes With Arbitrarily Spaced Signal Constellations
—The main contribution of this letter is the derivation of an upper bound BER expression, as a function of distances between signal points, for arbitrary constellations, in a gen...
Mehmet Cagri Ilter, Halim Yanikomeroglu, Pawel A. ...
ENDM
2008
118views more  ENDM 2008»
9 years 2 days ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
COMPGEOM
2011
ACM
8 years 3 months ago
On the structure and composition of forbidden sequences, with geometric applications
Forbidden substructure theorems have proved to be among of the most versatile tools in bounding the complexity of geometric objects and the running time of geometric algorithms. T...
Seth Pettie
CORR
2010
Springer
168views Education» more  CORR 2010»
8 years 9 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
books