396 search results - page 14 / 80 » Crossing Numbers |
CAGD
2008
13 years 7 months ago
2008
In this paper we present a robust approach to construct a map between two triangulated meshes, M and M' of arbitrary and possibly unequal genus. We introduce a novel initial ...
GD
2006
Springer
13 years 11 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
JCT
2007
13 years 7 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
COCOA
2007
Springer
14 years 1 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
ANOR
2005
13 years 7 months ago
2005
This paper addresses the problem of loading a finite capacity, stochastic (random) and dynamic multi-project system. The system is controlled by keeping a constant number of projec...