FINDING MINIMAL CONVEX NESTED POLYGONS

被引：34

作者：

AGGARWAL, A

BOOTH, H

OROURKE, J

SURI, S

YAP, CK

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,DIV RES,YORKTOWN HTS,NY 10598

[2] JOHNS HOPKINS UNIV,DEPT ELECT ENGN & COMP SCI,BALTIMORE,MD 21218

[3] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

INFORMATION AND COMPUTATION | 1989年 / 83卷 / 01期

关键词：

D O I：

10.1016/0890-5401(89)90049-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：98 / 110

页数：13

共 14 条

[1]

AGGARWAL A, 1987, ALGORITHMICA, V2, P209

[2] Minimum area circumscribing Polygons [J].

Aggarwal, Alok ;

Chang, J. S. ;

Yap, Chee K. .

VISUAL COMPUTER, 1985, 1 (02) :112-117

[3]

AHO AY, 1974, DESIGN ANAL ALGORITH, P5

[4]

Chang J. S., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P408, DOI 10.1109/SFCS.1984.715942

[5]

DEPANO A, 1987, THESIS J HOPKINS U

[6]

DEPANO NAA, 1983, 22ND P ALL C COMM CO, P81

[7] CIRCUMSCRIBING A CONVEX POLYGON BY A POLYGON OF FEWER SIDES WITH MINIMAL AREA ADDITION [J].

DORI, D ;

BENBASSAT, M .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1983, 24 (02) :131-159

[8]

EDELSBRUNNER H, 1987, INFORM COMPUT, V77, P218

[9] FINDING THE SMALLEST TRIANGLES CONTAINING A GIVEN CONVEX POLYGON [J].

KLEE, V ;

LASKOWSKI, MC .

JOURNAL OF ALGORITHMS, 1985, 6 (03) :359-375

[10] AN OPTIMAL ALGORITHM FOR FINDING MINIMAL ENCLOSING TRIANGLES [J].

OROURKE, J ;

AGGARWAL, A ;

MADDILA, S ;

BALDWIN, M .

JOURNAL OF ALGORITHMS, 1986, 7 (02) :258-269

← 1 2 →