Algorithm for Solving the Distance of Planar Line Segments Based on Local Coordinate System

被引：0

作者：

Zhang H. ^{[1
]}

Liu Y. ^{[1
]}

Dai K. ^{[1
]}

Song T. ^{[1
]}

Wang L. ^{[1
]}

Zeng W. ^{[2
]}

Yang Y. ^{[1
]}

机构：

[1] School of Computer Science and Technology, Xi’an Jiaotong University, Xi’an

[2] School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an

来源：

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2023年 / 35卷 / 12期

关键词：

CAD; distance solving; geometric engine; local coordinate system;

D O I：

10.3724/SP.J.1089.2023.2023-00028

中图分类号：

学科分类号：

摘要：

Aiming at the lack of high-speed and high-precision planar line segment distance solving algorithms in the existing CAD geometry engine and VLSI design, we propose a planar line segment distance solving algorithm based on local coordinate system. First, a local coordinate system is established by coordinate transformation; then, according to the relative position relationship between two line segments, the planar line segment distance solving is classified into 12 kinds of nearest point solving cases; finally, the planar line segment distance is solved by computing the distance of the nearest points. The experiments are carried out with PCB line segments data and randomly generated line segments data, and the experiment results show that the algorithm is 23% to 35% more efficient than the compared algorithms. Moreover, the algorithm can still control the computational error in four critical cases, which proves its effectiveness. © 2023 Institute of Computing Technology. All rights reserved.

引用

页码：1966 / 1976

页数：10

共 23 条

[1] Feito F R, Ogayar C J, Segura R J, Et al., Fast and accurate evaluation of regularized Boolean operations on triangulated solids, Computer-Aided Design, 45, 3, pp. 705-716, (2013)
[2] Nehring-Wirxel J, Trettner P, Kobbelt L., Fast exact booleans for iterated CSG using octree-embedded BSPs, Computer-Aided Design, 135, (2021)
[3] Korn G A, Korn T M., Mathematical handbook for scientists and engineers: definitions, theorems, and formulas for reference and review, (2000)
[4] Chen X D, Chen L Q, Wang Y G, Et al., Computing the minimum distance between two Bézier curves, Journal of Computational and Applied Mathematics, 229, 1, pp. 294-301, (2009)
[5] Chang J W, Choi Y K, Kim M S, Et al., Computation of the minimum distance between two Bézier curves/surfaces, Computers & Graphics, 35, 3, pp. 677-684, (2011)
[6] Patrikalakis N M, Maekawa T, Ko K H, Et al., Surface to surface intersections, Computer-Aided Design and Applications, 1, 1-4, pp. 449-457, (2004)
[7] Ratschek H, Rokne J G., How trivial are reliable box-plane intersections?, Computer-Aided Design, 32, 11, pp. 643-648, (2000)
[8] Levin J., A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces, Communications of the ACM, 19, 10, pp. 555-563, (1976)
[9] Chen Xiaodiao, Xu Gang, Wang Yigang, Et al., Curve pencil based intersection for degenerated cases of curves, Journal of Computer-Aided Design & Computer Graphics, 21, 7, pp. 918-923, (2009)
[10] Shamos M I, Hoey D., Geometric intersection problems, Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pp. 208-215, (1976)

← 1 2 3 →