python中交集_Python中的区域交集

最新推荐文章于 2024-07-15 03:36:57 发布

北風胡馬

最新推荐文章于 2024-07-15 03:36:57 发布

阅读量489

点赞数

文章标签： python中交集

本文链接：https://blog.csdn.net/weixin_36076151/article/details/112033728

版权

本文介绍了如何在Python中使用Shapely库来解决多个区域（由管状线条定义）的交集问题。通过将每个管状区域定义为多边形，并利用几何操作找到它们的交集，实现了高效求解。示例代码展示了如何创建和绘制这些区域以及交集。

摘要由CSDN通过智能技术生成

I have a code that takes a condition C as an input, and computes the solution to my problem as an 'allowed area' A on the (x,y) space. This area is made of several 'tubes', which are defined by 2 lines that can never cross.

The final result I'm looking for must satisfy k conditions {C1, .., Ck}, and is therefore an intersection S between k areas {A1, .. , Ak}.

Here is an example with 2 conditions (A1: green, 3 tubes. A2: purple, 1 tube); the solution S is in red.

How can I find S when I'm dealing with 4 areas of around 10 tubes each? (The final plot is awful!)

I would need to be able to plot it, and to find the mean coordinate and the variance of the points in S (variance of each coordinate). [If there is an efficient way of knowing whether a point P belongs to S or not, I’ll just use a Monte Carlo method].

Ideally, I’d also like to be able to implement “forbidden tubes” that I would remove from S [it might be a bit more complicated than intersecting S with the outside of my forbidden area, since two tubes from the same area can cross (even if the lines defining a tube never cross)].

Note:

The code also stores the arc length of the lines.

The lines are stored as arrays of points (around 1000 points per line). The two lines defining a tube do not necessarily have the same number of points, but Python can interpolate ALL of them as a function of their arc length in 1 second.

The lines are parametric functions (i.e. we cannot write y = f(x), since the lines are allowed to be vertical).

The plot was edited with paint to get the result on the right... Not very efficient!

Edit:

I don't know how I can use plt.fill_between for a multiple intersection (I can do it here for 2 conditions, but I need the code to do it automatically when there are too many lines for eye judgement).

For now I just generate the lines. I didn’t write anything for finding the final solution since I absolutely don’t know which structure is the most adapted for this. [However, a previous version of the code was able to find the intersection points between the lines of 2 different tubes, and I was planning to pass them as polygons to shapely, but this implied several other problems..]

I don't think I can do it with sets: scanning the whole (x,y) area at required precision represents around 6e8 points... [The lines have only 1e3 points thanks to a variable step size (adapts to the curvature), but the whole problem is quite large]

解决方案

Problem solved with Shapely!

I defined each tube as a Polygon, and an area A is a MultiPolygon object built as the union of its tubes.

The intersection method then computes the solution I was looking for (the overlap between all areas).

The whole thing is almost instantaneous. I didn't know shapely was so good with large objects [around 2000 points per tube, 10 tubes per area, 4 areas].

Thank you for your help! :)

Edit:

A working example.

import matplotlib.pyplot as plt

import shapely

from shapely.geometry import Polygon

from descartes import PolygonPatch

import numpy as np

def create_tube(a,height):

x_tube_up = np.linspace(-4,4,300)

y_tube_up = a*x_tube_up**2 + height

x_tube_down = np.flipud(x_tube_up) #flip for correct definition of polygon