Replies: 2 comments 1 reply
-
|
Manifold uses https://github.com/AngusJohnson/Clipper2 for 2D boolean, so you should check that for their algorithm. And I don't think you need to generalize it, it already handles polygon with holes. |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
Yes, It handles polygon with holes. and another features, every path may take a z property. It is important for two polygon series 's bool operating. we can rebuild the record referenced on every result polygon. But does Manifold's Python interface implement's the z property? |
Beta Was this translation helpful? Give feedback.
1 reply
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
As a classic computational geometry library, Shapely uses a sweep-line algorithm, maintains an event queue with a red-black tree, detects polygon intersections, and reconstructs polygons from the broken edges using a doubly connected edge list. However, the performance of GeoPandas is far from ideal. I would like to ask what algorithmic principles Manifold's CrossSection employs to achieve this. If possible, I would like to draw inspiration from CrossSection's implementation and extend it to more general cases such as LineString, Polygon, and PolygonWithHoles.
Beta Was this translation helpful? Give feedback.
All reactions