Using constraints in Delaunay and greedy triangulation for contour lines improvement

被引:0
作者
Kolingerová, I [1 ]
Strych, V
Cada, V
机构
[1] Univ W Bohemia, Dept Comp Sci & Engn, Plzen, Czech Republic
[2] Univ W Bohemia, Dept Math, Plzen, Czech Republic
来源
COMPUTATIONAL SCIENCE - ICCS 2004, PROCEEDINGS | 2004年 / 3039卷
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Automatic computation of contour lines on a triangulation is a difficult problem because due to input data digitization and the type of triangulation used, some triangles can be a source of a strange behaviour of the contour lines. In this paper, we show what problems can appear in contour lines when Delaunay or greedy triangulations are used and how the contour lines can be improved using constraints in the triangulation. We improved contour lines by manually imposing constraints in a triangulation editing program. Automation of this process is a next step of our work.
引用
收藏
页码:123 / 130
页数:8
相关论文
共 13 条
  • [1] An improved incremental algorithm for constructing restricted Delaunay triangulations
    Anglada, MV
    [J]. COMPUTERS & GRAPHICS, 1997, 21 (02) : 215 - 223
  • [2] AURENHAMMER F, 1991, COMPUT SURV, V23, P345, DOI 10.1145/116873.116880
  • [3] DEBERG M, 1997, COMPUTATIONL GEOMETR
  • [4] Dickerson M. T., 1994, Proceedings of the Tenth Annual Symposium on Computational Geometry, P211, DOI 10.1145/177424.177649
  • [5] DATA DEPENDENT TRIANGULATIONS FOR PIECEWISE LINEAR INTERPOLATION
    DYN, N
    LEVIN, D
    RIPPA, S
    [J]. IMA JOURNAL OF NUMERICAL ANALYSIS, 1990, 10 (01) : 137 - 154
  • [6] Improvements to randomized incremental Delaunay insertion
    Kolingerová, I
    Zalik, B
    [J]. COMPUTERS & GRAPHICS-UK, 2002, 26 (03): : 477 - 490
  • [7] KRCHO J, 2001, GEORELIEF GEOLOGICKE, P269
  • [8] FAST ALGORITHMS FOR GREEDY TRIANGULATION
    LEVCOPOULOS, C
    LINGAS, A
    [J]. BIT, 1992, 32 (02): : 280 - 296
  • [9] Okabe A, 1992, SPATIAL TESSELATIONS
  • [10] Preparata F., 2012, Computational geometry: an introduction