Abstract
We show that the problem of finding a smallest convex polygon which separates two given finite sets of points in the plane is a special case of the combinatorial problem of finding a minimum transversal of a circular arc system. We present an O(n log n) algorithm for the latter problem. We describe also a close relationship between visibility graphs and intersection graphs. It is furthermore shown that a smallest separating convex polygon is not greater than any separating arbitrary polygon or any separating planar subdivision. Moreover, we determine the number of stages needed for learning convex polygons from examples.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Edelsbrunner and F. P. Preparata. Minimum polygonal separation. Information and Computation, 77:218–232, 1988.
Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Volume Computer Science and Applied Mathematics of Monographs and Textbooks, Academic Press, New York, 1980.
Nathan Linial, Yishai Mansour, and Ronald L. Rivest. Results on learnability and the Vapnik-Chervonenkis dimension. In Proc. of the 29th IEEE Symp. on Foundations of Computer Science, pages 120–129, IEEE, IEEE Computer Society Press, Los Alamitos, CA, October 1988.
Nimrod Megiddo. On the complexity of polyhedral separability. Discrete Computational Geometry, 3:325–337, 1988.
L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134–1142, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fischer, P., Simon, H.U. (1991). Separation problems and circular arc systems. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, vol 484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53832-1_47
Download citation
DOI: https://doi.org/10.1007/3-540-53832-1_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53832-5
Online ISBN: 978-3-540-46310-8
eBook Packages: Springer Book Archive