Separability by two lines and by nearly straight polygonal chains

Discrete Applied Mathematics

Volumn 144, Issue 1-2, 2004, Pages 110-122

  Hurtado, Ferran ^a   Mora, Mercè ^a   Ramos, Pedro A ^b   Seara, Carlos ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

Double wedge; Polygonal chain; Red blue separability

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

DOUBLE WEDGE; POLYGONAL CHAINS; RED-BLUE SEPARABILITY;

COMPUTATIONAL GEOMETRY;

EID: 4544362472     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.11.014     Document Type: Article

References (19)

1. E.M. Arkin, F. Hurtado, J.S.B. Mitchell, C. Seara, S.S. Skiena, Some lower bounds on geometric separability problems, in: 11th Fall Workshop on Computational Geometry,2001.
2. D. Avis, B. Beresford-Smith, L. Devroye, H. Elgindy, E. Guévremont, F. Hurtado, B. Zhu, Unoriented Θ-maxima in the plane: complexity and algorithms, SIAM J. Comput. 28 (1) (1999) 278-296.
3. D. Avis, H. Elgindy, R. Seidel, Simple on-line algorithms for convex polygons, in: G.T. Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 23-42.
4. J.L. Bentley, T.A. Ottmann, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. 28 (1979) 643-647.
5. B.K. Bhathacharya, Circular separability of planar point sets, in: G.T. Toussaint (Ed.), Computational Morphology, North-Holland, Amsterdam, 1988, pp. 25-39.
6. J.-D. Boissonnat, J. Czyzowicz, O. Devillers, J. Urrutia, M. Yvinec, Computing largest circles separating two sets of segments, Internat. J. Comput. Geom. Appl. 10 (1) (2000) 41-53.
7. B.M. Chazelle, H. Edelsbrunner, An optimal algorithm for intersecting line segments, in: Proceedings of 29th Annual IEEE Symposium on Foundations of Computer Science,1988.
8. O. Devillers, M.J. Golin, Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas, Inform. Process. Lett. 56 (3) (1995) 157-164.
9. H. Edelsbrunner, Algorithms in combinatorial geometry, EATCS Monographs in Theoretical Computer Science, Vol. 10, Springer, Berlin, 1987.
10. H. Edelsbrunner, F.P. Preparata, Minimum polygonal separation, Inform. Comput. 77 (1988) 218-232.
11. S. Fekete, On the complexity of min-link red-blue separation, Manuscript, 1992.
12. M.E. Houle, Algorithms for weak and wide separation of sets, Discrete Appl. Math. 45 (1993) 139-159.
13. F. Hurtado, M. Noy, P.A. Ramos, C. Seara, Separating objects in the plane with wedges and strips, Discrete Appl. Math. 109 (2001) 109-138.
14. 3 and related problems, SIAM J. Comput. 12 (4) (1983) 759-776.
15. F.P. Preparata, M.I. Shamos, Computational Geometry, An Introduction, Springer, Berlin, 1988.
16. D. Rappaport, A convex hull algorithm for discs, and applications, Computational Geometry: Theory and Applications, Vol. 1, 1992, pp. 171-187.
17. C. Seara, On geometric separability, Ph.D. Thesis, Universitat Politècnica de Catalunya, June 2002.
18. G.T. Toussaint, Solving geometric problems with the rotating calipers, Proceedings of IEEE MELECON'83, Athens, Greece, 1983, pp.A10.02/1-4.
19. A.C.C. Yao, Lower bounds for algebraic computation trees with integer inputs, in: Proceedings of 30th Annual IEEE Symposium on Foundations of Computer Science,1989, pp. 308-313.