CGAL users discussion list

[Andreas Fabri <>]

Hello,

Have a look at
http://doc.cgal.org/latest/Sweep_line_2/index.html#Chapter_2D_Intersection_of_Curves

andreas

On 05/01/2015 01:14, jasmine2210 wrote:
> 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.

--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri