Hello Matthias,
sorry for responding so slow. I came only across now.
The Hertel Mehlhorn Algorithm is original published as Fast triangulation of simple polygons (https://link.springer.com/chapter/10.1007/3-540-12689-9_105).
I found a lot of O’Ro…
And a slightly improved version that changes the way it iterates over the triangles, checks for triangles to touch each other before merging and also calles the GC every 1000 runs, because before KLayout would crash.
class DRC::DRCLayer def decomp…
Ok, and I came across a bug report, the way to go is probably like this:
polys = polygons("INPUT_LAYER")polys.data = polys.data.decompose_trapezoids_to_regionpolys.output(1001)
Not sure why this works, but it does the same thing without …
As so often, after I asked I found more and more similar questions, and I found an answer. I post it here, perhaps there are ways to make it faster, or somebody else wonders the same.
The solution is to extend the DRCLayer Class inside the DRC file…
Hej Matthias,
I am not sure about the licensing stuff. I was more wondering if there would be a possibility to get a hook into the loading procedure, so one can write a plugin for a file format, or filter the file format for all the un-normed stuff …