Subject: CGAL users discussion list
List archive
- From: jasmine2210 <>
- To:
- Subject: Re: [cgal-discuss] Edge crossing counting for graph
- Date: Sun, 4 Jan 2015 16:14:01 -0800 (PST)
Sebastien Loriot (GeometryFactory) wrote
> Could you explain what you mean by "counting edge crossing"?
>
> Sebastien.
Sebastien,
I meant the standard crossing number definition.
"In such a drawing, the intersection of two edges is called a /crossing/ (a
common endpoint of two edges does not count as a crossing)."
"Let G = (V,E) be a simple graph. The /crossing number/ of G , /cr(G)/, is
the minimum number of crossings over all drawings of G."
Hope these definitions are clear enough.
Jasmine.
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Edge-crossing-counting-for-graph-tp4660258p4660270.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- Re: [cgal-discuss] Edge crossing counting for graph, Sebastien Loriot (GeometryFactory), 01/04/2015
- Re: [cgal-discuss] Edge crossing counting for graph, jasmine2210, 01/05/2015
- Re: [cgal-discuss] Edge crossing counting for graph, Andreas Fabri, 01/05/2015
- Re: [cgal-discuss] Edge crossing counting for graph, jasmine2210, 01/13/2015
- Re: [cgal-discuss] Edge crossing counting for graph, Efi Fogel, 01/13/2015
- Re: [cgal-discuss] Edge crossing counting for graph, jasmine2210, 01/13/2015
- Re: [cgal-discuss] Edge crossing counting for graph, Andreas Fabri, 01/05/2015
- Re: [cgal-discuss] Edge crossing counting for graph, jasmine2210, 01/05/2015
Archive powered by MHonArc 2.6.18.