2 search results - page 1 / 1 » Long Non-crossing Configurations in the Plane |
DMTCS
2010
13 years 1 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...