Pseudoline Arrangements

J. Goodman
{"title":"Pseudoline Arrangements","authors":"J. Goodman","doi":"10.1201/9781420035315.ch5","DOIUrl":null,"url":null,"abstract":"Pseudoline arrangements generalize in a natural way arrangements of straight lines, discarding the straightness aspect, but preserving their basic topological and combinatorial properties. Elementary and intuitive in nature, at the same time, by the Folkman-Lawrence topological representation theorem (see Chapter 6), they provide a concrete geometric model for oriented matroids of rank 3. After their explicit description by Levi in the 1920’s, and the subsequent development of the theory by Ringel in the 1950’s, the major impetus was given in the 1970’s by Grünbaum’s monograph Arrangements and Spreads, in which a number of results were collected and a great many problems and conjectures posed about arrangements of both lines and pseudolines. The connection with oriented matroids discovered several years later led to further work. The theory is by now very well developed, with many combinatorial and topological results and connections to other areas as for example algebraic combinatorics, as well as a large number of applications in computational geometry. In comparison to arrangements of lines arrangements of pseudolines have the advantage that they are more general and allow for a purely combinatorial treatment. Section 5.1 is devoted to the basic properties of pseudoline arrangements, and Section 5.2 to related structures, such as arrangements of straight lines, configurations (and generalized configurations) of points, and allowable sequences of permutations. (We do not discuss the connection with oriented matroids, however; that is included in Chapter 6.) In Section 5.3 we discuss the stretchability problem. Section 5.4 summarizes some combinatorial results known about line and pseudoline arrangements, in particular problems related to the cell structure of arrangements. Section 5.5 deals with results of a topological nature and Section 5.6 with issues of combinatorial and computational complexity. Section 5.7 with several applications, including sweeping arrangements and pseudotriangulations. Unless otherwise noted, we work in the real projective plane P.","PeriodicalId":156768,"journal":{"name":"Handbook of Discrete and Computational Geometry, 2nd Ed.","volume":"613 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"80","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Handbook of Discrete and Computational Geometry, 2nd Ed.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9781420035315.ch5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 80

Abstract

Pseudoline arrangements generalize in a natural way arrangements of straight lines, discarding the straightness aspect, but preserving their basic topological and combinatorial properties. Elementary and intuitive in nature, at the same time, by the Folkman-Lawrence topological representation theorem (see Chapter 6), they provide a concrete geometric model for oriented matroids of rank 3. After their explicit description by Levi in the 1920’s, and the subsequent development of the theory by Ringel in the 1950’s, the major impetus was given in the 1970’s by Grünbaum’s monograph Arrangements and Spreads, in which a number of results were collected and a great many problems and conjectures posed about arrangements of both lines and pseudolines. The connection with oriented matroids discovered several years later led to further work. The theory is by now very well developed, with many combinatorial and topological results and connections to other areas as for example algebraic combinatorics, as well as a large number of applications in computational geometry. In comparison to arrangements of lines arrangements of pseudolines have the advantage that they are more general and allow for a purely combinatorial treatment. Section 5.1 is devoted to the basic properties of pseudoline arrangements, and Section 5.2 to related structures, such as arrangements of straight lines, configurations (and generalized configurations) of points, and allowable sequences of permutations. (We do not discuss the connection with oriented matroids, however; that is included in Chapter 6.) In Section 5.3 we discuss the stretchability problem. Section 5.4 summarizes some combinatorial results known about line and pseudoline arrangements, in particular problems related to the cell structure of arrangements. Section 5.5 deals with results of a topological nature and Section 5.6 with issues of combinatorial and computational complexity. Section 5.7 with several applications, including sweeping arrangements and pseudotriangulations. Unless otherwise noted, we work in the real projective plane P.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Pseudoline安排
伪线排列以自然的方式推广直线排列,放弃直线性方面,但保留其基本的拓扑和组合性质。同时,通过Folkman-Lawrence拓扑表示定理(见第6章),他们为3阶有向拟阵提供了一个具体的几何模型。20世纪20年代列维对其进行了明确的描述,50年代林格尔对这一理论进行了进一步的发展,70年代格纳鲍姆的专著《排列与扩散》(arrangement and Spreads)推动了这一理论的发展,该书收集了许多结果,提出了许多关于线和伪线排列的问题和猜想。几年后发现的与定向拟阵的联系导致了进一步的研究。这个理论现在已经发展得很好,有许多组合和拓扑结果,并与其他领域有联系,例如代数组合学,以及在计算几何中的大量应用。与线的排列相比,伪线的排列的优点是它们更一般,并且允许进行纯粹的组合处理。第5.1节专门讨论伪线排列的基本性质,第5.2节讨论相关结构,如直线排列、点的构型(和广义构型)以及允许的排列序列。(然而,我们不讨论与取向拟阵的联系;这是第6章的内容。)在5.3节中,我们将讨论可拉伸性问题。第5.4节总结了一些已知的关于线和伪线排列的组合结果,特别是与排列的细胞结构有关的问题。第5.5节讨论拓扑性质的结果,第5.6节讨论组合和计算复杂性的问题。5.7节给出了几个应用,包括扫描排列和伪三角测量。除非特别说明,我们在实投影平面P上工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Polyominoes Linear programming Geographic information systems Biological applications of computational topology Collision and Proximity Queries
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1