Algorithms for ball hulls and ball intersections in normed planes

Q4 Mathematics
Pedro Martín, H. Martini
{"title":"Algorithms for ball hulls and ball intersections in normed planes","authors":"Pedro Martín, H. Martini","doi":"10.20382/jocg.v6i1a4","DOIUrl":null,"url":null,"abstract":"Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in normed planes can be constructed in $O(n \\log n)$ time. In addition, we confirm that the 2-center problem with constrained circles for arbitrary normed planes can be solved in $O(n^2)$ time. Some ideas about the geometric structure of the ball hull in a normed plane are also presented.","PeriodicalId":54969,"journal":{"name":"International Journal of Computational Geometry & Applications","volume":"1999 1","pages":"99-107"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry & Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20382/jocg.v6i1a4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2

Abstract

Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that the 2-center problem with constrained circles for arbitrary normed planes can be solved in $O(n^2)$ time. Some ideas about the geometric structure of the ball hull in a normed plane are also presented.
规范平面上球壳和球交的算法
推广Hershberger和Suri在欧几里得平面上的结果,证明了赋范平面上n个点集合的球壳和球交可以在O(n \log n)$时间内构造。此外,我们还证实了任意赋范平面的带约束圆的二中心问题可以在$O(n^2)$时间内得到解决。本文还对球壳在规范平面上的几何结构提出了一些看法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.80
自引率
0.00%
发文量
4
审稿时长
>12 weeks
期刊介绍: The International Journal of Computational Geometry & Applications (IJCGA) is a quarterly journal devoted to the field of computational geometry within the framework of design and analysis of algorithms. Emphasis is placed on the computational aspects of geometric problems that arise in various fields of science and engineering including computer-aided geometry design (CAGD), computer graphics, constructive solid geometry (CSG), operations research, pattern recognition, robotics, solid modelling, VLSI routing/layout, and others. Research contributions ranging from theoretical results in algorithm design — sequential or parallel, probabilistic or randomized algorithms — to applications in the above-mentioned areas are welcome. Research findings or experiences in the implementations of geometric algorithms, such as numerical stability, and papers with a geometric flavour related to algorithms or the application areas of computational geometry are also welcome.
×
引用
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学术官方微信