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

筛选
英文 中文
An Algorithm for the Calculation of Volume and Surface of Unions of Spheres. Application for Solvation Shells 一种计算球体结合部体积和表面的算法。申请溶剂化壳
V. Voloshin, A. Anikeenko, N. N. Medvedev, A. Geiger
{"title":"An Algorithm for the Calculation of Volume and Surface of Unions of Spheres. Application for Solvation Shells","authors":"V. Voloshin, A. Anikeenko, N. N. Medvedev, A. Geiger","doi":"10.1109/ISVD.2011.30","DOIUrl":"https://doi.org/10.1109/ISVD.2011.30","url":null,"abstract":"A simple algorithm for the calculation of the volume and surface area of a union of spheres of different radii is presented. It is based on the ideas published in S. Sastry et al, Phys. Rev. E, v.56, pp.5524-5532, 1997 [1], where they computed volume and surface of interatomic voids in simple liquids. They proposed to work with the intersection of Delaunay simplexes and the corresponding Voronoi polyhedra. Analytical formulas for volume and surface area were derived for the atoms occupying this region. This could be achieved without explicit calculation of multiple intersections of the overlapping atoms. We have implemented such ideas for the calculation of the occupied volume and its surface inside the polyhedra defined by power Voronoi diagram. This allows calculating the required values for spheres with different radii. Simple analytical formulas are also valid in this case. We applied our algorithm to the calculation of the solvation shell volume for complex solute molecules in molecular dynamics models of solutions. A comparison of our program with the available implementation of the certified algorithm for unions of spheres by F. Cazals et al. (ACM Trans. Math. Soft. 38 (1), 2011) [2] shows coincidence of the results.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"17 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":"126370282","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}
引用次数: 7
Global Topological Changes of Offset Domains 偏移域的全局拓扑变化
W. Li, Ralph Robert Martin
{"title":"Global Topological Changes of Offset Domains","authors":"W. Li, Ralph Robert Martin","doi":"10.1109/ISVD.2011.19","DOIUrl":"https://doi.org/10.1109/ISVD.2011.19","url":null,"abstract":"Offsetting is used in a range of CAD/CAM applications, such as tool path generation for pocket machining. In many applications, topological changes caused by offsetting are undesirable, and should be prevented, or detected. We present methods based on the medial axis transform to determine when a topological change may occur under an inward offset, an outward offset, or a combination of both, for a domain bounded by Jordan curves. In other applications, such as morphological image processing, a combination of outward and inward offsets are used to deliberately change the topology of a domain, e.g. to close small gaps in a region. Such an operation may fail to change the topology if certain conditions are not satisfied. We show how to detect such cases, and how to modify the domain's medial axis transform to achieve the intended topological change.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"16 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":"125744836","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
Uni-Directional Pedestrian Movement Model Based on Voronoi Diagrams 基于Voronoi图的单向行人运动模型
Ayano Nakamura, Mai Ishii, Hisamoto Hiyoshi
{"title":"Uni-Directional Pedestrian Movement Model Based on Voronoi Diagrams","authors":"Ayano Nakamura, Mai Ishii, Hisamoto Hiyoshi","doi":"10.1109/ISVD.2011.24","DOIUrl":"https://doi.org/10.1109/ISVD.2011.24","url":null,"abstract":"In the modern society, we have overflows of pedestrians in public spaces such as stations, sidewalks, and so on, resulting in congestion problems. Since delay from congestion caused by congestion yields economic and social loss, and pedestrians' mental distress, it is quite urgent to ease congestion. In this paper, a pedestrian movement model is proposed for the purpose of identifying the source of congestion. Our model is based on the Voronoi diagram for pedestrians, by which the position of each pedestrian can be determined. The proposed model is evaluated with a one-way passage as a pedestrian space. The obtained simulation results suggests that the model is useful for quantitative analysis.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"13 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":"131602892","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}
引用次数: 11
Multi-scale Curve Decomposition Based on Alpha-Shape 基于Alpha-Shape的多尺度曲线分解
Zhuangzhi Wu, Lu Feng
{"title":"Multi-scale Curve Decomposition Based on Alpha-Shape","authors":"Zhuangzhi Wu, Lu Feng","doi":"10.1109/ISVD.2011.40","DOIUrl":"https://doi.org/10.1109/ISVD.2011.40","url":null,"abstract":"In cartography curve simplification is a recurrent problem. The purpose is to remove irrelevant details while emphasizing the main features of the curve. Decomposition of curve is preprocessing of curve simplification. Most of the current techniques belong to the spatial domain (least square method, active contour, point selection). However, some techniques applying to the frequency domain (Fourier transform, wavelets) have also been introduced. This paper presents a new frequency method for curve decomposition based on alpha shape. It firstly utilizes the alpha shape to extract the envelope of the curve. And then, the filtered medial axis transform (FMAT) generate the base layer. By using different alpha values, we can get base layer in different scales. Future directions for work are presented at the end of this paper.","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":"121022136","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
Mobile Voronoi Diagrams for Traffic Monitoring under Bad Visibility Conditions 恶劣能见度条件下交通监测的移动Voronoi图
A. Viloria, Margarita Gonzalo Tasis, Rubén Martínez García, L. Fuentes, J. F. Codes
{"title":"Mobile Voronoi Diagrams for Traffic Monitoring under Bad Visibility Conditions","authors":"A. Viloria, Margarita Gonzalo Tasis, Rubén Martínez García, L. Fuentes, J. F. Codes","doi":"10.1109/ISVD.2011.38","DOIUrl":"https://doi.org/10.1109/ISVD.2011.38","url":null,"abstract":"A semiautomatic management of traffic scenes displays a large diversity of mobile data arising from usual Computer Vision techniques. The mobile nature of inputs requires the combination of different techniques for filtering, tracking, and clustering features along a video sequence. These problems are considerably harder in presence of low visibility conditions arising from rain, fog or dazzling conditions. It is necessary a robust coarse-to-fine approach for supporting early alert in presence of conflict or dangerous situation at road intersections. Currently, there is no a general solution developed for low visibility conditions, and what there is, has been developed following particular strategies involving a specific combination of filters for extracting and analyzing the situation. Under low visibility conditions, mobile features are clustered as blobs with similar motion patterns and labelled in terms of a mobile Voronoi site which represents the centroid of a coloured region with similar kinematic pattern. For a fixed camera, and in absence of information about relative velocities of vehicles, kinematic involves the relative variation of colour and shape. With low visibility conditions and for real-time response, it is not necessary to work with a large palette of colours, and a reduction of bits per pixel is performed in the preprocessing stage. We illustrate our results with some scenes where reflections in water (rainy weather) or discontinuities linked to fog, can produce hallucinations for which our approach provides a robust kinematic method justifying the application of mobile Voronoi diagrams for mobile blobs as unifying principle.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"88 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":"117309289","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
BetaMol: Molecular Modeling, Analysis, and Visualization Software Based on the Beta-Complex Derived from the Voronoi Diagram BetaMol:基于Voronoi图衍生β复合物的分子建模、分析和可视化软件
Youngsong Cho, Jae-Kwan Kim, Chung-In Won, Joonghyun Ryu, Chong-Min Kim, Deok-Soo Kim
{"title":"BetaMol: Molecular Modeling, Analysis, and Visualization Software Based on the Beta-Complex Derived from the Voronoi Diagram","authors":"Youngsong Cho, Jae-Kwan Kim, Chung-In Won, Joonghyun Ryu, Chong-Min Kim, Deok-Soo Kim","doi":"10.1109/ISVD.2011.15","DOIUrl":"https://doi.org/10.1109/ISVD.2011.15","url":null,"abstract":"Molecular shape is one of the most critical factors that determine molecular function. To properly understand the function of a molecule, it is necessary to explore its geometric properties more effectively and efficiently in addition to its physicochemical properties. Due to the complexity of the problems in biomolecular structure, in-silico approach is inevitable for many cases and is becoming more popular. In this paper, we introduce BetaMol, a comprehensive, powerful graphics-based software for molecular modeling, analysis, and visualization. BetaMol is based on the recent theory of the beta-complex which is derived from the Voronoi diagram of spheres. The entire set of powerful features of BetaMol is completely based on a single framework of the mathematically rigorous and computationally efficient theory of beta-complex. BetaMol is implemented in the standard C++ language with the OpenGL graphics library on Windows platform. Both BetaMol and some of its important functions ported for Linux platform are freely available at Voronoi Diagram Research Center website (http://voronoi.hanyang.ac.kr).","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"27 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":"114080028","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
Voronoi-Based Potentially Visible Set and Visibility Query Algorithms 基于voronoi的潜在可见集和可见性查询算法
Lin Lu, Chenglei Yang, Weizhen Wang, Junqing Zhang
{"title":"Voronoi-Based Potentially Visible Set and Visibility Query Algorithms","authors":"Lin Lu, Chenglei Yang, Weizhen Wang, Junqing Zhang","doi":"10.1109/ISVD.2011.39","DOIUrl":"https://doi.org/10.1109/ISVD.2011.39","url":null,"abstract":"In this paper, we propose the concept of Voronoi-based potentially visible set, called Vtext underscore PVS, to facilitate the visibility computation. Given a polygon $P$, we first compute the Voronoi diagram of $P$, i.e., $text{VD}(P)$. Then we refine $text{VD}(P)$ into $text{VD}(P')$, so that $text{VD}(P')$ only contains triangular or quadrangular cells. For each Voronoi edge, a Vtext underscore PVS is computed, which stores the visibility information of the Voronoi vertices and critical points on the edge. Based on the Vtext underscore PVS, we can fast query the visibility polygons of an arbitrary point, a segment or a trajectory, a region, and a moving point using a uniform data structure.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"56 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":"128401165","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
Meshing Surfaces and Volumes with Centroidal Voronoi Tesselations 网格表面和体积与质心Voronoi镶嵌
B. Lévy
{"title":"Meshing Surfaces and Volumes with Centroidal Voronoi Tesselations","authors":"B. Lévy","doi":"10.1109/ISVD.2011.41","DOIUrl":"https://doi.org/10.1109/ISVD.2011.41","url":null,"abstract":"We present several variations on Centroidal Voronoi Tesselations. First we review the classical definition, as a stable critical point of an objective function (quantization noise power), then we propose some modifications of the objective function (anisotropy, Lp norm). The so-modified Centroidal Voronoi Tesselations are useful for applications in geometry processing. Thus we demonstrate feature-aware surface remeshing, hexaedral-dominant meshing of 3D domains and fitting subdivision surfaces to unstructured triangle sets.","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":"129921929","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
Exact Computation of the Voronoi Diagram of Spheres in 3D, Its Topology and Its Geometric Invariants 球面三维Voronoi图的精确计算及其拓扑结构和几何不变量
F. Anton, D. Mioc, M. Santos
{"title":"Exact Computation of the Voronoi Diagram of Spheres in 3D, Its Topology and Its Geometric Invariants","authors":"F. Anton, D. Mioc, M. Santos","doi":"10.1109/ISVD.2011.16","DOIUrl":"https://doi.org/10.1109/ISVD.2011.16","url":null,"abstract":"In this paper, we are addressing the exact computation of the Delaunay graph (or quasi-triangulation) and the Voronoi diagram of spheres using Wu's algorithm. Our main contribution is first a methodology for automated derivation of invariants of the Delaunay empty circumcircle predicate for spheres and the Voronoi vertex of four spheres, then the application of this methodology to get all geometrical invariants that intervene in this problem and the exact computation of the Delaunay graph and the Voronoi diagram of spheres. To the best of our knowledge, there does not exist a comprehensive treatment of the exact computation with geometrical invariants of the Delaunay graph and the Voronoi diagram of spheres. Starting from the system of equations defining the zero-dimensional algebraic set of the problem, we are following Wu's algorithm to transform the initial system into an equivalent Wu characteristic (triangular) set. In the corresponding system of algebraic equations, in each polynomial (except the first one), the variable with higher order from the preceding polynomial has been eliminated (by pseudo-remainder computations) and the last polynomial is a polynomial of a single variable. By regrouping all the formal coefficients for each monomial in each polynomial, we get polynomials that are invariants for the given problem. We rewrite the original system by replacing the invariant polynomials by new formal coefficients. We repeat the process until all the algebraic relationships (syzygies) between the invariants have been found by applying Wu's algorithm on the invariants.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"32 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":"130817127","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
The $L_infty$ Hausdorff Voronoi Diagram Revisited 重新访问$L_infty$ Hausdorff Voronoi图
Evanthia Papadopoulou, Jinhui Xu
{"title":"The $L_infty$ Hausdorff Voronoi Diagram Revisited","authors":"Evanthia Papadopoulou, Jinhui Xu","doi":"10.1109/ISVD.2011.17","DOIUrl":"https://doi.org/10.1109/ISVD.2011.17","url":null,"abstract":"We revisit the L-infinity Hausdorff Voronoi diagram of clusters of points, equivalently, the L-infinity Hausdorff Voronoi diagram of rectangles, and present a plane sweep algorithm for its construction that generalizes and improves upon previous results. We show that the structural complexity of the L-infinity Hausdorff Voronoi diagram is Theta(n+m), where n is the number of given clusters and m is the number of essential pairs of crossing clusters. The algorithm runs in O((n+M)log n) time and O(n+M) space where M is the number of potentially essential crossings; m, M are O(n^2), m = M, but m = M, in the worst case. In practice m;M","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"115 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":"133231788","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}
引用次数: 4
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学术官方微信