Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Aichholzer, O., Rote, G., Speckmann, B., Streinu, I.: The zig-zag path of a pseudo-triangulation. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 377–388. Springer, Heidelberg (2003)
Bespamyatnikh, S.: Enumerating pseudo-triangulations in the plane. Comput. Geom. Theory Appl. 30(3), 207–222 (2005)
Bokowski, J., Mock, S., Streinu, I.: The folkman-lawrence topological representation theorem for oriented matroids - an elementary proof in rank 3. European Journal of Combinatorics 22, 601–615 (2001)
Gotsman, C., Surazhsky, V.: Guaranteed intersection-free polygon morphing. Computers and Graphics 25(1), 67–75 (2001)
Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. Graduate Studies in Mathematics, vol. 2. American Mathematical Society (1993)
Guibas, L., Hershberger, J., Suri, S.: Morphing simple polygons. Discrete and Computational Geometry 24, 1–34 (2000)
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)
Lee, A., Streinu, I., Theran, L.: Finding and maintaining rigid components. In: Proc. Canad. Conf. Comp. Geom., Windsor, Canada (August 2005)
Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudo-triangulations. Discrete & Computational Geometry 16(4), 419–453 (1996)
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)
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)
Stolfi, J.: Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, New York (1991)
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)
Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discrete and Computational Geometry (2005) (to appear); A preliminary version appeared in [14]
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Streinu, I. (2006). Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs. In: Healy, P., Nikolov, N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618058_38
Download citation
DOI: https://doi.org/10.1007/11618058_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31425-7
Online ISBN: 978-3-540-31667-1
eBook Packages: Computer ScienceComputer Science (R0)