首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Enumerating Order Types for Small Point Sets with Applications
Authors:Aichholzer  Oswin  Aurenhammer  Franz  Krasser  Hannes
Institution:(1) Institute for Theoretical Computer Science, Graz University of Technology, Graz, Austria
Abstract:Order types are a means to characterize the combinatorial properties of a finite point configuration. In particular, the crossing properties of all straight-line segments spanned by a planar n-point set are reflected by its order type. We establish a complete and reliable data base for all possible order types of size n=10 or less. The data base includes a realizing point set for each order type in small integer grid representation. To our knowledge, no such project has been carried out before.We substantiate the usefulness of our data base by applying it to several problems in computational and combinatorial geometry. Problems concerning triangulations, simple polygonalizations, complete geometric graphs, and k-sets are addressed. This list of applications is not meant to be exhaustive. We believe our data base to be of value to many researchers who wish to examine their conjectures on small point configurations.
Keywords:computational geometry  order types  planar straight-line graphs  realizable matroids
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号