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

4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)最新文献

筛选
英文 中文
Detecting Stellar Streams in the Halos of Galaxies with Voronoi Tessellations 用Voronoi镶嵌探测星系晕中的恒星流
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.16
J. Sick, R. D. Jong
{"title":"Detecting Stellar Streams in the Halos of Galaxies with Voronoi Tessellations","authors":"J. Sick, R. D. Jong","doi":"10.1109/ISVD.2007.16","DOIUrl":"https://doi.org/10.1109/ISVD.2007.16","url":null,"abstract":"Galaxy formation models oriented towards a ACDM cosmology envision galaxies as being built through the accretion of dwarf galaxies. Such galaxy accretion should appear as tidally-disrupted streams of stars in the halo of the host galaxy. Yet these stellar streams have very low surface brightnesses, making their detection difficult. We propose that surface luminosity maps, derived from Hubble space telescope advanced camera for surveys resolved star photometry, can be used to reveal stellar structures in the halos of galaxies. To create surface luminosity maps with high, yet consistent, signal to noise, the centroidal Voronoi tessellation is used. The Voronoi tessellation offers the advantage of optimal binning to preserve spatial resolution. As preliminary testing has shown, the technique reveals halo structures, such as the dwarf galaxy near NGC 4631, as bright, compact, Voronoi regions.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123604740","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
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity 单量子位量子信道容量数值计算的误差分析
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.21
Kimikazu Kato, H. Imai, K. Imai
{"title":"Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity","authors":"Kimikazu Kato, H. Imai, K. Imai","doi":"10.1109/ISVD.2007.21","DOIUrl":"https://doi.org/10.1109/ISVD.2007.21","url":null,"abstract":"Numerical estimation of quantum channel capacity is an important problem both theoretically and practically. Oto et al. showed an effective approximation algorithm to compute a capacity of a one-qubit quantum channel. In this paper, we show an explicit upper bound for the error of their algorithm. The algorithm might be repeatedly used in the verification of a certain equation or inequality. The bound of the error we give is a criterion to decide when to stop that iteration, and eventually it can improve the performance of the whole process of the calculation.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129541334","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
Pursuit-Evasion Voronoi Diagrams in ell_1 求-避Voronoi图
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.33
Warren Cheung, W. Evans
{"title":"Pursuit-Evasion Voronoi Diagrams in ell_1","authors":"Warren Cheung, W. Evans","doi":"10.1109/ISVD.2007.33","DOIUrl":"https://doi.org/10.1109/ISVD.2007.33","url":null,"abstract":"We are given m pursuers and one evader. Each pursuer and the evader has an associated starting point in the plane, a maximum speed, and a start time. We also have a set of line segment obstacles with a total of n endpoints. Our task is to find those points in the plane, called the evader's region, that the evader can reach via evasive paths. A path is evasive if the evader can traverse the path from its starting point without encountering a pursuer along the way. The evader and the pursuers must obey their start time and speed constraints, and cannot go through obstacles. The partition of the plane into the evader's region and the remaining pursuers' region is called the pursuit-evasion Voronoi diagram. We study pursuit-evasion Voronoi diagrams for the lscr1 metric. We show that the complexity of the diagram is O((n + m)2(mn + m)) and that it can be calculated in polynomial time.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131024931","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
Network-based Home Range Analysis Using Delaunay Triangulation 基于网络的Delaunay三角分析法
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.31
J. Downs, M. Horner
{"title":"Network-based Home Range Analysis Using Delaunay Triangulation","authors":"J. Downs, M. Horner","doi":"10.1109/ISVD.2007.31","DOIUrl":"https://doi.org/10.1109/ISVD.2007.31","url":null,"abstract":"The home range is the fundamental measurement of fish and wildlife space-use patterns. Kernel density estimation (KDE) is the most widely applied home range estimator, although its poor performance has recently been documented. In this paper, we suggest that KDE is inappropriate for home range estimation, because it assumes Euclidean-based space usage. Because animal space-use patterns show characteristics of network-based movement, we develop a network-based home range estimator. First, we use Delaunay triangulation (DT) to approximate a network of travel paths from a set of animal point locations. Then, we adapt KDE to estimate home ranges as a function of that network. Preliminary results suggest that network-based home range estimation using DT has the potential to improve the way ecologists measure animal space-use patterns.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117227985","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
Artistic Pattern Generation by a Model of Territory Competing 地域竞争模式下的艺术模式生成
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.8
K. Sugihara
{"title":"Artistic Pattern Generation by a Model of Territory Competing","authors":"K. Sugihara","doi":"10.1109/ISVD.2007.8","DOIUrl":"https://doi.org/10.1109/ISVD.2007.8","url":null,"abstract":"This paper presents a method for generating artistic patterns using the Voronoi diagram. In this method, we start with a few of seed points, generate new sites at random, and assign them to one of the seed points based on the Voronoi diagram of the sites. The resulting territory patterns are colored by choosing paths in a color space. The patterns generated by this method have been adopted for calendars and magazine covers.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126323659","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
High Order Voronoi Sculpture 高阶Voronoi雕塑
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.28
J. D. Palmer
{"title":"High Order Voronoi Sculpture","authors":"J. D. Palmer","doi":"10.1109/ISVD.2007.28","DOIUrl":"https://doi.org/10.1109/ISVD.2007.28","url":null,"abstract":"While techniques exist to compute three dimensional Voronoi diagrams and their higher-order and generalized cousins, visualizing Voronoi diagrams and their underlying distance functions remains challenging. In this paper we specifically consider visual representations that take the form of shapes or sculptures formed from three dimensional iso-surfaces.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"1983 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134072689","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
Generating the Voronoi-Delaunay Dual Diagram for Co-Volume Integration Schemes 协体积积分方案Voronoi-Delaunay对偶图的生成
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.26
I. Sazonov, O. Hassan, K. Morgan, N. Weatherill
{"title":"Generating the Voronoi-Delaunay Dual Diagram for Co-Volume Integration Schemes","authors":"I. Sazonov, O. Hassan, K. Morgan, N. Weatherill","doi":"10.1109/ISVD.2007.26","DOIUrl":"https://doi.org/10.1109/ISVD.2007.26","url":null,"abstract":"Advantages of co-volume methods (based on the use of a high quality Voronoi diagram and the dual Delaunay mesh) for two- and three-dimensional computational electromagnetics are well known. The co-volume method is faster than traditional methods for an unstructured mesh and needs less memory. The co-volume integration scheme preserves energy, i.e. gives high accuracy of wave amplitude. It also gives better accuracy if the scattering objects has sharp corners or vertices. However, the co-volume method requires use of high quality unstructured dual Voronoi-Delaunay diagrams which cannot be created by classical mesh generation methods. For two-dimensional problems, a stitching method gives the best mesh quality for a wide variety of domains. Generation of a three-dimensional dual mesh appropriate for the use of a co-volume scheme is a much more difficult issue. Here, an approach is being developed where the main ideas of the stitching method are exploited. Some examples of three-dimensional meshes generated by this new method, as well as the results of the integration of Maxwell's equations on those meshes, are presented.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132556342","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
Generating Fractal Tiles using Voronoi Diagrams 使用Voronoi图生成分形图
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.25
T. Dobrowolski
{"title":"Generating Fractal Tiles using Voronoi Diagrams","authors":"T. Dobrowolski","doi":"10.1109/ISVD.2007.25","DOIUrl":"https://doi.org/10.1109/ISVD.2007.25","url":null,"abstract":"This paper introduces a fractal partition class defined over a unit wrapped space. The cells of a fractal partition have self-similarity property and can be used as a set of tiles that can tile Rn space periodically or quasi-periodically with non-uniform tiling density. An algorithm for generating set of fractal cells using Voronoi diagram computation is proposed with several applications in computer graphics and computational chemistry.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133187752","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
Voronoi diagram in optimal path planning 最优路径规划中的Voronoi图
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.43
P. Bhattacharya, M. Gavrilova
{"title":"Voronoi diagram in optimal path planning","authors":"P. Bhattacharya, M. Gavrilova","doi":"10.1109/ISVD.2007.43","DOIUrl":"https://doi.org/10.1109/ISVD.2007.43","url":null,"abstract":"In this paper, we provide an algorithm based on Voronoi diagram to compute an optimal path between source and destination in the presence of simple disjoint polygonal obstacles. We evaluate the quality of the path based on clearance from obstacles, overall length and smoothness. We provide a detailed description of the algorithm for Voronoi diagram maintenance and dynamic updates. Experimental results demonstrate superior performance of the method in relation to other path planning algorithms.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133438432","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}
引用次数: 128
Voronoi L-types and hypermetrics Voronoi l型和超度量
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007) Pub Date : 2007-07-09 DOI: 10.1109/ISVD.2007.47
M. Deza
{"title":"Voronoi L-types and hypermetrics","authors":"M. Deza","doi":"10.1109/ISVD.2007.47","DOIUrl":"https://doi.org/10.1109/ISVD.2007.47","url":null,"abstract":"It is a survey/research lecture, on Voronoi and Delaunay polytopes of lattices in relation, especially, to the following problems: 1) Voronoi L-type domains and non-rigidity degree of lattices, 2) Hypermetric cone and non-rigidity degree of Delaunay polytopes, 3) Voronoi conjecture for tilings.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127096128","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学术官方微信