[GRASS-dev] GRASS GSoC idea: the line intersection problem

[Markus Metz]

I would like to propose a project for the next Google Summer of Code:

The current implementation of Vect_break_lines() is causing a lot of
headache for larger vector maps with high spatial detail.
Vect_break_lines() is already much faster in G7 than in G6, but still
sometimes so slow that the procedure appears to make no progress at
all. There are a number of published alternatives on to how find
intersections between two lines, most of them based on the
Bentley–Ottmann algorithm. The best one or two, according to
literature review, should be implemented in the GSoC project. Benefit
to users: faster import of non-topological vectors, faster cleaning of
vectors with topological errors. Some more detail is on the wiki page
for GSoC 2013 [0].

Markus M

[0] http://grasswiki.osgeo.org/wiki/GRASS_SoC_Ideas_2013#Vector