Détail d'un projet [0] |
Projet : Rectilinear Crossing Number
Membre depuis le 07/08/2006 Team : Le portail de L'Alliance |
Mis à jour le 12/11/2010 à 15:37:41
(UTC) par OnlineCron |
|
But : Many questions in computational and combinatorial geometry are based on finite sets of points in the Euclidean plane. Several problems from graph theory also fit into this framework, when edges are restricted to be straight. A typical question is the prominent problem of the rectilinear crossing number (related to transport problems and optimization of print layouts for instance): What is the least number of crossings a straight-edge drawing of the complete graph on top of a set of n points in the plane obtains? Here complete graph means that any pair of points is connected by a straight-edge. Moreover we assume general position for the points, i.e., no three points lie on a common line. |
Sous total : 0 | Moyenne : 0 | Total : 47286,00 |