A trivial knot whose spanning disks have exponential size

SCG '90 Pub Date : 1990-05-01 DOI:10.1145/98524.98555
J. Snoeyink
{"title":"A trivial knot whose spanning disks have exponential size","authors":"J. Snoeyink","doi":"10.1145/98524.98555","DOIUrl":null,"url":null,"abstract":"If a closed curve in space is a trivial knot (intuitively, one can untie it without cutting) then it is the boundary of some disk with no self-intersections. In this paper we investigate the minimum number of faces of a polyhedral spanning disk of a polygonal knot with <italic>n</italic> segments. We exhibit a knot whose minimal spanning disk has exp(<italic>cn</italic>) faces, for some positive constant <italic>c</italic>.","PeriodicalId":113850,"journal":{"name":"SCG '90","volume":"239 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98524.98555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

If a closed curve in space is a trivial knot (intuitively, one can untie it without cutting) then it is the boundary of some disk with no self-intersections. In this paper we investigate the minimum number of faces of a polyhedral spanning disk of a polygonal knot with n segments. We exhibit a knot whose minimal spanning disk has exp(cn) faces, for some positive constant c.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一个平凡的结,它的生成盘有指数大小
如果空间中的封闭曲线是一个平凡的结(直观地说,人们可以不用切割就解开它),那么它就是某个没有自交的盘的边界。本文研究了n节多边形结的多面体跨盘的最小面数。我们展示了一个结,它的最小生成盘有exp(cn)个面,对于某个正常数c。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Linear programming and convex hulls made easy Computing the minimum Hausdorff distance for point sets under translation On solving geometric optimization problems using shortest paths Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams An O(n2log n) time algorithm for the MinMax angle triangulation
×
引用
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