On the area bisectors of a polygon

Discrete and Computational Geometry

Volumn 22, Issue 2, 1999, Pages 269-285

  Bohringer K F ^a   Donald, B R ^b   Halperin, D ^c  

^a University of Washington   (United States)

^b Dartmouth College   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039844387     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/pl00009460     Document Type: Article

References (16)

1. K.-F. Böhringer. Programmable Force Fields for Distributed Manipulation, and Their Implementation Using Microfabricated Actuator Arrays. Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY, Aug. 1997.
2. K.-F. Böhringer, V. Bhatt, and K. Y. Goldberg. Sensorless manipulation using transverse vibrations of a plate. In Proc. IEEE International Conference on Robots and Automation (ICRA), pages 1989-1996, Nagoya, May 1995. www.ee.washington.edu/research/mems/Projects/VibratoryPlate.
3. K.-F. Böhringer, B. R. Donald, and N. C. MacDonald. Upper and lower bounds for programmable vector fields with applications to MEMS and vibratory plate parts feeders. In J.-P. Laumond and M. Overmars, editors, Algorithms for Robotic Motion and Manipulation, pages 255-276. A. K. Peters, Wellesley, MA, 1997. www.ee.washington.edu/research/mems/Projects/PFF.
4. K.-F. Böhringer, B. R. Donald, N. C. MacDonald, G. T. A. Kovacs, and J. W. Suh. Computational methods for design and control of MEMS micromanipulator arrays. IEEE Comput. Sci. Engrg, 4(1):17-29, January-March 1997.
5. T. K. Dey. Improved bounds on planar k-sets and k-levels. In Proc. 38th Annual Symposium on Foundations of Computer Science, pages 156-161, Miami Beach, FL, 20-22 Oct. 1997.
6. M. G. Díaz. Algorithms for Balanced Partitioning of Polygons and Point Sets. Ph.D. thesis, Johns Hopkins University, Baltimore, MD, 1990.
7. M. Díaz and J. O'Rourke. Ham-sandwich sectioning of polygons. In Proc. 2nd Canadian Conference on Computational Geometry, pages 98-101, Ottawa, 1990.
8. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, 1987.
9. H. Edelsbrunner, L. Guilbas, J. Pach, R. Pollack, R. Seidel, and M. Sharir. Arrangements of curves in the plane: topology, combinatorics, and algorithms. Theoret. Comput. Sci., 92:319-336, 1992.
10. H. Edelsbrunner and E. Welzl. On the number of line separations of a finite set in the plane. J. Combin. Theory Ser. A, 31(1):15-29, 1985.
11. L. J. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. Graphs, 4:74-123, 1985.
12. D. Halperin. Arrangements. In J. E. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 21, pages 389-412. CRC Press, Boca Raton, FL, 1997.
13. S. Har-Peled. The complexity of many cells in the overlay of many arrangements. M.Sc. thesis, Department of Computer Science, Tel Aviv University, Tel Aviv, 1995.
14. J. O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1994.
15. M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Systems Sci., 23:166-204, 1981.
16. T. C. Shermer. A linear algorithm for bisecting a polygon. Inform. Process. Lett., 41:135-140, 1992.