131 search results - page 17 / 27 » Crossing Number and Weighted Crossing Number of Near-Planar ... |
GD
2004
Springer
14 years 3 days ago
2004
Springer
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
VDA
2010
13 years 9 months ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
ESA
2001
Springer
13 years 11 months ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
COMPGEOM
1995
ACM
13 years 10 months ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
COMGEO
2011
ACM
13 years 1 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...