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 条
  • [21] A developer's survey of polygonal simplification algorithms
    Luebke, DP
    IEEE COMPUTER GRAPHICS AND APPLICATIONS, 2001, 21 (03) : 24 - 35
  • [22] A Comparative Study on Polygonal Mesh Simplification Algorithms
    Yirci, Murat
    Ulusoy, Ilkay
    2009 IEEE 17TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE, VOLS 1 AND 2, 2009, : 85 - 88
  • [23] Tabu Split and Merge for the Simplification of Polygonal Curves
    Menier, Gildas
    Marteau, Pierre-Francois
    2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 1322 - 1327
  • [24] Bi-arc path planning with time and angle constraints
    Yang X.
    Cao W.
    Zhang Y.
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2019, 41 (08): : 1835 - 1843
  • [25] Optimal perturbation guidance with constraints on terminal flight-path angle and angle of attack
    Zhao, Penglei
    Chen, Wanchun
    Yu, Wenbin
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART G-JOURNAL OF AEROSPACE ENGINEERING, 2019, 233 (12) : 4436 - 4446
  • [26] Volume and Normal Field Based Simplification of Polygonal Models
    Hussain, Muhammad
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2013, 29 (02) : 267 - 279
  • [27] Efficient Observer-Dependent Simplification in Polygonal Domains
    Zarei, Alireza
    Ghodsi, Mohammad
    ALGORITHMICA, 2012, 62 (3-4) : 842 - 862
  • [28] Efficient Observer-Dependent Simplification in Polygonal Domains
    Alireza Zarei
    Mohammad Ghodsi
    Algorithmica, 2012, 62 : 842 - 862
  • [29] Approximate curve-restricted simplification of polygonal curves
    Rudi, Ali Gholami
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2021, 6 (02) : 178 - 187
  • [30] Dynamic view-dependent simplification for polygonal models
    Xia, JC
    Varshney, A
    VISUALIZATION '96, PROCEEDINGS, 1996, : 327 - +
12345