Sciweavers

499 search results - page 9 / 100
» On the Decay of Crossing Numbers
Sort
View
ENDM
2008
101views more  ENDM 2008»
15 years 6 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...
SOFSEM
2005
Springer
15 years 11 months ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...
DCG
2006
96views more  DCG 2006»
15 years 6 months ago
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
ENDM
2008
118views more  ENDM 2008»
15 years 6 months 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
ICEIS
2006
IEEE
16 years 2 days ago
Fuzzy Interval Number (FIN) Techniques for Cross Language Information Retrieval
Catherine Marinagi, Theodoros Alevizos, Vassilis G...