727 search results - page 40 / 146 » One line and n points |
97
Voted
DCG
1998
15 years 4 days ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
111
Voted
SIAMDM
2010
14 years 11 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
112
click to vote
GD
1998
Springer
15 years 4 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
104
Voted
COMGEO
1998
ACM
15 years 5 days ago
1998
ACM
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...
124
Voted
COMGEO
2012
ACM
13 years 8 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...