A New Algorithm in Geometry of Numbers

M. D. Sikirić, K. Rybnikov
{"title":"A New Algorithm in Geometry of Numbers","authors":"M. D. Sikirić, K. Rybnikov","doi":"10.1109/ISVD.2007.6","DOIUrl":null,"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.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.2007.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数几何中的一种新算法
如果一个晶格Delaunay多面体P的Delaunay球是围绕P限定的唯一椭球,则称其为完美多面体P。我们的方法克服了以前使用的方法的主要缺点[Du05]。我们已经实现并使用了我们的算法来寻找维度6,7,8的完美Delaunay多面体。我们的发现导致了一个新的猜想,揭示了晶格德劳内瓷砖的结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Deploy and Search Strategy for Multi-agent systems using Voronoi partitions Distance Trisector of Segments and Zone Diagram of Segments in a Plane Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable Boundaries Network-based Home Range Analysis Using Delaunay Triangulation The Role of Quasi-Regular Tetrahedra in Dense Disordered Packings of Hard Spheres
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1