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

International Journal of Computational Geometry and Applications最新文献

筛选
英文 中文
Separating Translates in the Plane: Combinatorial Bounds and an Algorithm 平面上的转换分离:组合界和算法
International Journal of Computational Geometry and Applications Pub Date : 1994-07-06 DOI: 10.1142/S021819599700034X
J. Czyzowicz, H. Everett, J. Robert
{"title":"Separating Translates in the Plane: Combinatorial Bounds and an Algorithm","authors":"J. Czyzowicz, H. Everett, J. Robert","doi":"10.1142/S021819599700034X","DOIUrl":"https://doi.org/10.1142/S021819599700034X","url":null,"abstract":"In this paper, we establish two combinatorial bounds related to the separation problem for sets of n pairwise disjoint translates of convex objects: 1) there exists a line which separates one translate from at least n — co√n translates, for some constant c that depends on the “shape” of the translates and 2) there is a function f such that there exists a line with orientation Θ or f(Θ) which separates one translate from at least ⌈3n⌉/4-4 translates, for any orientation Θ (f is defined only by the “shape” of the translate). We also present an O(n log (n+k)+k) time algorithm for finding a translate which can be separated from the maximum number of translates amongst sets of n pairwise disjoint translates of convex k-gons.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124933166","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
Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming 多边形网格点的高效枚举及其在整数规划中的应用
International Journal of Computational Geometry and Applications Pub Date : 1994-03-01 DOI: 10.1142/S0218195994000069
N. Kanamaru, Takao Nishizeki, T. Asano
{"title":"Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming","authors":"N. Kanamaru, Takao Nishizeki, T. Asano","doi":"10.1142/S0218195994000069","DOIUrl":"https://doi.org/10.1142/S0218195994000069","url":null,"abstract":"This paper first presents an algorithm for enumerating all the integer-grid points in a given convex m-gon in O(K + m + log n) time where K is the number of such grid points and n is the dimension of the m-gon, i.e., the shorter length of the horizontal and vertical sides of an axis-parallel rectangle enclosing the m-gon. The paper next gives a simple algorithm which solves a two-variable integer programming problem with m constraints in O(m log m + log n) time where n is the dimension of a convex polygon corresponding to the feasible solution space. This improves the best known algorithm in complexity and simplicity. The paper finally presents algorithms for counting the number of grid points in a triangle or a simple polygon.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133564152","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}
引用次数: 15
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems 狗咬邮差:移动Voronoi图中的点定位及相关问题
International Journal of Computational Geometry and Applications Pub Date : 1993-09-30 DOI: 10.1142/S0218195998000163
O. Devillers, M. Golin
{"title":"Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems","authors":"O. Devillers, M. Golin","doi":"10.1142/S0218195998000163","DOIUrl":"https://doi.org/10.1142/S0218195998000163","url":null,"abstract":"We discuss two variations of the two-dimensional post-office problem that arise when the post-offices are replaced by n postmen moving with constant velocities. The first variation addresses the question: given a point qo and time to who is the nearest postman to qo at time to? We present a randomized incremental data structure that answers the query in expected O(log2n) time. The second variation views a query point as a dog searching for a postman to bite and finds the postman that a dog running with speed vo could reach first. We show that if the dog is quicker than all of the postmen then the data structure developed for the first problem permits us to solve the second one in O(log2n) time as well.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123243046","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}
引用次数: 20
Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" “构建最短值守路线的增量算法”的勘误表
International Journal of Computational Geometry and Applications Pub Date : 1991-12-16 DOI: 10.1142/S0218195999000212
X. Tan, T. Hirata, Y. Inagaki
{"title":"Corrigendum to \"An Incremental Algorithm for Constructing Shortest Watchman Routes\"","authors":"X. Tan, T. Hirata, Y. Inagaki","doi":"10.1142/S0218195999000212","DOIUrl":"https://doi.org/10.1142/S0218195999000212","url":null,"abstract":"The problem of finding the shortest watchman route in a simple polygon P through a point s on its boundary is considered. A route is a watchman route if every point inside P can be seen from at least one point along the route. We present an incremental algorithm that constructs the shortest watchman route in O(n3) time for a simple polygon with n edges. This improves the previous O(n4) bound.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131701504","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}
引用次数: 78
Dynamic Programming on Intervals 区间上的动态规划
International Journal of Computational Geometry and Applications Pub Date : 1991-12-16 DOI: 10.1142/S0218195993000208
Taro Asano
{"title":"Dynamic Programming on Intervals","authors":"Taro Asano","doi":"10.1142/S0218195993000208","DOIUrl":"https://doi.org/10.1142/S0218195993000208","url":null,"abstract":"We consider problems on intervals which can be solved by dynamic programming. Specifically, we give an efficient implementation of dynamic programming on intervals. As an application, an optimal sequential partition of a graph G=(V, E) can be obtained in O(m log n) time, where n = ¦V¦ and m = ¦E¦. We also present an O(n log n) time algorithm for finding a minimum weight dominating set of an interval graph G=(V, E), and an O(m log n) time algorithm for finding a maximum weight clique of a circular-arc graph G=(V, E), provided their intersection models of n intervals (arcs) are given.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139157","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}
引用次数: 10
Approximating Polygons and Subdivisions with Minimum Link Paths 用最小链接路径逼近多边形和细分
International Journal of Computational Geometry and Applications Pub Date : 1991-12-16 DOI: 10.1142/S0218195993000257
L. Guibas, J. Hershberger, Joseph S. B. Mitchell, J. Snoeyink
{"title":"Approximating Polygons and Subdivisions with Minimum Link Paths","authors":"L. Guibas, J. Hershberger, Joseph S. B. Mitchell, J. Snoeyink","doi":"10.1142/S0218195993000257","DOIUrl":"https://doi.org/10.1142/S0218195993000257","url":null,"abstract":"We study several variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We also discuss additional topological constraints such as simplicity.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123273945","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
An optimal construction method for generalized convex layers 广义凸层的最优构造方法
International Journal of Computational Geometry and Applications Pub Date : 1991-12-16 DOI: 10.1142/S0218195993000166
Hans-Peter Lenhof, M. Smid
{"title":"An optimal construction method for generalized convex layers","authors":"Hans-Peter Lenhof, M. Smid","doi":"10.1142/S0218195993000166","DOIUrl":"https://doi.org/10.1142/S0218195993000166","url":null,"abstract":"Let P be a set of n points in the Euclidean plane and let C be a convex figure. In 1985, Chazelle and Edelsbrunner presented an algorithm, which preprocesses P such that for any query point q, the points of P in the translate C+q can be retrieved efficiently. Assuming that constant time suffices for deciding the inclusion of a point in C, they provided a space and query time optimal solution. Their algorithm uses O(n) space. A query with output size k can be solved in O(log n+k) time. The preprocessing step of their algorithm, however, has time complexity O(n2). We show that the usage of a new construction method for layers reduces the preprocessing time to O(n log n). We thus provide the first space, query time and preprocessing time optimal solution for this class of point retrieval problems. Besides, we present two new dynamic data structures for these problems. The first dynamic data structure allows on-line insertions and deletions of points in O((log n)2) time. In this dynamic data structure, a query with output size k can be solved in O(log n+k(log n)2) time. The second dynamic data structure, which allows only semi-online updates, has O((log n)2) amortized update time and O(log n+k) query time.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127080399","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 maintaining the width and diameter of a planar point-set online 平面点集的宽度和直径在线保持问题
International Journal of Computational Geometry and Applications Pub Date : 1991-12-16 DOI: 10.1142/S021819599300021X
Ravi Janardan
{"title":"On maintaining the width and diameter of a planar point-set online","authors":"Ravi Janardan","doi":"10.1142/S021819599300021X","DOIUrl":"https://doi.org/10.1142/S021819599300021X","url":null,"abstract":"Efficient online algorithms are presented for maintaining the (almost-exact) width and diameter of a dynamic planar point-set, S. Let n be the number of points currently in S, let W and D denote the width and diameter of S, respectively, and let α and Β be positive, integer-valued parameters. The algorithm for the width problem uses O(αn) space, supports updates in O(α log2n) time, and reports in O(α log2n) time an approximation, ŵ, to the width such that (hat W/W leqslant sqrt {1 + tan ^2 tfrac{pi }{{4alpha }}}). The algorithm for the diameter problem uses O(Βn) space, supports updates in O(Βlogn) time, and reports in O(Β) time an approximation, D, to the diameter such that (hat D/D geqslant sin left( {tfrac{beta }{{beta + 1}}tfrac{pi }{2}} right)). Thus, for instance, even for α as small as 5, ŵ/W≤1.01, and for Β as small as 11, D/D≥.99. All bounds stated are worst-case. Both algorithms, but especially the one for the diameter problem, use well-understood data structures and should be simple to implement. The diameter result yields a fast implementation of the greedy heuristic for maximum-weight Euclidean matching and an efficient online algorithm to maintain approximate convex hulls in the plane.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128935379","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
A Simplified Technique for Hidden-Line Elimination in Terrains 一种简化的地形隐线消除技术
International Journal of Computational Geometry and Applications Pub Date : 1991-06-01 DOI: 10.1142/S0218195993000117
F. Preparata, J. Vitter
{"title":"A Simplified Technique for Hidden-Line Elimination in Terrains","authors":"F. Preparata, J. Vitter","doi":"10.1142/S0218195993000117","DOIUrl":"https://doi.org/10.1142/S0218195993000117","url":null,"abstract":"In this paper we give a simple and efficient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in $O((d + n)log^2 n)$ time, where $d$ is the size of the final display. The main data structure maintains an implicit representation of the convex hull of a set of points that can be dynamically updated in $O(log^2 n)$ time. It is especially simple and fast in our application since there are no rebalancing operations required in the tree.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"171 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120875419","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
The expected extremes in a Delaunay triangulation 德劳内三角剖分中预期的极值
International Journal of Computational Geometry and Applications Pub Date : 1991-03-01 DOI: 10.1007/3-540-54233-7_173
M. Bern, D. Eppstein, Frances F. Yao
{"title":"The expected extremes in a Delaunay triangulation","authors":"M. Bern, D. Eppstein, Frances F. Yao","doi":"10.1007/3-540-54233-7_173","DOIUrl":"https://doi.org/10.1007/3-540-54233-7_173","url":null,"abstract":"","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116020280","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}
引用次数: 71
首页 上一页
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学术官方微信