// TODO auskommentiert; checken!
// if (geom.isEmpty())
// return true;
GeometryGraph graph = new GeometryGraph(0, geom);
LineIntersector li = new RobustLineIntersector();
SegmentIntersector si = graph.computeSelfNodes(li, true);
// if no self-intersection, must be simple
// Primitives can be simple even if their boundary intersect
// Complexes are not simple if their boundary intersect