A polygonal decomposition algorithm for planar parametric curves

被引：0
|
作者：
Guo, Fenghua [1 ]
Zhang, Caiming [1 ,2 ]
机构：
[1] School of Computer Science and Technology, Shandong University, Jinan 250061, China
[2] School of Computer Science and Technology, Shandong Economic University, Jinan 250014, China
来源：
Journal of Information and Computational Science | 2006年 / 3卷 / 04期
关键词：
Computer graphics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：737 / 744
相关论文
共 50 条
  • [41] Detection of parametric curves based on genetic algorithm
    Li, HM
    Wu, CK
    INTERNATIONAL SYMPOSIUM ON MULTISPECTRAL IMAGE PROCESSING, 1998, 3545 : 66 - 69
  • [42] An algorithm for the approximation of range data by parametric curves
    Ross, C
    Mason, JC
    ADVANCED MATHEMATICAL AND COMPUTATIONAL TOOLS IN METROLOGY V, 2001, 57 : 307 - 314
  • [43] A continuation algorithm for planar implicit curves with singularities
    Gomes, Abel J. P.
    COMPUTERS & GRAPHICS-UK, 2014, 38 : 365 - 373
  • [44] Determination of envelope to family of planar parametric curves and envelope singularities
    Argyris, J
    Litvin, FL
    Lian, QM
    Lagutin, SA
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 1999, 175 (1-2) : 175 - 187
  • [45] Quadratic Algebraic Curve Approximate Implicitization for Planar Parametric Curves
    DING Youdong LI Min HUA Xuanji School of Computer Engineering and Shanghai University Shanghai China
    Department of Mathematics Fudan University Shanghai China
    Journal of Shanghai University, 2000, (S1) : 16 - 20
  • [46] Toward computerized determination of envelope to family of parametric planar curves
    Bonandrini, Giovanni
    Mimmi, Giovanni
    Rottenbacher, Carlo
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2009, 198 (27-29) : 2218 - 2224
  • [47] An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
    Horng, JH
    Li, JT
    PATTERN RECOGNITION LETTERS, 2002, 23 (1-3) : 171 - 182
  • [48] An Online Polygonal Approximation of Digital Signals and Curves with Dynamic Programming Algorithm
    Kolesnikov, Alexander
    19TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOLS 1-6, 2008, : 1770 - 1773
  • [49] A discrete particle swarm algorithm for optimal polygonal approximation of digital curves
    Yin, PY
    JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION, 2004, 15 (02) : 241 - 260
  • [50] Delaunay based algorithm for finding polygonal voids in planar point sets
    Alonso, R.
    Ojeda, J.
    Hitschfeld, N.
    Hervias, C.
    Campusano, L. E.
    ASTRONOMY AND COMPUTING, 2018, 22 : 48 - 62
12345