The combinatorial complexity of hyperplane transversals

SCG '90 Pub Date : 1990-05-01 DOI:10.1145/98524.98542
S. Cappell, J. Goodman, J. Pach, R. Pollack, M. Sharir, R. Wenger
{"title":"The combinatorial complexity of hyperplane transversals","authors":"S. Cappell, J. Goodman, J. Pach, R. Pollack, M. Sharir, R. Wenger","doi":"10.1145/98524.98542","DOIUrl":null,"url":null,"abstract":"We show that the maximum combinatorial complexity of the space of hyperplane transversals to a family of <italic>n</italic> separated and strictly convex sets in R<italic><supscrpt>d</supscrpt></italic> is &THgr;(<italic>n<supscrpt>⌊d/2⌋</supscrpt></italic>), which generalizes results of Edelsbrunner and Sharir in the plane. As a key step in the argument, we show that the space of hyperplanes tangent to <italic>&kgr;</italic> ≤ <italic>d</italic> separated and strictly convex sets in R<italic><supscrpt>d</supscrpt></italic> is a topological (<italic>d</italic> - <italic>&kgr;</italic>)-sphere.","PeriodicalId":113850,"journal":{"name":"SCG '90","volume":"16 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98524.98542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

We show that the maximum combinatorial complexity of the space of hyperplane transversals to a family of n separated and strictly convex sets in Rd is &THgr;(n⌊d/2⌋), which generalizes results of Edelsbrunner and Sharir in the plane. As a key step in the argument, we show that the space of hyperplanes tangent to &kgr;d separated and strictly convex sets in Rd is a topological (d - &kgr;)-sphere.
超平面截线的组合复杂度
我们证明了Rd中n个分离严格凸集族的超平面截线空间的最大组合复杂度为&THgr;(n⌊d/2⌋),推广了平面上Edelsbrunner和Sharir的结果。作为论证的关键一步,我们证明了与&kgr;在Rd上≤d个分离的严格凸集是一个拓扑(d - &kgr;)球。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信