论文信息 - Shattering a set of objects in 2d

Shattering a set of objects in 2d

In this paper, we propose an algorithm for shattering a set of disjoint line segments of arbitrary length and orientation placed arbitrarily on a 2D plane. The time and space complexities of our algorithm are O(n2) and O(n), respectively. It is an improvement over the O(n2log n) time algorithm proposed in (R. Freimer, J.S.B. Mitchell, C.D. Piatko, On the complexity of shattering using arrangements, Canadian Conference on Computational Geometry, 1990, pp. 218-222.). A minor modification of this algorithm applies when objects are simple polygons, keeping the time and space complexities invariant.

Tetsuo Asano | Subhas C. Nandy | Tomohiro Harayama

[1] Joseph S. B. Mitchell,et al. On the Complexity of Shattering Using Arrangements , 1991 .

[2] Otfried Cheong,et al. Separating and Shattering Long Line Segments , 1996, ISAAC.

[3] Leonidas J. Guibas,et al. The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..

[4] Micha Sharir,et al. On the Union of Fat Wedges and Separating a Collection of Segments By a Line , 1993, Comput. Geom..

[5] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[7] Stephen A. Vavasis,et al. Investigations in geometric subdivisions: linear shattering and cartographic map coloring , 2000 .

[8] F. Frances Yao,et al. Finding the Convex Hull of a Simple Polygon , 1983, J. Algorithms.