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

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

筛选
英文 中文
Local Shape Control of a Bivariate Rational Interpolating Surface with Mixing Conditions 混合条件下二元有理插值曲面的局部形状控制
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.34
Yunfeng Zhang, Fangxun Bao, Caiming Zhang, Q. Duan
{"title":"Local Shape Control of a Bivariate Rational Interpolating Surface with Mixing Conditions","authors":"Yunfeng Zhang, Fangxun Bao, Caiming Zhang, Q. Duan","doi":"10.1109/ISVD.2011.34","DOIUrl":"https://doi.org/10.1109/ISVD.2011.34","url":null,"abstract":"A bivariate rational interpolation method with parameters was created which was based on function values and partial derivatives, it is called the bivariate rational interpolation with mixing conditions. This paper will deal with the bounded property and the point control method of the interpolating surface. It is proved that the values of the interpolating function in the interpolation region are bounded no matter what the parameters might be. Also, the approximation expressions of the interpolation are derived, it is not depends on the parameters. More important is that the value of the interpolating function at any point in the interpolating region can be modified under the condition that the interpolating data are not changed by selecting the suitable parameters, so the interpolation surface can be modified for the given interpolation data when needed in practical design.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"11 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":"127146335","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
Proximity and Motion Planning on l_1-Embeddable Tilings l_1-可嵌入平铺的接近性和运动规划
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.28
Norie Fu, Akihiro Hashikura, H. Imai
{"title":"Proximity and Motion Planning on l_1-Embeddable Tilings","authors":"Norie Fu, Akihiro Hashikura, H. Imai","doi":"10.1109/ISVD.2011.28","DOIUrl":"https://doi.org/10.1109/ISVD.2011.28","url":null,"abstract":"A motion planning problem on plane crystallographic graphs turned out to be important in nanotechnology due to recent innovation in techniques of handling real atoms on a physical lattice. The motion planning problem on graphs are well studied and it was shown that fast algorithms for proximity problems on graphs lead to fast motion planning algorithms. On the other hand, tilings are well studied as a model for plane crystallographic graphs and $l_1$-embeddable tilings are enumerated by Deza, Grishukhin and Shtogrin. In this paper, we focus on the geometry of tilings and propose two proximity algorithms on $l_1$-embeddable tilings for the application to nanotechnology. We show that Voronoi diagrams on tilings embeddable in the 3-dimensional $l_1$ lattice can be implicitly describes by Voronoi diagrams on the plane under appropriate convex piecewise linear functions with extra elaborations. We also propose a fast algorithm for another proximity problem, which we call nearest pair problem, on $l_1$-embeddable tilings. Using these algorithms, we propose algorithms for the motion planning problem on $l_1$-embeddable tilings.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"18 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":"125712409","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
Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation 演化测地线Delaunay三角剖分的各向同性网格简化
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.14
Shiqing Xin, Shuangmin Chen, Ying He, Guojin Wang, X. Gu, Hong Qin
{"title":"Isotropic Mesh Simplification by Evolving the Geodesic Delaunay Triangulation","authors":"Shiqing Xin, Shuangmin Chen, Ying He, Guojin Wang, X. Gu, Hong Qin","doi":"10.1109/ISVD.2011.14","DOIUrl":"https://doi.org/10.1109/ISVD.2011.14","url":null,"abstract":"In this paper, we present an intrinsic algorithm for isotropic mesh simplification. Starting with a set of unevenly distributed samples on the surface, our method computes the geodesic Delaunay triangulation with regard to the sample set and iteratively evolves the Delaunay triangulation such that the Delaunay edges become almost equal in length. Finally, our method outputs the simplified mesh by replacing each curved Delaunay edge with a line segment. We conduct experiments on numerous real-world models of complicated geometry and topology. The promising experimental results demonstrate that the proposed method is intrinsic and insensitive to initial mesh triangulation.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"153 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":"125747716","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
A Group of Orthogonal Basis Based on UE-Bézier Basis 基于ue - bsamizier基的一组正交基
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.32
Mei-e Fang, Guozhao Wang, Weiyin Ma
{"title":"A Group of Orthogonal Basis Based on UE-Bézier Basis","authors":"Mei-e Fang, Guozhao Wang, Weiyin Ma","doi":"10.1109/ISVD.2011.32","DOIUrl":"https://doi.org/10.1109/ISVD.2011.32","url":null,"abstract":"UE-Bezier (unified and extended Bezier) basis is the unified form of Bezier-like bases, including polynomial Bezier basis, trigonometric polynomial and hyperbolic polynomial Bezier basis. Similar to the original Bezier-like bases, UE-Bezier basis functions are not orthogonal. In this paper, a group of orthogonal basis is constructed based on UE-Bezier basis. The transformation matrices between UE-Bezier basis and the proposed orthogonal basis are also solved. As an example, we apply the proposed orthogonal basis and the transformation into the approximation of an inverse function by an UE-Bezier polynomial.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"19 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611187","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
Visibility-Based Coverage of Mobile Sensors in Non-convex Domains 基于可见性的移动传感器非凸域覆盖
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.22
Lin Lu, Yi-King Choi, Wenping Wang
{"title":"Visibility-Based Coverage of Mobile Sensors in Non-convex Domains","authors":"Lin Lu, Yi-King Choi, Wenping Wang","doi":"10.1109/ISVD.2011.22","DOIUrl":"https://doi.org/10.1109/ISVD.2011.22","url":null,"abstract":"The area coverage problem of mobile sensor networks has attracted much attention recently, as mobile sensors find many important applications in remote and hostile environments. However, the deployment of mobile sensors in a non-convex domain is nontrivial due to the more general shape of the domain and the attenuation of sensing capabilities caused by the boundary walls or obstacles. We consider the problem of exploration and coverage by mobile sensors in an unknown non-convex domain. We propose the definition of ``visibility-based Voronoi diagram'' and extend the continuous-time Lloyd's method, which only works for convex domains, to deploy the mobile sensors in the unknown environments in a distributed manner. Our simulations show the effectiveness of the proposed algorithms.","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":"130757454","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
Computing 2D Periodic Centroidal Voronoi Tessellation 二维周期质心Voronoi镶嵌计算
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.31
Dong‐Ming Yan, K. Wang, B. Lévy, Laurent Alonso
{"title":"Computing 2D Periodic Centroidal Voronoi Tessellation","authors":"Dong‐Ming Yan, K. Wang, B. Lévy, Laurent Alonso","doi":"10.1109/ISVD.2011.31","DOIUrl":"https://doi.org/10.1109/ISVD.2011.31","url":null,"abstract":"In this paper, we propose an efficient algorithm to compute the centroidal Voronoi tessellation in 2D periodic space. We first present a simple algorithm for constructing the periodic Voronoi diagram (PVD) from a Euclidean Voronoi diagram. The presented PVD algorithm considers only a small set of periodic copies of the input sites, which is more efficient than previous approaches requiring full copies of the sites (9 in 2D and 27 in 3D). The presented PVD algorithm is applied in a fast Newton-based framework for computing the centroidal Voronoi tessellation (CVT). We observe that full-hexagonal patterns can be obtained via periodic CVT optimization attributed to the convergence of the Newton-based CVT computation.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"18 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":"130545508","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}
引用次数: 30
Cut Locus Construction Using Deformable Simplicial Complexes 利用可变形单纯复合体构建切割轨迹
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.26
M. Misztal, J. A. Bærentzen, F. Anton, S. Markvorsen
{"title":"Cut Locus Construction Using Deformable Simplicial Complexes","authors":"M. Misztal, J. A. Bærentzen, F. Anton, S. Markvorsen","doi":"10.1109/ISVD.2011.26","DOIUrl":"https://doi.org/10.1109/ISVD.2011.26","url":null,"abstract":"In this paper we present a method for appproximating cut loci for a given point p on Riemannian 2D manifolds, closely related to the notion of Voronoi diagrams. Our method finds the cut locus by advecting a front of points equally distant from p along the geodesics originating at p and finding the lines of self-intersections of the front in the parametric space. This becomes possible by using the deformable simplicial complexes (DSC) method for deformable interface tracking. DSC provide a simple collision detection mechanism, allows for interface topology control, and does not require the domain to have disk topology. We test our method for tori of revolution and compare our results to the benchmark ones from. The method, however, is generic and can be easily adapted to construct cut loci for other manifolds of genera other than 1.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"41 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":"121655826","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
On Bisectors for Convex Distance Functions 凸距离函数的等分线
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.12
Chan He, H. Martini, Senlin Wu
{"title":"On Bisectors for Convex Distance Functions","authors":"Chan He, H. Martini, Senlin Wu","doi":"10.1109/ISVD.2011.12","DOIUrl":"https://doi.org/10.1109/ISVD.2011.12","url":null,"abstract":"It is well known that the construction of Voronoi diagrams is based on the notion of emph{bisector} of two given oints. Already in nor med linear spaces, bisectors have a complicated structure and can, for many classes of norms, only be described with the help of topological methods. Even more general, we present results on bisectors for convex distance functions (gauges). Let $C$, with the origin $o$ from its interior, be the compact, convex set inducing a convex distance function (gauge) in the plane, nd let $B(-x,x)$ be the bisector of $-x$ and $x$, i.e., the set of points $z$ such that the distance (measured with the convex distance function induced by $C$) from $z$ to $-x$ equals that from $z$ to $x$. For example, we prove the following characterization of the Euclidean norm within the family of all convex distance functions: if the set $L$ of points $x$ in the boundary $partial C$ of $C$ that creates $B(-x,x)$ as a straight line has non-empty interior with respect to $partial C$, then $C$ is an ellipse centered at the origin. For the sub case of nor med planes we give an easier approach, extending the result also to higher dimensions.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"19 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":"123550288","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}
引用次数: 13
2-Manifold Surface Sampling and Quality Estimation of Reconstructed Meshes 二流形曲面采样与重构网格质量估计
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.11
Wenyong Gong, Yong-Jin Liu, K. Tang, Tie-ru Wu
{"title":"2-Manifold Surface Sampling and Quality Estimation of Reconstructed Meshes","authors":"Wenyong Gong, Yong-Jin Liu, K. Tang, Tie-ru Wu","doi":"10.1109/ISVD.2011.11","DOIUrl":"https://doi.org/10.1109/ISVD.2011.11","url":null,"abstract":"Construction of intrinsic Delaunay triangulation (iDt for short) on 2-manifolds has attracted considerable attentions recently, due to its theoretical contributions to surface reconstruction. In this paper we analyze a 2-manifold sampling criterion based on iDt in a combinatorial way. The main contribution of this work is to establish the theoretical bounds of iDt mesh quality based on this sampling criterion. In order to construct the iDt mesh from sample points, we propose an approximate iDt mesh reconstruction algorithm using an edge propagation scheme. In real-world point cloud, holes or under sampling regions frequently exist. Based on the sampling criterion, an up sampling scheme and a hole filling algorithm are presented in this paper. Finally examples are presented, illustrating the effectiveness of our proposed algorithms.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"26 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":"125180955","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
A Raster-Based Algorithm for Voronoi Diagram Considering to Terrain 一种考虑地形的栅格Voronoi图算法
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering Pub Date : 2011-06-28 DOI: 10.1109/ISVD.2011.36
Li Yu, Jiatian Li, Ya Liu, Hua Wang, Yufeng He
{"title":"A Raster-Based Algorithm for Voronoi Diagram Considering to Terrain","authors":"Li Yu, Jiatian Li, Ya Liu, Hua Wang, Yufeng He","doi":"10.1109/ISVD.2011.36","DOIUrl":"https://doi.org/10.1109/ISVD.2011.36","url":null,"abstract":"In most of traditional raster-based algorithms for Voronoi diagram, terrain was less considered, so these algorithms are difficult to describe the Voronoi generating process which is affected by terrain. An Inflation Prototype with Terrain Constraints (IPTC) was proposed. The core of the prototype is what extracts terrain factors that restrict or promote Voronoi generation, and combines instance to convert the effect of these factors into a value of time-consumption that expresses how long each pixel needs to inflate. In accordance with inflation pattern of 8-neighborhoods, calculate accumulative time-consumption from generator to a specified pixel to judge which Voronoi region the pixel belongs to. It is shown in an experiment which takes time-consumption as the distance of the traditional raster-based algorithms to provide many potential applications for solving generating of space object.","PeriodicalId":152151,"journal":{"name":"2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering","volume":"40 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":"128558461","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
下一页 尾页
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学术官方微信