ACM Home Page
Please provide us with feedback. Feedback
Generalizing ham sandwich cuts to equitable subdivisions
Full text PdfPdf (942 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the fifteenth annual symposium on Computational geometry table of contents
Miami Beach, Florida, United States
Pages: 49 - 58  
Year of Publication: 1999
ISBN:1-58113-068-6
Authors
Sergei Bespamyatnikh  Department of Computer Science, University of British Columbia
David Kirkpatrick  Department of Computer Science, University of British Columbia
Jack Snoeyink  Department of Computer Science, University of British Columbia
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/304893.304909
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
P. Agarwal and M. Sharir. Arrangements. In JSrg-Riidiger Sack and Jorge Urrutia, editors, Handbook of Computational Geometry. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 1998.
 
2
I. B~r~ny. Geometric and combinatorial applications of Borsuk's theorem. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume l0 of Algorithms and Cbmbinatorics, pages 235-249. Springer- Verlag, 1993.
 
3
T. K. Dey. Improved bounds on planar ksets and related problems. Discrete Comput. Geom., 19:373-382, 1998.
 
4
M. Diaz and J. O'Rourke. Ham-sandwich sectioning of polygons. In Proc. 2nd CCCG, pages 282-286, 1990.
 
5
D. P. Dobkin and H. Edelsbrunner. Hamsandwich theorems applied to intersection problems. In Proc. l Oth Internat. Workshop Graph-Theoret. Concepts Comput. Sci., pages 88-99. 1984.
 
6
 
7
 
8
 
9
 
10
A. Kaneko and M. Kano. Balanced partitions of two sets of points in the plane. In CCCG, 1998. Extended Abstract.
11
 
12
C.-Y. Lo, J. Matou~ek, and W. L. Steiger. Algorithms for ham-sandwich cuts. Discrete Comput. Geom., 11:433-452, 1994.
 
13
C.-Y. Lo and W. Steiger. An optimal-time algorithm for ham-sandwich cuts in the plane. In Proc. 2nd Canad. Conf. Comput. Geom., pages 5-9, 1990.
 
14
M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Cornput. Syst. Sci., 23"166-204, 1981.
 
15
T. Sakai. Radial partitions of point sets in r2. In Proc. of the Japan Conference on Discrete and Comp. Geom., 1998.
 
16
W. Steiger. Algorithms for ham sandwich cuts. In Proc. 5th CCCG, page 48, 1993.
 
17
 
18
R. T. Zivaljevid and S. T. Vredica. An extension of the ham sandwich theorem. Bull. London Math. Soc., 22"183-186, 1990.


Collaborative Colleagues:
Sergei Bespamyatnikh: colleagues
David Kirkpatrick: colleagues
Jack Snoeyink: colleagues

Peer to Peer - Readers of this Article have also read: