Sciweavers

87 search results - page 1 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
DCG
2006
90views more  DCG 2006»
13 years 4 months ago
Combinatorial Complexity of Convex Sequences
We show that the equation si1 + si2 +
Alex Iosevich, S. Konyagin, Michael Rudnev, V. Ten
COMBINATORICA
2008
129views more  COMBINATORICA 2008»
13 years 5 months ago
The combinatorial encoding of disjoint convex sets in the plane
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that capture...
Jacob E. Goodman, Richard Pollack
GC
2007
Springer
13 years 4 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
COMGEO
1998
ACM
13 years 4 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas
RSA
2008
85views more  RSA 2008»
13 years 4 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham