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 条

[1] A LINEAR-TIME NEAR-OPTIMUM-LENGTH TRIANGULATION ALGORITHM FOR CONVEX POLYGONS
KANTABUTRA, V
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 49 (02) : 325 - 333
[2] A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons
Jianbo Qian
Cao An Wang
Algorithmica , 2004, 40 : 161 - 172
[3] A linear-time approximation scheme for maximum weight triangulation of convex polygons
Qian, JB
Wang, CA
ALGORITHMICA, 2004, 40 (03) : 161 - 172
[4] A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons
C. Levcopoulos
D. Krznaric
Algorithmica, 1998, 21 : 285 - 311
[5] A linear-time approximation scheme for minimum weight triangulation of convex polygons
Levcopoulos, C
Krznaric, D
ALGORITHMICA, 1998, 21 (03) : 285 - 311
[6] An almost linear-time algorithm for trapezoidation of GIS polygons
Lorenzetto, GP
Datta, A
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2004, 20 (07): : 1145 - 1155
[7] A linear time algorithm for max-min length triangulation of a convex polygon
Hu, Shiyan
INFORMATION PROCESSING LETTERS, 2007, 101 (05) : 203 - 208
[8] A LINEAR-TIME ALGORITHM FOR ROUTING IN A CONVEX GRID
KAUFMANN, M
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (02) : 180 - 184
[9] A LINEAR-TIME ROUTING ALGORITHM FOR CONVEX GRIDS
NISHIZEKI, T
SAITO, N
SUZUKI, K
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (01) : 68 - 76
[10] A linear-time algorithm for covering simple polygons with similar rectangles
BarYehuda, R
BenHanoch, E
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (01) : 79 - 102

← 1 2 3 4 5 →