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

Discret. Comput. Geom.最新文献

筛选
英文 中文
Improved bounds for cops-and-robber pursuit 改进了追捕警察和强盗的边界
Discret. Comput. Geom. Pub Date : 2011-10-01 DOI: 10.1016/j.comgeo.2011.03.001
Laurent Alonso, E. Reingold
{"title":"Improved bounds for cops-and-robber pursuit","authors":"Laurent Alonso, E. Reingold","doi":"10.1016/j.comgeo.2011.03.001","DOIUrl":"https://doi.org/10.1016/j.comgeo.2011.03.001","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"179 1","pages":"365-369"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72576628","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}
引用次数: 3
On packing squares into a rectangle 把正方形包装成矩形
Discret. Comput. Geom. Pub Date : 2011-10-01 DOI: 10.1016/j.comgeo.2011.05.001
S. Hougardy
{"title":"On packing squares into a rectangle","authors":"S. Hougardy","doi":"10.1016/j.comgeo.2011.05.001","DOIUrl":"https://doi.org/10.1016/j.comgeo.2011.05.001","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"8 1","pages":"456-463"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73154145","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}
引用次数: 19
On point-sets that support planar graphs 在支持平面图的点集上
Discret. Comput. Geom. Pub Date : 2011-09-21 DOI: 10.1007/978-3-642-25878-7_7
V. Dujmovic, W. Evans, S. Lazard, William J. Lenhart, G. Liotta, D. Rappaport, S. Wismath
{"title":"On point-sets that support planar graphs","authors":"V. Dujmovic, W. Evans, S. Lazard, William J. Lenhart, G. Liotta, D. Rappaport, S. Wismath","doi":"10.1007/978-3-642-25878-7_7","DOIUrl":"https://doi.org/10.1007/978-3-642-25878-7_7","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"49 1","pages":"29-50"},"PeriodicalIF":0.0,"publicationDate":"2011-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90648893","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}
引用次数: 26
Software for exact integration of polynomials over polyhedra 软件的精确积分多项式在多面体
Discret. Comput. Geom. Pub Date : 2011-07-31 DOI: 10.1145/2110170.2110175
J. D. Loera, Brandon E. Dutra, M. Köppe, Stanislav Moreinis, Gregory Pinto, Jianqiu Wu
{"title":"Software for exact integration of polynomials over polyhedra","authors":"J. D. Loera, Brandon E. Dutra, M. Köppe, Stanislav Moreinis, Gregory Pinto, Jianqiu Wu","doi":"10.1145/2110170.2110175","DOIUrl":"https://doi.org/10.1145/2110170.2110175","url":null,"abstract":"We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"6 1","pages":"232-252"},"PeriodicalIF":0.0,"publicationDate":"2011-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79833953","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}
引用次数: 80
A kuratowski-type theorem for planarity of partially embedded graphs 部分嵌入图平面性的一个kuratowski型定理
Discret. Comput. Geom. Pub Date : 2011-06-13 DOI: 10.1145/1998196.1998214
Vít Jelínek, Jan Kratochvíl, Ignaz Rutter
{"title":"A kuratowski-type theorem for planarity of partially embedded graphs","authors":"Vít Jelínek, Jan Kratochvíl, Ignaz Rutter","doi":"10.1145/1998196.1998214","DOIUrl":"https://doi.org/10.1145/1998196.1998214","url":null,"abstract":"A partially embedded graph (or PEG) is a triple (G,H,EH), where G is a graph, H is a subgraph of G, and EH is a planar embedding of H. We say that a PEG (G,H,EH) is planar if the graph G has a planar embedding that extends the embedding EH.\u0000 We introduce a containment relation of PEGs analogous to graph minor containment, and characterize the minimal non-planar PEGs with respect to this relation. We show that all the minimal non-planar PEGs except for finitely many belong to a single easily recognizable and explicitly described infinite family. We also describe a more complicated containment relation which only has a finite number of minimal non-planar PEGs.\u0000 Furthermore, by extending an existing planarity test for PEGs, we obtain a polynomial-time algorithm which, for a given PEG, either produces a planar embedding or identifies a minimal obstruction.","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"56 1","pages":"466-492"},"PeriodicalIF":0.0,"publicationDate":"2011-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78729595","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}
引用次数: 40
Stable snap rounding 稳定的卡扣舍入
Discret. Comput. Geom. Pub Date : 2011-06-13 DOI: 10.1145/1998196.1998226
J. Hershberger
{"title":"Stable snap rounding","authors":"J. Hershberger","doi":"10.1145/1998196.1998226","DOIUrl":"https://doi.org/10.1145/1998196.1998226","url":null,"abstract":"Snap rounding is a popular method for rounding the vertices of a planar arrangement of line segments to the integer grid. It has many advantages, including minimum perturbation of the segments, preservation of the arrangement topology, and ease of implementation. However, snap rounding has one significant weakness: it is not stable (i.e., not idempotent). That is, applying snap rounding to a snap-rounded arrangement of n segments may cause additional segment perturbation, and the number of iterations of snap rounding needed to reach stability may be as large as Θ(n2).\u0000 This paper introduces stable snap rounding, a variant of snap rounding that has all of snap rounding's advantages and is also idempotent. In particular, stable snap rounding does not change any arrangement whose vertices are already grid points (such as those produced by stable snap rounding or standard snap rounding).","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"32 1","pages":"403-416"},"PeriodicalIF":0.0,"publicationDate":"2011-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89975992","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}
引用次数: 24
On k-convex polygons 在k凸多边形上
Discret. Comput. Geom. Pub Date : 2010-07-21 DOI: 10.1016/j.comgeo.2011.09.001
O. Aichholzer, F. Aurenhammer, E. Demaine, F. Hurtado, P. Ramos, J. Urrutia
{"title":"On k-convex polygons","authors":"O. Aichholzer, F. Aurenhammer, E. Demaine, F. Hurtado, P. Ramos, J. Urrutia","doi":"10.1016/j.comgeo.2011.09.001","DOIUrl":"https://doi.org/10.1016/j.comgeo.2011.09.001","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"90 1","pages":"73-87"},"PeriodicalIF":0.0,"publicationDate":"2010-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79583026","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}
引用次数: 16
Mathematical model and efficient algorithms for object packing problem 目标打包问题的数学模型及有效算法
Discret. Comput. Geom. Pub Date : 2010-07-01 DOI: 10.1016/j.comgeo.2009.12.003
N. Chernov, Y. Stoyan, T. Romanova
{"title":"Mathematical model and efficient algorithms for object packing problem","authors":"N. Chernov, Y. Stoyan, T. Romanova","doi":"10.1016/j.comgeo.2009.12.003","DOIUrl":"https://doi.org/10.1016/j.comgeo.2009.12.003","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"53 1","pages":"535-553"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90756445","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}
引用次数: 146
Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions 星四叉树和保护四叉树:用于胖三角剖分和低密度平面细分的I/ o高效索引
Discret. Comput. Geom. Pub Date : 2010-07-01 DOI: 10.1016/j.comgeo.2009.11.001
M. D. Berg, H. Haverkort, Shripad Thite, Laura Toma
{"title":"Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions","authors":"M. D. Berg, H. Haverkort, Shripad Thite, Laura Toma","doi":"10.1016/j.comgeo.2009.11.001","DOIUrl":"https://doi.org/10.1016/j.comgeo.2009.11.001","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"12 1","pages":"493-513"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75339203","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}
引用次数: 16
A robust segment/triangle intersection algorithm for interference tests. Efficiency study 一种鲁棒的分段/三角形相交干涉测试算法。效率研究
Discret. Comput. Geom. Pub Date : 2010-07-01 DOI: 10.1016/j.comgeo.2009.10.001
Juan José Jiménez-Delgado, R. Segura, F. Feito-Higueruela
{"title":"A robust segment/triangle intersection algorithm for interference tests. Efficiency study","authors":"Juan José Jiménez-Delgado, R. Segura, F. Feito-Higueruela","doi":"10.1016/j.comgeo.2009.10.001","DOIUrl":"https://doi.org/10.1016/j.comgeo.2009.10.001","url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"56 1","pages":"474-492"},"PeriodicalIF":0.0,"publicationDate":"2010-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83915900","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}
引用次数: 26
首页 上一页 下一页 尾页
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学术官方微信