Rectilinear Crossing Number |
Introduction
The Rectilinear Crossing Number Project examines a basic problem of geometry, with application in a range of practical problems from transportation to printing.
Imagine a finite set of points on a flat surface. Draw a graph, such that each point is connected to every other point with a straight line. Now count: how many times do the lines cross? The "Rectilinear Crossing Number" is the minimum number of crossings for that set of points, realized when the points are optimally arranged. The challenge is that as the number of points increases, determining this optimal arrangement becomes exceptionally difficult.
The main goal of the current project is to determine the "Rectilinear Crossing Number" for 18 points, which is as yet undetermined.
Contents | |
Videos
Science
[The Science section might (or might not) be divided into two parts: {1} general discussion of the field, and then {2} a discussion of the project's specific endeavor. For instance, in LHC@home, we might have {1} "Science of the Large Hardon Collider" and then {2} "Science of LHC@home"
The above is desirable, because in most cases, the field of research is really fascinating, and presenting this in broad terms-- outlining the big questions-- can make it easier to understand the particulars of the project and why it is important. ]
Results
[Where known, we should attempt to keep track of each project's publications. A good list to draw from is here. ]
Links of Interest
[Why recreate the wheel; there are lots of great sources out there.; a good list of sources can be really useful to the reader.]
Rectilinear Crossing Number in the Classroom
[For each project, please add a "[Projectname] in the Classroom" section-- with a link to Volunteer Computing In the Classroom and an article named "[Projectname] in the Classroom". (Then please add "[Projectname] in the Classroom" to the list on the main Education page.)]
Categories: Projects