An intersection algorithm for disk B-spline curves

被引:8
|
作者
Ao, Xuefeng [1 ]
Fu, Qian [1 ,2 ]
Wu, Zhongke [1 ]
Wang, Xingce [1 ]
Zhou, Mingquan [1 ]
Chen, Quan [2 ]
Seah, Hock Soon [2 ]
机构
[1] Beijing Normal Univ, 19 XinJieKouWai St, Beijing 100875, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Sci & Engn, Nanyang Ave, Singapore 639798, Singapore
来源
COMPUTERS & GRAPHICS-UK | 2018年 / 70卷
基金
北京市自然科学基金;
关键词
Intersection algorithm; Disk B-spline curve; Clipping method; Newton's method; POINTS;
D O I
10.1016/j.cag.2017.07.021
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we propose a method for finding all 2D intersection regions between disk B-spline curves (DBSCs), which is very crucial for DBSC's wide applications such as computer calligraphy, computer 2D animations, and non-photorealistic rendering. As a DBSC represents a region on a plane, the intersection of two DBSCs is a 2D region. To determine the region, the key is to compute the intersection points of the boundaries of two DBSCs. In our algorithm, the boundary of a DBSC is decomposed into four components: the upper boundary, the lower boundary, the start arc, and the end arc. The intersection of two DBSCs can be converted into the intersections between these four components. The main difficulty is to find the intersection involving the upper and lower boundaries of the two DBSCs, as they are variable offsets from the skeletons of the DBSC that are B-spline curves. In our approach, first the DBSCs are subdivided into several disk Bezier curves (DBCs). Therefore the problem of computing intersections of the DBSCs is converted into computing intersection of two DBCs. Then, the disk Bezier clipping method is proposed to exclude regions that have no intersection for the intersection of the two DBCs. In the case of where there is an intersection, we calculate the comparatively rough intersection to be used as initial values for later refinement through the disk Bezier clipping method. Besides, high precision (up to 10e-15) intersections are achieved by using the Newton's iteration, which is quadratic convergent. The experimental results demonstrate that our algorithm can very efficiently compute all intersections between DBSCs with high precision. Our main contributions in this paper are as follows. First, for the first time, we give the direct parametric expression of DBSC's boundary, which can be simply and conveniently used to compute the properties of DBSC's boundary. Second, our proposed approach of calculating high-accuracy intersections of DBSCs makes DBSC a flexible and effective stroke representation that can be applied to further research such as corresponding computation, automatically coloring, region detection and so on. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:99 / 107
页数:9
相关论文
共 50 条
  • [1] An algorithm for finding intersection between ball B-spline curves
    Fu, Qian
    Wu, Zhongke
    Wang, Xingce
    Zhou, Mingquan
    Zheng, Jianmin
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 327 : 260 - 273
  • [2] Dynamic disk B-spline curves
    Zhang, Yu
    Wu, Zhongke
    Wang, Xingce
    COMPUTER ANIMATION AND VIRTUAL WORLDS, 2020, 31 (4-5)
  • [3] ALGORITHM FOR DEGREE REDUCTION OF B-SPLINE CURVES
    PIEGL, L
    TILLER, W
    COMPUTER-AIDED DESIGN, 1995, 27 (02) : 101 - 110
  • [4] Algorithm for degree reduction of B-spline curves
    Piegl, Les
    Tiller, Wayne
    CAD Computer Aided Design, 1995, 27 (02): : 101 - 110
  • [5] AUTOMATIC FAIRING ALGORITHM FOR B-SPLINE CURVES
    SAPIDIS, N
    FARIN, G
    COMPUTER-AIDED DESIGN, 1990, 22 (02) : 121 - 129
  • [6] AN EFFICIENT ALGORITHM FOR GENERATING B-SPLINE INTERPOLATION CURVES AND SURFACES FROM B-SPLINE APPROXIMATIONS
    WANG, HP
    HEWGILL, DE
    VICKERS, GW
    COMMUNICATIONS IN APPLIED NUMERICAL METHODS, 1990, 6 (05): : 395 - 400
  • [7] Approximating uniform rational B-spline curves by polynomial B-spline curves
    Xu Huixia
    Hu Qianqian
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2013, 244 : 10 - 18
  • [8] A Fingerprint Matching Algorithm Based on B-Spline Curves
    Yuan, HuaQiang
    Xiao, Weimin
    Han, Guoqiang
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 1406 - +
  • [9] An Efficient Method for Computing the Intersection bewteen Two B-Spline Curves
    Wang, Yongao
    Lyu, Hangting
    Chen, Xiaodiao
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2024, 36 (05): : 687 - 700
  • [10] Shape blending of artistic brushstroke represented by disk B-spline curves
    Cheng Min1
    2. Department of Mathematics
    Progress in Natural Science, 2007, (12) : 1501 - 1507