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

International Journal of Computational Geometry & Applications最新文献

筛选
英文 中文
Near-optimal algorithms for point-line fitting problems 点-线拟合问题的近最优算法
International Journal of Computational Geometry & Applications Pub Date : 2022-01-01 DOI: 10.20382/jocg.v13i1a9
Jianer Chen, Qin Huang, Iyad A. Kanj, Ge Xia
{"title":"Near-optimal algorithms for point-line fitting problems","authors":"Jianer Chen, Qin Huang, Iyad A. Kanj, Ge Xia","doi":"10.20382/jocg.v13i1a9","DOIUrl":"https://doi.org/10.20382/jocg.v13i1a9","url":null,"abstract":"","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87494490","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
On morphs of 1-plane graphs 关于一平面图的变形
International Journal of Computational Geometry & Applications Pub Date : 2022-01-01 DOI: 10.20382/jocg.v13i1a10
Patrizio Angelini, M. Bekos, Fabrizio Montecchiani, Maximilian Pfister
{"title":"On morphs of 1-plane graphs","authors":"Patrizio Angelini, M. Bekos, Fabrizio Montecchiani, Maximilian Pfister","doi":"10.20382/jocg.v13i1a10","DOIUrl":"https://doi.org/10.20382/jocg.v13i1a10","url":null,"abstract":"","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79387825","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}
引用次数: 1
Recognizing weighted and seeded disk graphs 识别加权和种子磁盘图
International Journal of Computational Geometry & Applications Pub Date : 2022-01-01 DOI: 10.20382/jocg.v13i1a13
Boris Klemz, M. Nöllenburg, Roman Prutkin
{"title":"Recognizing weighted and seeded disk graphs","authors":"Boris Klemz, M. Nöllenburg, Roman Prutkin","doi":"10.20382/jocg.v13i1a13","DOIUrl":"https://doi.org/10.20382/jocg.v13i1a13","url":null,"abstract":"","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91023427","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}
引用次数: 1
Algorithms for approximate sparse regression and nearest induced hulls 近似稀疏回归和最近诱导船体的算法
International Journal of Computational Geometry & Applications Pub Date : 2022-01-01 DOI: 10.20382/jocg.v13i1a14
J. Cardinal, Aurélien Ooms
{"title":"Algorithms for approximate sparse regression and nearest induced hulls","authors":"J. Cardinal, Aurélien Ooms","doi":"10.20382/jocg.v13i1a14","DOIUrl":"https://doi.org/10.20382/jocg.v13i1a14","url":null,"abstract":"","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89403489","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}
引用次数: 1
A Geometric Approach to Inelastic Collapse 非弹性塌缩的几何方法
International Journal of Computational Geometry & Applications Pub Date : 2022-01-01 DOI: 10.20382/jocg.v13i1a7
Yufei Zheng, Kritkorn Karntikoon, B. Chazelle
{"title":"A Geometric Approach to Inelastic Collapse","authors":"Yufei Zheng, Kritkorn Karntikoon, B. Chazelle","doi":"10.20382/jocg.v13i1a7","DOIUrl":"https://doi.org/10.20382/jocg.v13i1a7","url":null,"abstract":"1 We show in this note how to interpret logarithmic spiral tilings as one-dimensional particle 2 systems undergoing inelastic collapse. By deforming the spirals appropriately, we can simulate 3 collisions among particles with distinct or varying coefficients of restitution. Our geometric 4 constructions provide a strikingly simple illustration of a widely studied phenomenon in the 5 physics of dissipative gases: the collapse of inelastic particles. 6 Lines 154","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79970081","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
Delaunay triangulations of generalized Bolza surfaces 广义Bolza曲面的Delaunay三角剖分
International Journal of Computational Geometry & Applications Pub Date : 2021-03-10 DOI: 10.20382/jocg.v13i1a5
Matthijs Ebbens, I. Iordanov, M. Teillaud, G. Vegter
{"title":"Delaunay triangulations of generalized Bolza surfaces","authors":"Matthijs Ebbens, I. Iordanov, M. Teillaud, G. Vegter","doi":"10.20382/jocg.v13i1a5","DOIUrl":"https://doi.org/10.20382/jocg.v13i1a5","url":null,"abstract":"The Bolza surface can be seen as the quotient of the hyperbolic plane, represented by the Poincaré disk model, under the action of the group generated by the hyperbolic isometries identifying opposite sides of a regular octagon centered at the origin. We consider generalized Bolza surfaces Mg, where the octagon is replaced by a regular 4g-gon, leading to a genus g surface. We propose an extension of Bowyer’s algorithm to these surfaces. In particular, we compute the value of the systole of Mg. We also propose algorithms computing small sets of points on Mg that are used to initialize Bowyer’s algorithm.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79313769","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
Local routing in WSPD-based spanners 基于wspd的扳手中的本地路由
International Journal of Computational Geometry & Applications Pub Date : 2021-01-26 DOI: 10.20382/JOCG.V12I1A1
J. Carufel, P. Bose, F. Paradis, V. Dujmovic
{"title":"Local routing in WSPD-based spanners","authors":"J. Carufel, P. Bose, F. Paradis, V. Dujmovic","doi":"10.20382/JOCG.V12I1A1","DOIUrl":"https://doi.org/10.20382/JOCG.V12I1A1","url":null,"abstract":"The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in $R^2$, introduced by Callahan and Kosaraju [JACM, 42 (1): 67-90, 1995], is a technique for partitioning the edges of the complete graph based on length into a linear number of sets. Among the many different applications of WSPDs, Callahan and Kosaraju proved that the sparse subgraph that results by selecting an arbitrary edge from each set (called WSPD-spanner) is a $1 + 8/(s − 4)$-spanner, where $s > 4$ is the separation ratio used for partitioning the edges.Although competitive local-routing strategies exist for various spanners such as Yao-graphs, $Theta$-graphs, and variants of Delaunay graphs, few local-routing strategies are known for any WSPD-spanner. Our main contribution is a local-routing algorithm with a near-optimal competitive routing ratio of $1 + O(1/s)$ on a WSPD-spanner.Specifically, using Callahan and Kosaraju’s fair split-tree, we show how to build a WSPD-spanner with spanning ratio $1 + 4/s + 4/(s − 2)$ which is a slight improvement over $1 + 8/(s − 4)$. We then present a 2-local and a 1-local routing algorithm on this spanner with competitive routing ratios of $1 + 6/(s − 2) + 4/s$ and $1 + 8/(s − 2) + 4/s + 8/s^2$, respectively. Moreover, we prove that there exists a point set for which our WSPD-spanner has a spanning ratio of at least $1 + 8/s$, thereby proving the near-optimality of its spanning ratio and the near-optimality of the routing ratio of both our routing algorithms.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84669485","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
Worst-Case Optimal Squares Packing into Disks 将最坏情况下的最优平方打包成磁盘
International Journal of Computational Geometry & Applications Pub Date : 2021-01-01 DOI: 10.20382/jocg.v12i2a7
S. Fekete, Vijaykrishna Gurunathan, Kush Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer
{"title":"Worst-Case Optimal Squares Packing into Disks","authors":"S. Fekete, Vijaykrishna Gurunathan, Kush Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer","doi":"10.20382/jocg.v12i2a7","DOIUrl":"https://doi.org/10.20382/jocg.v12i2a7","url":null,"abstract":"","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90190742","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
Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons 填充凸多边形的近似最小面积矩形和凸容器
International Journal of Computational Geometry & Applications Pub Date : 2020-12-21 DOI: 10.20382/jocg.v8i1a1
H. Alt, M. D. Berg, Christian Knauer
{"title":"Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons","authors":"H. Alt, M. D. Berg, Christian Knauer","doi":"10.20382/jocg.v8i1a1","DOIUrl":"https://doi.org/10.20382/jocg.v8i1a1","url":null,"abstract":"We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85744765","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
An explicit PL-embedding of the square flat torus into $mathbb{E}^3$ 一个显式的pl嵌入方形平面环面到$mathbb{E}^3$
International Journal of Computational Geometry & Applications Pub Date : 2020-12-15 DOI: 10.20382/JOCG.V11I1A24
Tanessí Quintanar
{"title":"An explicit PL-embedding of the square flat torus into $mathbb{E}^3$","authors":"Tanessí Quintanar","doi":"10.20382/JOCG.V11I1A24","DOIUrl":"https://doi.org/10.20382/JOCG.V11I1A24","url":null,"abstract":"We present an explicit PL-embedding of the flat square torus $mathbb{T}^2=mathbb{E}^2/mathbb{Z}^2$ into $mathbb{E}^3$, with 40 vertices and 80 faces.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77340804","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
下一页 尾页
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学术官方微信