2013 10th International Symposium on Voronoi Diagrams in Science and Engineering最新文献

Voronoi Diagrams from (Possibly Discontinuous) Embeddings 来自(可能不连续的)嵌入的Voronoi图

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.13

M. Kapl, F. Aurenhammer, B. Jüttler

引用次数: 0

On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions 三维线段的最近邻Voronoi图

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.15

G. Barequet, Evanthia Papadopoulou

引用次数: 2

Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input 直骨架和Voronoi图的识别及其输入重构

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.11

T. Biedl, M. Held, S. Huber

引用次数: 11

A Sweepline Algorithm for Higher Order Voronoi Diagrams 高阶Voronoi图的扫线算法

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.17

Maksym Zavershynskyi, Evanthia Papadopoulou

引用次数: 11

Molecular Geometry: A New Challenge and Opportunity for Geometers 分子几何学:几何学家的新挑战与机遇

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.16

Deok-Soo Kim

{"title":"Molecular Geometry: A New Challenge and Opportunity for Geometers","authors":"Deok-Soo Kim","doi":"10.1109/ISVD.2013.16","DOIUrl":"https://doi.org/10.1109/ISVD.2013.16","url":null,"abstract":"Summary form only given. Molecular structure determines molecular function and the geometry is one of the most fundamental aspects of the molecular structure regardless it is organic or inorganic. Despite of its importance, the theory for understanding the geometry of molecules has not been sufficiently developed. In this talk, we will present a unified theory of molecular geometry (MG) as a new discipline and demonstrate how the theory can be used for \"accurately\", \"efficiently\", and \"conveniently\" solving all molecular problems related on structure.The MG theory is based on the beta-complex which is a derived structure from the Voronoi diagram of atoms and its dual structure called the quasi-triangulation. Voronoi diagrams are everywhere in nature and are useful for understanding the spatial structure among generators. Unlike the well-known ordinary Voronoi diagram of points, the Voronoi diagram of spherical atoms has been known to be difficult to compute and to possess a few anomaly cases. Once computed, however, it nicely defines the proximity among the atoms in molecules.This talk will discuss the quasi-triangulation, the dual structure of the Voronoi diagram of atoms, and the beta-complex in the three-dimensional space. It turns out that the beta-complex, together with the Voronoi diagram and quasi-triangulation, can be used to accurately, efficiently, and conveniently solve seemingly unrelated geometry and topology problems for molecules within a single theoretical and computational framework. Among many application areas which will be explained, structural molecular biology and noble material design are the most immediate application area. In this talk, we will also demonstrate our molecular modeling and analysis software, BetaMol in 3D and BetaConcept in 2D, which are entirely based on the beta-complex and the Voronoi diagram. Programs are freely available at the Voronoi Diagram Research Center (VDRC, http://voronoi.hanyang.ac.kr/).","PeriodicalId":344701,"journal":{"name":"2013 10th International Symposium on Voronoi Diagrams in Science and Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128588781","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

Open Problem: A Formula for Calculation of the Voronoi S-region Volume 开放问题:Voronoi s区域体积的计算公式

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.14

N. N. Medvedev, V. Voloshin

引用次数: 1

Design of Pop-Up Cards Based on Weighted Straight Skeletons 基于加权直骨架的弹出式卡片设计

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.9

K. Sugihara

引用次数: 8

Centroidal Voronoi Tessellation of Streamlines for Flow Visualization 流动可视化流线的质心Voronoi镶嵌

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.8

Wenjie Liu, Lin Lu, B. Lévy, Chenglei Yang, Xiangxu Meng

引用次数: 4

Delaunay Triangulations on the Word RAM: Towards a Practical Worst-Case Optimal Algorithm Word RAM上的Delaunay三角剖分:一种实用的最坏情况最优算法

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.10

Okke Schrijvers, F.F.J.M. van Bommel, K. Buchin

{"title":"Delaunay Triangulations on the Word RAM: Towards a Practical Worst-Case Optimal Algorithm","authors":"Okke Schrijvers, F.F.J.M. van Bommel, K. Buchin","doi":"10.1109/ISVD.2013.10","DOIUrl":"https://doi.org/10.1109/ISVD.2013.10","url":null,"abstract":"The Delaunay triangulation of n points in the plane can be constructed in o(n log n) time when the coordinates of the points are integers from a restricted range. However, algorithms that are known to achieve such running times had not been implemented so far. We explore ways to obtain a practical algorithm for Delaunay triangulations in the plane that runs in linear time for small integers. For this, we first implement and evaluate two variants of BrioDC, an algorithm that is known to achieve this bound. We implement the first O(n)-time algorithm for constructing Delaunay triangulations and found that our implementations are practical. While we do not improve upon fast existing algorithms (with non-optimal worst-case running time) for realistic data sets, our BrioDC implementations do give us insight into the optimal time needed for point location. Secondly, we implement and evaluate variants of BRIO, an algorithm which has an O(n log n) worst-case running time on small integers but runs faster for many distributions. Our variants aim to avoid bad worst-case behavior, which is due to high point location time. Our BrioDC implementation shows that point location time can be reduced by 25% and our squarified space-filling curve orders show the first improvement by reducing this by 3%.","PeriodicalId":344701,"journal":{"name":"2013 10th International Symposium on Voronoi Diagrams in Science and Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123923246","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}

引用次数: 5

Common Influence Region Queries 常见影响区域查询

2013 10th International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2013-07-08 DOI: 10.1109/ISVD.2013.12

Marta Fort, J. A. Sellarès

引用次数: 2