Non-crossing frameworks with non-crossing reciprocals

被引:6
|
作者
Orden, D [1 ]
Rote, G
Santos, F
Servatius, B
Servatius, H
Whiteley, W
机构
[1] Univ Cantabria, Dept Matemat Estad & Computac, E-39005 Santander, Spain
[2] Free Univ Berlin, Inst Informat, D-14195 Berlin, Germany
[3] Worcester Polytech Inst, Dept Math Sci, Worcester, MA 01609 USA
[4] York Univ, Dept Math & Stat, Toronto, ON M3J 1P3, Canada
基金
美国国家科学基金会;
关键词
Computational Mathematic; Special Interest; Geometric Property; Planar Graph; Sign Pattern;
D O I
10.1007/s00454-004-1139-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study non-crossing frameworks in the plane for which the classical reciprocal on the dual graph is also non-crossing. We give a complete description of the self-stresses on non-crossing frameworks G whose reciprocals are non-crossing, in terms of: the types of faces (only pseudo-triangles and pseudo-quadrangles are allowed); the sign patterns in the stress on G; and a geometric condition on the stress vectors at some of the vertices. As in other recent papers where the interplay of non-crossingness and rigidity of straight-line plane graphs is studied, pseudo-triangulations show up as objects of special interest. For example, it is known that all planar Laman circuits can be embedded as a pseudo-triangulation with one non-pointed vertex. We show that for such pseudo-triangulation embeddings of planar Laman circuits which are sufficiently generic, the reciprocal is non-crossing and again a pseudo-triangulation embedding of a planar Laman circuit. For a singular (non-generic) pseudo-triangulation embedding of a planar Laman circuit, the reciprocal is still non-crossing and a pseudo-triangulation, but its underlying graph may not be a Laman circuit. Moreover, all the pseudo-triangulations which admit a non-crossing re-ciprocal arise as the reciprocals of such, possibly singular, stresses on pseudo-triangulation Laman circuits. All self-stresses on a planar graph correspond to liftings to piecewise linear surfaces in 3-space. We prove characteristic geometric properties of the lifts of such non-crossing reciprocal pairs.
引用
收藏
页码:567 / 600
页数:34
相关论文
共 50 条
  • [21] Non-crossing quantile regressions by SVM
    Takeuchi, I
    Furuhashi, T
    2004 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2004, : 401 - 406
  • [22] Long Non-crossing Configurations in the Plane
    Dumitrescu, Adrian
    Toth, Csaba D.
    DISCRETE & COMPUTATIONAL GEOMETRY, 2010, 44 (04) : 727 - 752
  • [23] Long Non-crossing Configurations in the Plane
    Adrian Dumitrescu
    Csaba D. Tóth
    Discrete & Computational Geometry, 2010, 44 : 727 - 752
  • [24] LONG NON-CROSSING CONFIGURATIONS IN THE PLANE
    Dumitrescu, Adrian
    Toth, Csaba D.
    27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 311 - 322
  • [25] Shortest Non-Crossing Walks in the Plane
    Erickson, Jeff
    Nayyeri, Amir
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 297 - 308
  • [26] MULTICHAINS, NON-CROSSING PARTITIONS AND TREES
    EDELMAN, PH
    DISCRETE MATHEMATICS, 1982, 40 (2-3) : 171 - 179
  • [27] Large deviations for non-crossing partitions
    Ortmann, Janosch
    ELECTRONIC JOURNAL OF PROBABILITY, 2012, 17 : 1 - 25
  • [28] Bottleneck non-crossing matching in the plane
    Abu-Affash, A. Karim
    Carmi, Paz
    Katz, Matthew J.
    Trabelsi, Yohai
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2014, 47 (03): : 447 - 457
  • [29] The complex of non-crossing diagonals of a polygon
    Braun, Benjamin
    Ehrenborg, Richard
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2010, 117 (06) : 642 - 649
  • [30] CHAIN ENUMERATION AND NON-CROSSING PARTITIONS
    EDELMAN, PH
    DISCRETE MATHEMATICS, 1980, 31 (02) : 171 - 180