CONVEX HULLS OF OBJECTS BOUNDED BY ALGEBRAIC-CURVES

被引:18
作者
BAJAJ, C [1 ]
KIM, MS [1 ]
机构
[1] POSTECH,DEPT COMP SCI,POHANG 790600,SOUTH KOREA
关键词
COMPUTATIONAL GEOMETRY; ALGORITHMS AND DATA STRUCTURES; ALGEBRAIC GEOMETRY;
D O I
10.1007/BF01759058
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present an O(n.d(O)(1)) algorithm to compute the convex hull of a curved object bounded by O(n) algebraic curve segments of maximum degree d.
引用
收藏
页码:533 / 553
页数:21
相关论文
共 24 条
[1]   Automatic Parameterization of rational curves and surface III: algebraic plane curves [J].
Abhyankar, Shreeram S. ;
Bajaj, Chanderjit L. .
Computer Aided Geometric Design, 1988, 5 (04) :309-321
[2]  
Aho A. V., 1974, DESIGN ANAL COMPUTER
[3]  
BAJAJ C, 1988, CAPO CER8811 PURD U
[4]  
Bajaj C, 1987, ALGORITHMICA, V4, P157
[5]  
BAJAJ C, 1988, CSDTR718 PURD U COMP
[6]   Tracing surface intersections [J].
Bajaj, C.L. ;
Hoffmann, C.M. ;
Lynch, R.E. ;
Hopcroft, J.E.H. .
Computer Aided Geometric Design, 1988, 5 (04) :285-307
[7]   A NEW LINEAR CONVEX-HULL ALGORITHM FOR SIMPLE POLYGONS [J].
BHATTACHARYA, BK ;
ELGINDY, H .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1984, 30 (01) :85-88
[8]  
CANNY J, 1988, ACM DOCTORAL DISSERT
[9]   CALCULATION OF MULTIVARIATE POLYNOMIAL RESULTANTS [J].
COLLINS, GE .
JOURNAL OF THE ACM, 1971, 18 (04) :515-&
[10]   FINDING THE CONVEX-HULL OF A SIMPLE POLYGON [J].
GRAHAM, RL ;
YAO, FF .
JOURNAL OF ALGORITHMS, 1983, 4 (04) :324-331