Polygon area decomposition for multiple-robot workspace division

International Journal of Computational Geometry and Applications

Volumn 8, Issue 4, 1998, Pages 437-466

  Hert, Susan ^a   Lumelsky, Vladimir ^b  

^a University of Wisconsin Madison   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Area partition; Divide and conquer; Polygon decomposition; Robot workspace partition; Robotics; Sweep line; Terrain covering

Indexed keywords

EID: 0032368780     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000230     Document Type: Article

References (32)

1. B. Aronov. On the geodesic Voronoi diagram of point sites in a simple polygon. Algorithmica, 4:109-140, 1989.
2. Ta. Asano and Te. Asano. Minimum partition of polygonal regions into trapezoids. In Proceedings 24th Annual IEEE Symposium on Foundations of Computer Science, pages 233-241, 1983.
3. B. S. Baker, E. Grosse, and C. S. Rafferty. Nonobtuse triangulation of polygons. Discrete Computational Geometry, 3:147-168, 1988.
4. M. Bern, S. Mitchell, and J. Ruppert. Linear-size nonobtuse triangulation of polygons. In Proceedings 10th Annual ACM Symposium on Computational Geometry, pages 221-230, 1994.
5. V. G. Boltyanskii. Equivalent and Equidecomposible Figures. Topics in Mathematics. D. C. Heath and Company, Boston, 1963.
6. B. Chazelle. Computational Geometry and Convexity. PhD thesis, Yale University, 1980.
7. B. Chazelle and D. Dobkin. Decomposing a polygon into its convex parts. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing, pages 38-48, 1979.
8. C. Chen and R.-C. Chang. On the minimality of polygon triangulation. BIT, 30:570-582, 1990.
9. I. T. Christou and R. R. Meyer. Optimal equi-partition of rectangular domains for parallel computation. Report MP-TR-95-04, University of Wisconsin, Madison, 1995.
10. L. De Floriani and E. Puppo. An on-line algorithm for constrained Delaunay triangulation. Computer Vision, Graphics, and Image Processing, 54:290-300, 1992.
11. P. A. Devijver and S. Maybank. On the computation of the Delaunay triangulation of a convex polygon. In Proceedings 6th IEEE International Conference on Pattern Recognition, pages 420-422, 1982.
12. 2 log n) time algorithm for the minmax angle triangulation. In Proceedings 6th Annual ACM Symposium on Computational Geometry, pages 44-52, 1990.
13. H. Eves. A Survey of Geometry, volume 1. Allyn and Bacon, Inc., Boston, 1963.
14. G. Fejes Tóth and W. Kuperberg. A survey of recent results in the theory of packing and covering. In J. Pach, editor, New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 251-279. Springer-Verlag, 1993.
15. D. H. Greene. The decomposition of polygons into convex parts. In F. P. Preparata, editor, Computational Geometry, volume 1 of Advances in Computing Research, pages 235-259. JAI Press, London, England, 1983.
16. S. Hert, S. Tiwari, and V. Lumelsky. A terrain-covering algorithm for an AUV. Journal of Autonomous Robots, 3:91-119, 1996.
17. S. Hertel and K. Mehlhorn. Fast triangulation of simple polygons. In Proceedings of Conference on Foundations of Computation Theory, pages 207-218, New York, 1983. Springer-Verlag.
18. S. Kannan and D. Soroker. Tiling polygons with parallelograms. Discrete and Computational Geometry, 7:175-188, 1992.
19. J. M. Keil. Decomposing a polygon into simpler components. SIAM Journal on Computing, 14:799-817, 1985.
20. C. Kenyon and R. Kenyon. Tiling a polygon with rectangles. In Proceedings 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 610-619, 1992.
21. E. Koutsoupias, C. H. Papadimitriou, and M. Sideri. On the optimal bisection of a polygon. ORSA Journal on Computing, 4(4):435-438, 1992.
22. C. Levcopoulos and A. Lingas. Bounds on the length of convex partitions of polygons. In Proceedings 4th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 181 of Lecture. Notes in Computer Science, pages 279-295. Springer-Verlag, 1984.
23. A. Lingas. The power of non-rectilinear holes. In Proceedings 9th International Colloquium on Automata, Languages, and Programming, volume 140 of Lecture Notes in Computer Science, pages 369-383. Springer-Verlag, 1982.
24. W. Lipski. Finding a Manhattan path and related problems. Networks, 13:399-409, 1983.
25. V. J. Lumelsky, S. Mukhopadhyay, and K. Sun. Dynamic path planning in sensor-based terrain acquisition. IEEE Transactions on Robotics and Automation, 6(4):462 - 472, 1990.
26. B. J. Oommen, S. S. Iyengar, N. S. V. Rao, and R.L Kashyap. Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case. IEEE Journal of Robotics and Automation, RA-3(6):672-681, 1987.
27. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987.
28. J. O'Rourke and K. J. Supowit. Some NP-hard polygon decomposition problems. IEEE Transactions on Information Theory, IT-30:181-190, 1983.
29. W. Page and K. R. S. Sastry. Area-bisecting polygonal paths. Fibonacci Quarterly, 30(3):263-373, 1992.
30. N. S. V. Rao and S. S. Iyengar. Autonomous robot navigation in unknown terrains: Incidental learning and environmental exploration. IEEE Transactions on System, Man and Cybernetics, 20(6):1443-1449, 1990.
31. V. Soltan and A. Gorpinevich. Minimum dissection of rectilinear polygon with arbitrary holes into rectangles. Discrete and Computational Geometry, 9:57-79, 1993.
32. S. B. Tor and A. E. Middleditch. Convex decomposition of simple polygons. ACM Transactions on Graphics, 3:244-265, 1984.