Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs
We study parallel redrawing graphs: graphs embedded on moving point sets in such a way that edges maintain their slopes all throughout the motion.
The configuration space of such a graph is of an oriented-projective nature, and its combinatorial structure relates to rigidity theoretic parameters of the graph. For an appropriate parametrization the points move with constant speeds on linear trajectories. A special type of kinetic structure emerges, whose events can be analyzed combinatorially. They correspond to collisions of subsets of points, and are in one-to-one correspondence with contractions of the underlying graph on rigid components. We show how to process them algorithmically via a parallel redrawing sweep.
Of particular interest are those planar graphs which maintain non-crossing edges throughout the motion. Our main result is that they are (essentially) pseudo-triangulation mechanisms: pointed pseudo-trian- gulations with a convex hull edge removed. These kinetic graph structures have potential applications in morphing of more complex shapes than just simple polygons.
KeywordsHull Topo Bedding Boris Haas
- 1.Agarwal, P., Basch, J., Guibas, L., Hershberger, J., Zhang, L.: Deformable free space tilings for kinetic collision detection. International Journal of Robotics Research 21, 179–197 (2003); Preliminary version appeared in Proc. 4th International Workshop on Algorithmic Foundations of Robotics (WAFR) (2000)Google Scholar
- 6.Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. Graduate Studies in Mathematics, vol. 2. American Mathematical Society (1993)Google Scholar
- 8.Haas, R., Orden, D., Rote, G., Santos, F., Servatius, B., Servatius, H., Souvaine, D., Streinu, I., Whiteley, W.: Planar minimally rigid graphs and pseudo-triangulations. Computational Geometry: Theory and Applications, 31–61 (May 2005)Google Scholar
- 9.Lee, A., Streinu, I., Theran, L.: Finding and maintaining rigid components. In: Proc. Canad. Conf. Comp. Geom., Windsor, Canada (August 2005)Google Scholar
- 11.Rote, G., Santos, F., Streinu, I.: Expansive motions and the polytope of pointed pseudo-triangulations. In: Aronov, J.P.B., Basu, S., Sharir, M. (eds.) Discrete and Computational Geometry - The Goodman-Pollack Festschrift, Algorithms and Combinatorics, pp. 699–736. Springer, Berlin (2003)Google Scholar
- 12.Speckmann, B., Tóth, C.: Allocating vertex π-guards in simple polygons via pseudo-triangulations. In: Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 109–118 (2003); To appear in Discrete and Computational Geometry (2004)Google Scholar
- 14.Streinu, I.: A combinatorial approach to planar non-colliding robot arm motion planning. In: IEEE Symposium on Foundations of Computer Science, pp. 443–453 (2000)Google Scholar
- 15.Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discrete and Computational Geometry (2005) (to appear); A preliminary version appeared in Google Scholar
- 16.Whiteley, W.: Some matroids from discrete applied geometry. In: Oxley, J., Bonin, J., Servatius, B. (eds.) Matroid Theory. Contemporary Mathematics, vol. 197, pp. 171–311. American Mathematical Society (1996)Google Scholar