Loading...
Please wait, while we are loading the content...
Similar Documents
Separating point sets in polygonal environments (2004)
| Content Provider | CiteSeerX |
|---|---|
| Author | Meijer, Henk Erickson, Jeff Iacono, John Whitesides, Sue Demaine, Erik D. Overmars, Mark Langerman, Stefan Hurtado, Ferran |
| Description | in Proceedings of the 20th Annual ACM Symposium on Computational Geometry |
| Abstract | We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the interior of a polygon, we provide necessary and sufficient conditions for the existence of a chord and for the existence of a geodesic path which separate the two sets; when they exist we also derive efficient algorithms for their obtention. We study as well the separation of the two sets using a minimum number of pairwise non-crossing chords. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Polygonal Environment Red Point Blue Point Geodesic Line Pairwise Non-crossing Chord Geodesic Path |
| Content Type | Text |
| Resource Type | Proceeding Conference Proceedings |
