Abstract
This note deals with the proof of the following Theorem Given are N blue and N red points in the Euclidean plane such that no 3 of them are collinear; then blue and red points can be connected one-to-one by straight line segments such that no segments intersect.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dijkstra, E.W. (1997). Courtesy Dr. Birgit Schieder (EWD1215). In: Broy, M., Schieder, B. (eds) Mathematical Methods in Program Development. NATO ASI Series, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60858-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-60858-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64588-4
Online ISBN: 978-3-642-60858-2
eBook Packages: Springer Book Archive