Polygonal path simplification with angle constraints

被引：7
|
作者：
Chen, DZ
Daescu, O [1 ]
Hershberger, J
Kogge, PM
Mi, NF
Snoeyink, J
机构：
[1] Univ Texas, Dept Comp Sci, Richardson, TX 75083 USA
[2] Univ Notre Dame, Dept Comp Sci & Eng, Notre Dame, IN USA
[3] Mentor Graph Corp, Wilsonville, OR 97070 USA
[4] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC 27599 USA
来源：
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | 2005年 / 32卷 / 03期
基金：
美国国家科学基金会;
关键词：
path simplification; angle constraint; computational geometry; off-line search;
D O I：
10.1016/j.comgeo.2004.09.003
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We present efficient geometric algorithms for simplifying polygonal paths in R 2 and R 3 that have angle constraints, improving by nearly a linear factor over the graph-theoretic solutions based on known techniques. The algorithms we present match the time bounds for their unconstrained counterparts. As a key step in our solutions, we formulate and solve an off-line ball exclusion search problem, which may be of interest in its own right. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：173 / 187
页数：15
相关论文
共 50 条
  • [31] Simplification algorithm for large polygonal model in distributed environment
    Tang, Xinting
    Jia, Shixiang
    Li, Bo
    ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF THEORETICAL AND METHODOLOGICAL ISSUES, 2007, 4681 : 960 - +
  • [32] SimpliPoly: Curvature-based polygonal curve simplification
    Guha, Sumanta
    Janecek, Paul
    Song, Nguyen Duc Cong
    GRAPP 2007: PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS THEORY AND APPLICATIONS, VOL GM/R, 2007, : 166 - 171
  • [33] Area-Preserving Simplification and Schematization of Polygonal Subdivisions
    Buchin, Kevin
    Meulemans, Wouter
    Van Renssen, Andre
    Speckmann, Bettina
    ACM TRANSACTIONS ON SPATIAL ALGORITHMS AND SYSTEMS, 2016, 2 (01)
  • [34] Shape simplification through polygonal approximation in the Fourier domain
    Andrews, Mark
    Kakarala, Ramakrishna
    INTELLIGENT ROBOTS AND COMPUTER VISION XXXII: ALGORITHMS AND TECHNIQUES, 2015, 9406
  • [35] Simplification and repair of polygonal models using volumetric techniques
    Nooruddin, FS
    Turk, G
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2003, 9 (02) : 191 - 205
  • [36] Out-of-core simplification of large polygonal models
    Lindstrom, P
    SIGGRAPH 2000 CONFERENCE PROCEEDINGS, 2000, : 259 - 262
  • [37] A robust method for polygonal approximation by line simplification and smoothing
    Barrera Sanchez, Pablo
    Mendez Cruz, Ivan
    Guzman Macedo, Miguel Raz
    2023 MEXICAN INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE, ENC, 2024,
  • [38] Control parameter for polygonal simplification applied to medical images
    Ortega, D. R.
    Gutierrez, G.
    Iznaga, A. M.
    Rodriguez, T.
    de Beule, M.
    Verhegghe, B.
    REVISTA INTERNACIONAL DE METODOS NUMERICOS PARA CALCULO Y DISENO EN INGENIERIA, 2015, 31 (01): : 36 - 41
  • [39] An Efficient Visualization Method for Polygonal Data with Dynamic Simplification
    Wu, Mingguang
    Chen, Taisheng
    Zhang, Kun
    Jing, Zhimin
    Han, Yangli
    Chen, Menglin
    Wang, Hong
    Lv, Guonian
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2018, 7 (04):
  • [40] SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION
    Chuon, Chansophea
    Guha, Sumanta
    Janecek, Paul
    Nguyen Duc Cong Song
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2011, 21 (04) : 417 - 429
12345