{"title":"Voronoi diagram based on a non-convex pattern : an application to extract patterns from a cloud of points","authors":"L. Idoumghar, M. Melkemi","doi":"10.1109/ISVD.2007.42","DOIUrl":"https://doi.org/10.1109/ISVD.2007.42","url":null,"abstract":"In this article, we propose a new generalization of the Voronoi diagram and the Euclidean a-shape. These new concepts are applied to retrieve from a set of points shapes identical to the shape of a known pattern, independently of translation, rotation and scaling transforms.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"22 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":"131314252","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}
{"title":"A New Algorithm in Geometry of Numbers","authors":"M. D. Sikirić, K. Rybnikov","doi":"10.1109/ISVD.2007.6","DOIUrl":"https://doi.org/10.1109/ISVD.2007.6","url":null,"abstract":"A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the previously used method [Du05]. We have implemented and used our algorithm for finding perfect Delaunay polytopes in dimensions 6, 7, 8. Our findings lead to a new conjecture that sheds light on the structure of lattice Delaunay tilings.","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":"130053649","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}
{"title":"The Role of Quasi-Regular Tetrahedra in Dense Disordered Packings of Hard Spheres","authors":"A. Anikeenko, N. N. Medvedev","doi":"10.1109/ISVD.2007.36","DOIUrl":"https://doi.org/10.1109/ISVD.2007.36","url":null,"abstract":"Delaunay simplexes were used for structure analysis of hard sphere packings of different density. A special attention was paid to the simplexes of tetrahedral shape. Clusters of the tetrahedra adjacent by faces represent relatively dense aggregates of spheres atypical for crystalline structures. Such \"polytetrahedral\" aggregates reveal a characteristic feature of the dense disordered packings. The tetrahedra in point are not completely perfect. They coincide with the class of \"quasi-regular tetrahedra\" introduced by Hales in his proof of the Kepler conjecture. In this work we discuss a meaning of these tetrahedra and their role in formation of the dense disordered packings. Polytetrahedral principle of a spatial organization seems to be preferable from the statistical viewpoint, as in this case a variety of dense local configurations can be realized. However it has its limit and further increase in density can be provided by formation of crystalline nuclei.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"1 2 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":"117317623","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}
{"title":"Reversibility of the Quad-Edge operations in the Voronoi data structure","authors":"D. Mioc, F. Anton, C. Gold, B. Moulin","doi":"10.1109/ISVD.2007.34","DOIUrl":"https://doi.org/10.1109/ISVD.2007.34","url":null,"abstract":"In geographic information systems the reversibility of map update operations have not been explored yet. In this paper we are using the Voronoi based quad-edge data structure to define reversible map update operations. The reversibility of the map operations have been formalised at the lowest level, as the basic algorithms for addition, deletion and moving of spatial objects. Having developed reversible map operations on the lowest level, we were able to maintain reversibility of the map updates at higher level as well. The reversibility in GIS can be used for efficient implementation of rollback mechanisms and dynamic map visualisations.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"32 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":"133548158","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}
{"title":"Deploy and Search Strategy for Multi-agent systems using Voronoi partitions","authors":"K. Guruprasad, Debasish Ghose","doi":"10.1109/ISVD.2007.15","DOIUrl":"https://doi.org/10.1109/ISVD.2007.15","url":null,"abstract":"In this paper we analyze a deploy and search strategy for multi-agent systems. Mobile agents equipped with sensors carry out search operation in the search space. The lack of information about the search space is modeled as an uncertainty density distribution over the space, and is assumed to be known to the agents a priori. In each step, the agents deploy themselves in an optimal way so as to maximize per step reduction in the uncertainty density. We analyze the proposed strategy for convergence and spatial distributedness. The control law moving the agents has been analyzed for stability and convergence using LaSalle's in- variance principle, and for spatial distributedness under a few realistic constraints on the control input such as constant speed, limit on maximum speed, and also sensor range limits. The simulation experiments show that the strategy successfully reduces the average uncertainty density below the required level.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"70 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":"114148025","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}
{"title":"On Sweep-plane Analysis of Laguerre Voronoi Diagram","authors":"M. Gavrilova, J. Rokne","doi":"10.1109/ISVD.2007.32","DOIUrl":"https://doi.org/10.1109/ISVD.2007.32","url":null,"abstract":"We discuss application of the sweep-plane technique for the construction of weighted Voronoi diagram in Laguerre geometry (or Laguerre Voronoi diagram). It is shown that the attempt to construct Laguerre Voronoi diagram utilizing the sweep-plane approach transforms the original problem for a given set of weighted sites to the problem of constructing Laguerre diagram for a different set of sites. It follows that the weighted Voronoi diagram in Laguerre geometry is an invariant of a family of all input sets of sites.","PeriodicalId":148710,"journal":{"name":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","volume":"63 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":"126444797","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}