Skip to main content
SpringerLink
Log in

Finding optimal bipartitions of points and polygons

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 519))

Included in the following conference series:

Abstract

We give efficient algorithms to compute an optimal bipartition of a set of points or a set of simple polygons in the plane. We examine various criteria involving the perimeter and the area of the convex hulls of the two subsets.

Partially supported by NSF grants IRI-8710858 and ECSE-8857642, and by a grant from Hughes Research Laboratories. Email: jsbm@orie.cornell.edu

Supported by a grant from Hughes Research Laboratories.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Asano, B. Bhattacharya, M. Keil, and F. Yao. Clustering algorithms based on minimum and maximum spanning trees. In Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, pages 252–257, 1988.

    Google Scholar 

  2. D. Avis. Diameter partitioning. Discrete and Computional Geometry, 1(3):265–276, 1986.

    Google Scholar 

  3. B. Chazelle. Triangulating a simple polygon in linear time. Technical Report CS-TR-264-90, Princeton University, 1990.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  5. S. K. Ghosh and D. M. Mount. An output sensitive algorithm for computing visibility graphs. In Proceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science, pages 11–19, 1987. To appear: SIAM J. Comp.

    Google Scholar 

  6. J. Hershberger and S. Suri. Finding tailored partitions. In Proceedings of the 5th Annual ACM Symposium on Computational Geometry, pages 255–265, 1989.

    Google Scholar 

  7. D. T. Lee. Proximity and Reachability in the Plane. PhD thesis, University of Illinois, 1978.

    Google Scholar 

  8. D. T. Lee and F. P. Preparata. Euclidean shortest paths in the presence of rectilinear barriers. Networks, 14:393–410, 1984.

    Google Scholar 

  9. T. Lozano-Pérez and M. A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22:560–570, 1979.

    Google Scholar 

  10. J. S. B. Mitchell. A new algorithm for shortest paths among obstacles in the plane. Annals of Mathematics and Artificial Intelligence, 3:83–106, 1991.

    Google Scholar 

  11. C. Monma and S. Suri. Partitioning points and graphs to minimize the maximum or the sum of diameters. In Proceedings of the Sixth International Conference on the Theory and Applications of Graphs, 1988.

    Google Scholar 

  12. M. H. Overmars and E. Welzl. New methods for computing visibility graphs. In Proceedings of the Fourth Annual ACM Symposium on Computional Geometry, pages 164–171, 1988.

    Google Scholar 

  13. J. H. Reif and J. A. Storer. Shortest paths in euclidean spaces with polyhedral obstacles. Technical Report CS-85-12, Brandeis University, Waltham, Mass., 1985.

    Google Scholar 

  14. M. Sharir and A. Schorr. On shortest paths in polyhedral spaces. SIAM J. Comp., 15:193–215, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Operations Research & Industrial Engineering, Cornell University, 14853, Ithaca, NY

    Joseph S. B. Mitchell

  2. Center for Applied Mathematics, Cornell University, 14853, Ithaca, NY

    Erik L. Wynters

Authors
  1. Joseph S. B. Mitchell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erik L. Wynters
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mitchell, J.S.B., Wynters, E.L. (1991). Finding optimal bipartitions of points and polygons. In: Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1991. Lecture Notes in Computer Science, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028263

Download citation

  • DOI: https://doi.org/10.1007/BFb0028263

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54343-5

  • Online ISBN: 978-3-540-47566-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation