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

2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering最新文献

筛选
英文 中文
Protein Packing Quality Using Delaunay Complexes Delaunay配合物的蛋白质包装质量研究
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.23
R. Fonseca, P. Winter, K. Karplus
{"title":"Protein Packing Quality Using Delaunay Complexes","authors":"R. Fonseca, P. Winter, K. Karplus","doi":"10.1109/ISVD.2011.23","DOIUrl":"https://doi.org/10.1109/ISVD.2011.23","url":null,"abstract":"A new method for estimating the packing quality of protein structures is presented. Atoms in high quality protein crystal structures are very uniformly distributed which is difficult to reproduce using structure prediction methods. Packing quality measures can therefore be used to assess structures of low quality and even to refine them. Previous methods mainly use the Voronoi cells of atoms to assess packing quality. The presented method uses only the lengths of edges in the Delaunay complex which is faster to compute since volumes of Voronoi cells are not evaluated explicitly. This is a novel application of the Delaunay complex that can improve the speed of packing quality computations. Doing so is an important step for, e.g., integrating packing measures into structure refinement methods. High- and low-resolution X-ray crystal structures were chosen to represent well- and poorly-packed structures respectively. Our results show that the developed method is correlated to the well-established RosettaHoles2 but three times faster.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127276709","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
Generalized Voronoi Diagram Computation on GPU GPU上的广义Voronoi图计算
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.18
Zhan Yuan, Guodong Rong, X. Guo, Wenping Wang
{"title":"Generalized Voronoi Diagram Computation on GPU","authors":"Zhan Yuan, Guodong Rong, X. Guo, Wenping Wang","doi":"10.1109/ISVD.2011.18","DOIUrl":"https://doi.org/10.1109/ISVD.2011.18","url":null,"abstract":"We study the problem of using the GPU to compute the generalized Voronoi diagram (GVD) for higher-order sites, such as line segments and curves. This problem has applications in many fields, including computer animation, pattern recognition and so on. A number of methods have been proposed that use the GPU to speed up the computation of the GVD. The jump flooding algorithm (to be called JFA) is such an efficient GPU-based method that is particularly suitable for computing the ordinary Voronoi diagram of point sites. We improve the jump flooding algorithm and apply it to computing the GVD. Specifically, instead of directly propagating the complete information of a site (i.e. the coordinates or other geometric parameters) as in the original JFA, we store the site information in a 1-D texture, and propagate only the IDs, which are short integers, of the sites in another 2D texture to generate the Voronoi diagram. This simple strategy avoids storing redundant data and leads to considerately more accurate computation of the GVD with much less memory than using the original JFA, with only moderate increase of the running time.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039564","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}
引用次数: 14
Vroni and ArcVroni: Software for and Applications of Voronoi Diagrams in Science and Engineering Vroni和ArcVroni: Voronoi图在科学和工程中的软件和应用
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.9
M. Held
{"title":"Vroni and ArcVroni: Software for and Applications of Voronoi Diagrams in Science and Engineering","authors":"M. Held","doi":"10.1109/ISVD.2011.9","DOIUrl":"https://doi.org/10.1109/ISVD.2011.9","url":null,"abstract":"We survey algorithms and software for computing Voronoi diagrams of points, line segments and circular arcs in the Euclidean plane, and report on an experimental evaluation of two state-of-the-art Voronoi codes: Held's VRONI and the Voronoi code implemented by Karavelas within the framework of the CGAL project. We conclude this survey by an extensive (albeit not comprehensive) discussion of applications of Voronoi-based algorithms in diverse fields.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124889680","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
Half-Plane Voronoi Diagram 半平面Voronoi图
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.25
Chenglin Fan, Jun Luo, Jinfei Liu, Yinfeng Xu
{"title":"Half-Plane Voronoi Diagram","authors":"Chenglin Fan, Jun Luo, Jinfei Liu, Yinfeng Xu","doi":"10.1109/ISVD.2011.25","DOIUrl":"https://doi.org/10.1109/ISVD.2011.25","url":null,"abstract":"In normal Voronoi diagram, each site is able to see all points in the plane. In this paper, we study the problem such that each site is only able to see half-plane and construct the so-called Half-plane Voronoi Diagram (HPVD). We show that the half-plane Voronoi cell of each site is not necessary convex and it could consist of many disjoint regions. We prove that the complexity of the HPVD of n sites is $O(n^2)$. Then we give an algorithm of $O(nlog n)$ time and $O(n)$ space to construct HPVD such that the boundary lines of all half-planes are parallel and the visible half-planes are in the same side of the corresponding boundary lines. For the parallel boundary lines where the visible half-planes could be in either side of the corresponding boundary lines, we give an algorithm of $O(n^2)$ time and $O(n^2)$ space to construct HPVD.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"156 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594898","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}
引用次数: 8
Effective Privacy Preserved Clustering Based on Voronoi Diagram 基于Voronoi图的有效隐私保护聚类
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.35
Jinfei Liu, Jun Luo, Chenglin Fan
{"title":"Effective Privacy Preserved Clustering Based on Voronoi Diagram","authors":"Jinfei Liu, Jun Luo, Chenglin Fan","doi":"10.1109/ISVD.2011.35","DOIUrl":"https://doi.org/10.1109/ISVD.2011.35","url":null,"abstract":"Consider a scenario like this: a data holder, such as a hospital (data publisher) wants to share patients' data with researcher (data user). However, due to privacy issue, the hospital could not publish the exact original data while the published data need to retain as much as possible the correlation of the original data for utility consideration. The entire existing models for publishing private data could not perfectly resolve the tradeoff between privacy and utility of the private data. This paper presents a novel private information publishing model Semi-Delaunay Diagram (SDD) based on Voronoi diagram and gives a clustering algorithm VDC based on SDD. This model not only protects privacy but also achieves a perfect clustering correlation. Extensive experiments show the different clustering results with the different input area parameter, and confirm that our VDC algorithm discovers clusters with arbitrary shape as DBSCAN algorithm does.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128803297","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
Why Are Voronoi Diagrams so Fruitful in Application? 为什么Voronoi图在应用中如此富有成效?
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.10
K. Sugihara
{"title":"Why Are Voronoi Diagrams so Fruitful in Application?","authors":"K. Sugihara","doi":"10.1109/ISVD.2011.10","DOIUrl":"https://doi.org/10.1109/ISVD.2011.10","url":null,"abstract":"The Voronoi diagram has many possible applications in a variety of areas, including industry and the social sciences. In this paper, we survey some typical applications and consider why this concept is so fruitful. It is the viewpoint of the author that most existing applications arise from the three basic kinds of information the Voronoi diagram provides, namely, the shapes of the dominant regions, the neighbor relations, and the structures of empty space.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114121514","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}
引用次数: 8
Updates on Voronoi Diagrams 关于Voronoi图表的更新
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.33
J. Dinis, M. Mamede
{"title":"Updates on Voronoi Diagrams","authors":"J. Dinis, M. Mamede","doi":"10.1109/ISVD.2011.33","DOIUrl":"https://doi.org/10.1109/ISVD.2011.33","url":null,"abstract":"The sweep line technique has been recently adapted to the sphere in order to build Voronoi diagrams of points on its surface. The resulting algorithm has proved to be simple and efficient, outperforming the freely available alternatives, which compute convex hulls of point sets in 3D. In this paper, we introduce two sweep algorithms for updating Voronoi diagrams, one for deleting and another for inserting a site, which are applicable to points on the sphere surface or on the plane. The algorithms operate directly on the doubly connected edge lists that implement the Voronoi diagram. This makes them preferable when the intended data is the Voronoi diagram, which happens, for instance, when natural neighbour interpolation is performed. Both algorithms require linear space. Besides, insertion runs in linear time, which is worst-case optimal, whereas deletion runs in super-linear time. Although the deletion running time is not asymptotically optimal, both algorithms cope very well with degenerated cases, are efficient, and are practical to implement. Experimental results in both domains reveal that their performances are better than or similar to those of the CGAL library, which work on Delaunay triangulations.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124018942","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
Minimizing the Number of Separating Circles for Two Sets of Points in the Plane 最小化平面上两组点的分离圆的数量
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.21
Jiaye Wang, Feng Sun, Wenping Wang, C. Miao, Caiming Zhang
{"title":"Minimizing the Number of Separating Circles for Two Sets of Points in the Plane","authors":"Jiaye Wang, Feng Sun, Wenping Wang, C. Miao, Caiming Zhang","doi":"10.1109/ISVD.2011.21","DOIUrl":"https://doi.org/10.1109/ISVD.2011.21","url":null,"abstract":"Given two sets of points $mathbb{R}$ and $mathbb{B}$ in the plane, we address the problem of finding a set of circles $mathbb{C} = {c_i, i= 1, 2, ldots, k}$, satisfying the condition that every point in $mathbb{R}$ is covered by at least one circle $c_i$ and each point in $mathbb{B}$ is not covered by any circle $c_i, i = 1, 2, ldots k$. We conjecture that to find such a set with the smallest $k$ is NP-complete. In this paper, we present an approximation algorithm for computing the set with minimal number of such circles. The algorithm finds also a lower bound of the smallest $k$.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124984228","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
Global Surface Remeshing Using Symmetric Delaunay Triangulation in Uniformization Spaces 均匀化空间中使用对称Delaunay三角剖分的全局表面网格重划分
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.29
W. Zeng, Rui Shi, X. Gu
{"title":"Global Surface Remeshing Using Symmetric Delaunay Triangulation in Uniformization Spaces","authors":"W. Zeng, Rui Shi, X. Gu","doi":"10.1109/ISVD.2011.29","DOIUrl":"https://doi.org/10.1109/ISVD.2011.29","url":null,"abstract":"Surface remeshing plays a fundamental role in digital geometry processing. In this paper, we present a novel framework for global surface remeshing based on symmetric Delaunay triangulations on the uniformization spaces. Surfaces with arbitrary topologies can be uniformized to one of three canonical uniformization spaces: the sphere, the Euclidean plane and the hyperbolic plane. The uniformization process induces a symmetry group. A triangulation on the original surface is converted to a triangulation on the uniformization space, which is invariant under the symmetry group, and vice versa. Furthermore, the uniformization process preserves angles, so a symmetric dense Delaunay triangulation on the uniformization space induces a good triangulation on the original surface. We construct the uniformization of surfaces with arbitrary topologies using Ricci flow, and apply orbit insertion technique to the Delaunay refinement algorithm which ensures the symmetry. Experimental results demonstrates that our method is global, intrinsic, general and efficient.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130476892","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
Rescue Boat Voronoi Diagrams for Inhomogeneous, Anisotropic, and Time-Varying Distances 非均匀、各向异性和时变距离的救助船Voronoi图
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.20
K. Sugihara
{"title":"Rescue Boat Voronoi Diagrams for Inhomogeneous, Anisotropic, and Time-Varying Distances","authors":"K. Sugihara","doi":"10.1109/ISVD.2011.20","DOIUrl":"https://doi.org/10.1109/ISVD.2011.20","url":null,"abstract":"We introduce a new generalization for the boat-sail distance. Whereas the boat-sail distance was originally defined for static flows of water, we generalize using a time-varying flow. This generalization can be used to model the behavior of a boat on a stormy ocean or in a bay with a tidal ebb and flow. We construct a robust method for computing the boat-sail distance. We then define a new generalized Voronoi diagram, called a ``rescue boat Voronoi diagram'', which identifies the rescue boat that can reach a broken-down ship the fastest. This involves more than a simple generalization for the boat-sail distance, because the broken-down ship hanges its location according to the ocean flow. We examine the properties of this Voronoi diagram and discuss its relationships with existing Voronoi diagrams.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130919932","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信