Geometric Separation for Efficient Hashing
碩士 === 國立中正大學 === 資訊工程研究所 === 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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87804138467519488666 |