Weighted ham-sandwich cuts

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

Volumn 3742 LNCS, Issue , 2005, Pages 48-53

  Bose, Prosenjit ^a   Langerman, Stefan ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE;

HAM-SANDWICH CUT; SANDWICH CUTS;

COMPUTATIONAL METHODS;

EID: 33646501734     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11589440_5     Document Type: Conference Paper

References (24)

1. T. Abbott, E. D. Demaine, M. L. Demaine, D. Kane, S. Langerman, J. Nelson, and V. Yeung. Dynamic ham-sandwich cuts of convex polygons in the plane. In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), Windsor, Ontario, Canada, to appear.
2. J. Akiyama, G. Nakamura, E. Rivera-Campo, and J. Urrutia. Perfect divisions of a cake. In Proc. Canad. Conf. Comput. Geom. (CCCG 98), pages 114-115, 1998.
3. S. Bereg, P. Bose, and D. Kirkpatrick. Equitable subdivisions of polygonal regions. Comput. Geom. Theory and Appl., to appear.
4. S. Bespamyatnikh, D. Kirkpatrick, and J. Snoeyink. Generalizing ham sandwich cuts to equitable subdivisions. Discrete Comput. Geom., 24:605-622, 2000.
5. P. Bose, E. D. Demaine, F. Hurtado, J. Iacono, S. Langerman, and P. Morin. Geodesic ham-sandwich cuts. In Proc. of the 2004 ACM Symp. on Computational Geometry, pages 1-9, 2004.
6. T. Chan. Remarks on k-level algorithms in the plane. Manuscript, 1999.
7. H. Chien and W. Steiger. Some geometric lower bounds. In Proc. 6th Annu. Internat. Sympos. Algorithms Comput., volume 1004 of LNCS, pages 72-81. Springer-Verlag, 1995.
8. M. Díaz and J. O'Rourke. Ham-sandwich sectioning; of polygons. In Proc. Canad. Conf. Comput. Geom. (CCCG 90), pages 282-286, 1990.
9. H. Edelsbrunner and E. P. Mücke. Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1):66-104, 1990.
10. H. Edelsbrunner and R. Waupotitisch. Computing a ham sandwich cut in two dimensions. J. Symbolic Comput., 2:171-178, 1986.
11. J. Erickson. Lower bounds for linear satisfiability problems. Chicago J. Theorel. Comp. Sci., (8), 1999.
12. J. Erickson. New lower bounds for convex hull problems in odd dimensions. SIAM J. Comput., 28:1198-1214, 1999.
13. J. Erickson and R. Seidel. Better lower bounds on detecting affine and spherical degeneracies. Discrete Comput. Geom., 13:41-57, 1995.
14. 2) problems in computational geometry. Comput. Geom. Theory and Appl., 5:165-185, 1995.
15. H. Ito, H. Uehara, and M. Yokoyama. 2-dimension ham sandwich theorem for partitioning into three convex pieces. In Proc. Japan. Conf. Discrete Comput. Geom. (JCDCG'98), volume 1763 of Lecture Notes in Computer Science, pages 129-157. Springer-Verlag, 1998.
16. H. Ito, H. Uehara, and M. Yokoyama. A generalization of 2-dimension ham sandwich theorem. TIEICE: IEICE Trans. Comm./Elec./Inf./Sys., 2001.
17. S. Langerman and W. Steiger. Optimization in arrangements. In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003), volume 2607 of LNCS, pages 50-61. Springer-Verlag, 2003.
18. C.-Y. Lo, J. Matoušek, and W. L. Steiger. Algorithms for ham-sandwich cuts. Discrete Comput. Geom., 11:433-452, 1994.
19. C.-Y. Lo and W. L. Steiger. An optimal time algorithm for ham-sandwich cuts in the plane. In Proc. Canad. Conf. Comput. Geom. (CCCG 90), pages 5-9, 1990.
20. J. Matousek. Using the Borsuk-Ulam theorem. Springer, 2003.
21. N. Megiddo. Partitioning with two lines in the plane. J. Algorithms, pages 430-433, 1985.
22. E. A. Ramos. Equipartition of mass distributions by hyperplanes. Discrete Comput. Geom., 15(2):147-167, Feb. 1996.
23. I. Stojmenovic. Bisections and ham-sandwich cuts of convex polygons and polyhedra. Inf. Process. Lett., 38(1):15-21, 1991.
24. A. H. Stone and J. W. Tukey. Generalized 'sandwich' theorems. Duke Math. J., 9:356-359, 1942.