Optimal line bipartitions of point sets

International Journal of Computational Geometry and Applications

Volumn 9, Issue 1, 1999, Pages 39-51

  Devillers, Olivier ^a   Katz, Matthew J ^b  

^a INRIA   (France)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Bipartition; Convex hull; Geometric optimization

Indexed keywords

EID: 0033475715     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195999000042     Document Type: Article

References (18)

1. P. K. Agarwal and M. Sharir, "Planar geometric location problems," Algorithmica, 11:185-195, 1994.
2. Te. Asano, B. Bhattacharya, J. M. Keil, and F. Yao, "Clustering algorithms based on minimum and maximum spanning trees," Proc. 4th Annu. ACM Sympos. Gomput. Geom., pages 252-257, 1988.
3. D. Avis, "Diameter partitioning," Discrete Comput. Geom., 1:265-276, 1986.
4. K. L. Clarkson, K. Mehlhorn, and R. Seidel, "Four results on randomized incremental constructions," Comput. Geom. Theory Appl., 3(4):185-212, 1993.
5. A. Glozman, K. Kedem, and G. Shpitalnik, "Finding optimal bipartitions of points," manuscript, 1994.
6. A. Glozman, K. Kedem, and G. Shpitalnik, "On some geometric selection and optimization problems via sorted matrices," Proc. 4th Workshop Algorithms Data Struct., Vol. 955 of Lecture Notes in Computer Science, pages 26-37. Springer-Verlag, 1995.
7. J. Hagauer and G. Rote, "Three-clustering of points in the plane," Proc. 1st Annu. European Sympos. Algorithms (ESA '93), Vol. 726 of Lecture Notes in Computer Science, pages 192-199. Springer-Verlag, 1993.
8. J. Hershberger and S. Suri, "Finding tailored partitions," J. Algorithms, 12:431-463, 1991.
9. F. Hurtado, M. Noy, and S. Whitesides, "Finding optimal k-partitions for points in convex position," Technical Report MA2-IR-95-0010, Departament de Matemàtica Aplicada II, Universitat Politècn ica de Catalunya, Barcelona, Spain, 1995.
10. J. W. Jaromczyk and M. Kowaluk, "An efficient algorithm for the Euclidean two-center problem," Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 303-311, 1994.
11. M. J. Katz, "Improved algorithms in geometric optimization via expanders," Proc. 3rd Israel Symposium on Theory of Computing and Systems, pages 78-87, 1995.
12. M. J. Katz and M. Sharir, "An expander-based approach to geometric optimization," Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 198-207, 1993.
13. J. S. B. Mitchell and E. L. Wynters, "Finding optimal bipartitions of points and polygons," Proc. 2nd Workshop Algorithms Data Struct., Vol. 519 of Lecture Notes in Computer Science, pages 202-213. Springer-Verlag, 1991. Full version available at http://www.ams.sunysb.edu/-jsbm/.
14. C. Monma and S. Suri, "Partitioning points and graphs to minimize the maximum or the sum of diameters," Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs), Vol. 2, pages 899-912, New York, NY, 1991. Wiley.
15. M. H. Overmars and J. van Leeuwen, "Maintenance of configurations in the plane," J. Comput. Syst. Sci., 23:166-204, 1981.
16. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, NY, 1985.
17. J. Rokne, S. Wang, and X. Wu, "Optimal bipartitions of point sets," Proc. 4th Canad. Conf. Comput. Geom., pages 11-16, 1992.
18. M. Sharir, "A near-linear algorithm for the planar 2-center problem," Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 106-112, 1996.