Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs

作者: Ileana Streinu

DOI: 10.1007/11618058_38

关键词: Outerplanar graphDense graphCombinatoricsLine graphPlanar graphPathwidthMathematicsBook embedding1-planar graphIndifference graph

摘要: 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 graph is an oriented-projective nature, and its combinatorial structure relates to rigidity theoretic parameters graph. For appropriate parametrization points move with constant speeds linear trajectories. A special type kinetic emerges, whose events can be analyzed combinatorially. They correspond collisions subsets points, are one-to-one correspondence contractions underlying rigid components. show how process them algorithmically via sweep. Of particular interest those planar which non-crossing motion. Our main result they (essentially) pseudo-triangulation mechanisms: pointed pseudo-trian- gulations convex hull edge removed. These structures have potential applications morphing more complex shapes than just simple polygons.

参考文章(17)
Audrey Lee, Ileana Streinu, Louis Theran, Finding and Maintaining Rigid Components. canadian conference on computational geometry. pp. 219- 222 ,(2005)
Boris Aronov, Eli Goodman, Ricky Pollack, Discrete and computational geometry : the Goodman-Pollack Festschrift Springer. ,(2003)
Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu, The Zigzag Path of a Pseudo-Triangulation workshop on algorithms and data structures. ,vol. 2748, pp. 377- 388 ,(2003) , 10.1007/978-3-540-45078-8_33
Günter Rote, Francisco Santos, Ileana Streinu, Expansive Motions and the Polytope of Pointed Pseudo-Triangulations Algorithms and Combinatorics. pp. 699- 736 ,(2003) , 10.1007/978-3-642-55566-4_33
L. Guibas, J. Hershberger, S. Suri, Morphing Simple Polygons Discrete and Computational Geometry. ,vol. 24, pp. 1- 34 ,(2000) , 10.1007/S004540010017
Sergey Bereg, Enumerating pseudo-triangulations in the plane Computational Geometry: Theory and Applications. ,vol. 30, pp. 207- 222 ,(2005) , 10.1016/J.COMGEO.2004.09.002
Craig Gotsman, Vitaly Surazhsky, Guaranteed intersection-free polygon morphing Computers & Graphics. ,vol. 25, pp. 67- 75 ,(2001) , 10.1016/S0097-8493(00)00108-4
Jürgen Bokowski, Susanne Mock, Ileana Streinu, On the Folkman-Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3 European Journal of Combinatorics. ,vol. 22, pp. 601- 615 ,(2001) , 10.1006/EUJC.2000.0482