Computing largest circles separating two sets of segments

International Journal of Computational Geometry and Applications

Volumn 10, Issue 1, 2000, Pages 41-53

  Boissonnat, Jean Daniel ^a   Czyzowicz, Jurek ^b   Devillers, Olivier ^a   Urrutia, Jorge ^d   Yvinec, Mariette ^c  

^a INRIA   (France)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^c UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^d NONE

Author keywords

Circles; Computational geometry; Separability

Indexed keywords

EID: 0034391287     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000036     Document Type: Article

References (20)

1. A. Aggarwal, H. Booth, J. O'Rourke, Subhash Suri, and C. K. Yap. Finding minimal convex nested polygons. Inform. Comput., 83(1):98-110, October 1989.
2. B. K. Bhattacharya. Circular separability of planar point sets. In G. T. Toussaint, editor, Computational Morphology, pages 25-39. North-Holland, Amsterdam, Netherlands, 1988.
3. J.-D. Boissonnat, J. Czyzowicz, O. Devillers, and M. Yvinec. Circular separability of polygons. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 273-281, 1995.
4. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom., 14:263-279, 1995.
5. B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir, and J. Snoeyink. Computing a face in an arrangement of line segments and related problems. SIAM J. Comput., 22:1286-1302, 1993.
6. G. Das and D. Joseph. The complexity of minimum convex nested polyhedra. In Proc. 2nd Canad. Conf. Comput. Geom., pages 296-301, 1990.
7. M. de Berg, K. Dobrindt, and O. Schwarzkopf. On lazy randomized incremental construction. Discrete Comput. Geom., 14:261-286, 1995.
8. D. P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6:381-392, 1985.
9. H. Edelsbrunner, L. J. Guibas, and M. Sharir. The complexity of many cells in arrangements of planes and related problems. Discrete Comput. Geom., 5:197-216, 1990.
10. H. Edelsbrunner and F. P. Preparata. Minimum polygonal separation. Inform. Comput., 77:218-232, 1988.
11. S. Fisk. Separating points by circles and the recognition of digital discs. IEEE Trans. Pattern Anal. Mach. Intell., 8(4):554-556, 1986.
12. C. E. Kim and T. Anderson. Digital disks. IEEE Trans. Pattern Anal. Mach. Intell., PAMI-6(5):639-645, 1984.
13. D. G. Kirkpatrick. Efficient computation of continuous skeletons. In Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci., pages 18-27, 1979.
14. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12(1):28-35, 1983.
15. D. T. Lee and R. L. Drysdale, III. Generalization of Voronoi diagrams in the plane. SIAM J. Comput., 10:73-87, 1981.
16. U. Manber and M. Tompa. The complexity of problems on probabilistic, nondeterministic, and alternating decision trees. J. ACM, 32(3):720-732, 1985.
17. N. Megiddo. Linear programming in linear time when the dimension is fixed. J. ACM, 31:114-127, 1984.
18. J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral objects. Comput. Geom. Theory Appl., 5:95-114, 1995.
19. D. M. Mount. Intersection detection and separators for simple polygons. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 303-311, 1992.
20. J. O'Rourke, S. R. Kosaraju, and N. Megiddo. Computing circular separability. Discrete Comput. Geom., 1:105-113, 1986.