论文部分内容阅读
在现有的最近井距扫描算法中,只考虑了最近距离点唯一的情况,无法处理最近距离点为多个乃至无穷的情况。在比较井圆弧井段上利用圆弧的垂向轴线建立了局部直角坐标系,使用初等几何方法给出了计算点到圆弧井段的最近距离点的新方法,涵盖了点与圆弧之间的位置关系的全部五种可能的情况。求出了整体坐标系到局部坐标系的变换矩阵。分析了点与稳斜井段之间的三种位置关系,给出了点到稳斜井段的最近距离的计算公式。新方法揭示了点到圆弧井段的最近距离点可能不是唯一的;在某些情况下,最近距离点有两个或者无穷多个。分析了经典的最近距离扫描图的缺点,用实例证明了经典绘图方法丢失了井深信息,提出了一种新的最近距离扫描图的绘图方法。本文方法适用于比较井为实钻轨迹或者圆弧型设计轨迹的邻井最近距离计算。
In the existing nearest wellbore scanning algorithm, only the nearest distance point is considered, and the situation that the nearest distance point is multiple or even infinite can not be dealt with. A local rectangular coordinate system was established by using the vertical axis of the circular arc in comparison with the well section and a new method of calculating the nearest distance point from the point to the circular arc section was given by the elementary geometry method. The relationship between all five possible situations. The transformation matrix of the global coordinate system to the local coordinate system is obtained. Three kinds of positional relationships between point and steady inclined section are analyzed, and the formula of the nearest distance between point and stable section is given. The new method reveals that the closest point of distance from a point to a circular arc segment may not be unique; in some cases, there are two or an infinite number of the closest distance points. The shortcomings of the classical nearest distance scan graph are analyzed. The example shows that the classical plotting method has lost the well depth information, and a new nearest distance scan graph mapping method is proposed. The method proposed in this paper can be used to calculate the nearest distance between adjacent wells of well trajectories or arc-shaped design trajectories.