Linear-time near-optimum-length triangulation algorithm for convex polygons

被引：0
|
作者：
Kantabutra, Vitit [1 ]
机构：
[1] State Univ of New York, Brockport, United States
来源：
Journal of Computer and System Sciences | 1994年 / 49卷 / 02期
关键词：
Algorithms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：325 / 333
相关论文
共 50 条
  • [31] COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
    Liou, W. T.
    Tang, C. Y.
    Lee, R. C. T.
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1991, 1 (02) : 137 - 185
  • [32] NEWTON SKETCH: A NEAR LINEAR-TIME OPTIMIZATION ALGORITHM WITH LINEAR-QUADRATIC CONVERGENCE
    Pilanci, Mert
    Wainwright, Martin J.
    SIAM JOURNAL ON OPTIMIZATION, 2017, 27 (01) : 205 - 245
  • [33] A linear-time approximation algorithm for the minimum-length geometric embedding of trees
    Bagheri, Alireza
    Keshavarz-Kohjerdi, Fatemeh
    Razzazi, Mohammadreza
    OPTIMIZATION, 2024,
  • [34] Linear-time algorithm for the generation of trees
    Algorithmica (New York), 1997, 17 (02):
  • [35] A Linear-Time Algorithm for Seeds Computation
    Kociumaka, Tomasz
    Kubica, Marcin
    Radoszewski, Jakub
    Rytter, Wojciech
    Walen, Tomasz
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (02)
  • [36] A linear-time majority tree algorithm
    Amenta, N
    Clarke, F
    John, KS
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2003, 2812 : 216 - 227
  • [37] A linear-time algorithm for the generation of trees
    L. Alonso
    J. L. Rémy
    R. Schott
    Algorithmica, 1997, 17 : 162 - 182
  • [38] A LINEAR-TIME ALGORITHM FOR FINDING AN AMBITUS
    MISHRA, B
    TARJAN, RE
    ALGORITHMICA, 1992, 7 (5-6) : 521 - 554
  • [39] A linear-time algorithm for the generation of trees
    Alonso, L
    Remy, JL
    Schott, R
    ALGORITHMICA, 1997, 17 (02) : 162 - 182
  • [40] Linear-time CSG rendering of intersected convex objects
    Stewart, N
    Leach, G
    John, S
    WSCG'2002, VOLS I AND II, CONFERENCE PROCEEDINGS, 2002, : 437 - 444
12345