Geometric Separation for Efficient Hashing

• Main Authors: Liang, Sung-Lee, 連上里
• Other Authors: Lee, SingLin
• Format: Others
• Language: en_US
• Published: 1994
• Online Access: http://ndltd.ncl.edu.tw/handle/87804138467519488666

碩士 === 國立中正大學 === 資訊工程研究所 === 82 === In this thesis we introduce a geometric problem whose objec- tive is to find a line L which is the best projection for a set S of line segments in the plane. The best projection means that the maximum of the numeber of line segments in S intersecting with a line which is perpendicular to L is minimum. We present an algorithm to solve this geometric problem in O(n^3 log n) running time where n is the number of line segments in S. We then show how the solution of this geometric problem can be used to hash a point in a Voronoi diagram to determine which region it should be located on in an efficient way.