A POLYNOMIAL SOLUTION FOR THE POTATO-PEELING PROBLEM

被引：49
作者：
CHANG, JS
YAP, CK
机构：
来源：
DISCRETE & COMPUTATIONAL GEOMETRY | 1986年 / 1卷 / 02期
关键词：
D O I：
10.1007/BF02187692
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：155 / 182
页数：28
相关论文
共 23 条
[1]  
AGGARWAL A, IN PRESS INT J COMPU
[2]  
BENOR M, 1984, 16TH P ANN ACM S THE, P457
[3]  
BOYCE JE, 1982, 14TH STOC, P282
[4]  
Chakerian G. D., 1971, MATH MAG, V44, P57
[5]  
Chang J. S., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P408, DOI 10.1109/SFCS.1984.715942
[6]  
CHAZELLE B, 1984, APR P S THEOR ASP CO
[7]  
DEPANO A, 1984, UNPUB APPROXIMATIONS
[8]  
DEPANO A, 1984, 22ND P ALL C COMM CO
[9]  
Dobkin D. P., 1979, 20th Annual Symposium of Foundations of Computer Science, P9, DOI 10.1109/SFCS.1979.28
[10]   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
123