On the k-cuttable Circular Arcs
碩士 === 逢甲大學 === 應用數學系 === 87 === We show that given a set of n circular arcs on a unit circular, the k-cuttable Circular Arcs (kCCA) problem can be solved in O(kn) time. The kCCA algorithm is based on an existent algorithm for the Minimum cuts for circular arcs (MCCA...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/00517194966472088832 |