Optimal line bipartitions of point sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 45-54

  Devillers, Olivier ^a   Katz, Matthew J ^b  

^a INRIA   (France)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONVEX HULL; CONVEX POLYGON; FOLLOWING PROBLEM; LINEAR SOLUTION; LINEAR SPACES; MONOTONE FUNCTIONS; OPTIMAL LINES; OUTPUT-SENSITIVE;

COMPUTATIONAL GEOMETRY;

EID: 84990251736     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009480     Document Type: Conference Paper

References (19)

1. Pankaj 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. In Proc. 4th Annu. ACM Sympos. Comput. 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. O. Devillers and M. Katz. Optimal line bipartitions of point sets. Research Report 2871, INRIA, BP93, 06902 Sophia-Antipolis, France, 1996. http://www.inria.fr/rapports/sophia/rr-2871.html.
6. A. Glozman, K. Kedem, and G. Shpitalnik. Finding optimal bipartitions of points, 1994. manuscript.
7. Alex Glozman, Klara Kedem, and Gregory Shpitalnik. On some geometric selection and optimization problems via sorted matrices. In Proc. 4th Workshop Algorithms Data Struct., volume 955 of Lecture Notes in Computer Science, pages 26–37. Springer-Verlag, 1995.
8. J. Hagauer and G. Rote. Three-clustering of points in the plane. In T. Lengauer, editor, Proc. 1st Annu. European Sympos. Algorithms (ESA’93), volume 726 of Lecture Notes in Computer Science, pages 192–199. Springer-Verlag, 1993.
9. J. Hershberger and S. Suri. Finding tailored partitions. J. Algorithms, 12:431–463, 1991.
10. 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ècnica de Catalunya, Barcelona, Spain, 1995.
11. J. W. Jaromczyk and M. Kowaluk. An efficient algorithm for the Euclidean two-center problem. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 303–311, 1994.
12. M. J. Katz. Improved algorithms in geometric optimization via expanders. In Proc. 3rd Israel Symposium on Theory of Computing and Systems, pages 78–87, 1995.
13. M. J. Katz and M. Sharir. An expander-based approach to geometric optimization. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 198–207, 1993.
14. J. S. B. Mitchell and E. L. Wynters. Finding optimal bipartitions of points and polygons. In Proc. 2nd Workshop Algorithms Data Struct., volume 519 of Lecture Notes in Computer Science, pages 202–213. Springer-Verlag, 1991.
15. C. Monma and S. Suri. Partitioning points and graphs to minimize the maximum or the sum of diameters. In Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs), volume 2, pages 899–912, New York, NY, 1991. Wiley.
16. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166–204, 1981.
17. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
18. J. Rokne, S. Wang, and X. Wu. Optimal bipartitions of point sets. In Proc. 4th Canad. Conf. Comput. Geom., pages 11–16, 1992.
19. Micha Sharir. A near-linear algorithm for the planar 2-center problem. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 106–112, 1996.