发布求助
文献互助 智能选刊 最新文献

Discret. Comput. Geom.最新文献

筛选
英文 中文
On topological graphs with at most four crossings per edge 在每条边最多有四个交叉点的拓扑图上
Discret. Comput. Geom. Pub Date : 2015-09-07 DOI: 10.1016/j.comgeo.2019.101574
Eyal Ackerman
{"title":"On topological graphs with at most four crossings per edge","authors":"Eyal Ackerman","doi":"10.1016/j.comgeo.2019.101574","DOIUrl":"https://doi.org/10.1016/j.comgeo.2019.101574","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2015-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82799817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon 平面测地线生成树，哈密顿循环，以及简单多边形的完美匹配
Discret. Comput. Geom. Pub Date : 2015-08-26 DOI: 10.1016/j.comgeo.2016.05.004
Ahmad Biniaz, P. Bose, A. Maheshwari, M. Smid
{"title":"Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon","authors":"Ahmad Biniaz, P. Bose, A. Maheshwari, M. Smid","doi":"10.1016/j.comgeo.2016.05.004","DOIUrl":"https://doi.org/10.1016/j.comgeo.2016.05.004","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"82 1","pages":"27-39"},"PeriodicalIF":0.0,"publicationDate":"2015-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90562545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Exact Minkowski Sums of Polygons With Holes 带孔多边形的精确Minkowski和
Discret. Comput. Geom. Pub Date : 2015-02-22 DOI: 10.1007/978-3-662-48350-3_7
A. Baram, Efi Fogel, D. Halperin, M. Hemmer, Sebastian Morr
{"title":"Exact Minkowski Sums of Polygons With Holes","authors":"A. Baram, Efi Fogel, D. Halperin, M. Hemmer, Sebastian Morr","doi":"10.1007/978-3-662-48350-3_7","DOIUrl":"https://doi.org/10.1007/978-3-662-48350-3_7","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"18 1","pages":"46-56"},"PeriodicalIF":0.0,"publicationDate":"2015-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89108751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Discrete Voronoi games and ϵ-nets, in two and three dimensions 离散Voronoi游戏和ϵ-nets，在二维和三维
Discret. Comput. Geom. Pub Date : 2015-01-20 DOI: 10.1016/j.comgeo.2016.02.002
Aritra Banik, J. Carufel, A. Maheshwari, M. Smid
{"title":"Discrete Voronoi games and ϵ-nets, in two and three dimensions","authors":"Aritra Banik, J. Carufel, A. Maheshwari, M. Smid","doi":"10.1016/j.comgeo.2016.02.002","DOIUrl":"https://doi.org/10.1016/j.comgeo.2016.02.002","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"197 1","pages":"41-58"},"PeriodicalIF":0.0,"publicationDate":"2015-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76950509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
The non-pure version of the simplex and the boundary of the simplex 单纯形的非纯版本和单纯形的边界
Discret. Comput. Geom. Pub Date : 2014-06-25 DOI: 10.1016/j.comgeo.2016.05.002
N. Capitelli
{"title":"The non-pure version of the simplex and the boundary of the simplex","authors":"N. Capitelli","doi":"10.1016/j.comgeo.2016.05.002","DOIUrl":"https://doi.org/10.1016/j.comgeo.2016.05.002","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"25 1","pages":"19-26"},"PeriodicalIF":0.0,"publicationDate":"2014-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81602399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Improved Data Stream Algorithm for Clustering 一种改进的数据流聚类算法
Discret. Comput. Geom. Pub Date : 2014-03-31 DOI: 10.1007/978-3-642-54423-1_24
Sang-Sub Kim, Hee-Kap Ahn
{"title":"An Improved Data Stream Algorithm for Clustering","authors":"Sang-Sub Kim, Hee-Kap Ahn","doi":"10.1007/978-3-642-54423-1_24","DOIUrl":"https://doi.org/10.1007/978-3-642-54423-1_24","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"2 1","pages":"635-645"},"PeriodicalIF":0.0,"publicationDate":"2014-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74327702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A lower bound on opaque sets 不透明集合上的下界
Discret. Comput. Geom. Pub Date : 2014-03-16 DOI: 10.4230/LIPIcs.SoCG.2016.46
A. Kawamura, Sonoko Moriyama, Y. Otachi, J. Pach
{"title":"A lower bound on opaque sets","authors":"A. Kawamura, Sonoko Moriyama, Y. Otachi, J. Pach","doi":"10.4230/LIPIcs.SoCG.2016.46","DOIUrl":"https://doi.org/10.4230/LIPIcs.SoCG.2016.46","url":null,"abstract":"It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2 by Jones in 1964. A similar bound is proved for all convex sets U other than a triangle.","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"9 1","pages":"13-22"},"PeriodicalIF":0.0,"publicationDate":"2014-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82591286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On the edge crossing properties of Euclidean minimum weight Laman graphs 欧几里得最小权值拉曼图的边交叉性质
Discret. Comput. Geom. Pub Date : 2013-12-16 DOI: 10.1007/978-3-642-45030-3_4
S. Bereg, Seok-Hee Hong, N. Katoh, S. Poon, Shin-ichi Tanigawa
{"title":"On the edge crossing properties of Euclidean minimum weight Laman graphs","authors":"S. Bereg, Seok-Hee Hong, N. Katoh, S. Poon, Shin-ichi Tanigawa","doi":"10.1007/978-3-642-45030-3_4","DOIUrl":"https://doi.org/10.1007/978-3-642-45030-3_4","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"29 1","pages":"15-24"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84431115","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Analysis of farthest point sampling for approximating geodesics in a graph 图中测地线近似的最远点采样分析
Discret. Comput. Geom. Pub Date : 2013-11-19 DOI: 10.1016/j.comgeo.2016.05.005
Pegah Kamousi, S. Lazard, A. Maheshwari, S. Wuhrer
{"title":"Analysis of farthest point sampling for approximating geodesics in a graph","authors":"Pegah Kamousi, S. Lazard, A. Maheshwari, S. Wuhrer","doi":"10.1016/j.comgeo.2016.05.005","DOIUrl":"https://doi.org/10.1016/j.comgeo.2016.05.005","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"00 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2013-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79022021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs 绘制具有无交叉子图的非平面图的算法和边界
Discret. Comput. Geom. Pub Date : 2013-08-30 DOI: 10.1007/978-3-319-03841-4_26
Patrizio Angelini, Carla Binucci, G. D. Lozzo, W. Didimo, L. Grilli, Fabrizio Montecchiani, M. Patrignani, I. Tollis
{"title":"Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs","authors":"Patrizio Angelini, Carla Binucci, G. D. Lozzo, W. Didimo, L. Grilli, Fabrizio Montecchiani, M. Patrignani, I. Tollis","doi":"10.1007/978-3-319-03841-4_26","DOIUrl":"https://doi.org/10.1007/978-3-319-03841-4_26","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"59 1","pages":"34-48"},"PeriodicalIF":0.0,"publicationDate":"2013-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72630688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信