An Efficient k Nearest Neighbor Searching Algorithm for a Query Line
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Dynamically Maintaining the Widest k -Dense Corridor
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
An efficient k nearest neighbors searching algorithm for a query line
Theoretical Computer Science
Improved Algorithm for a Widest 1-Corner Corridor
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Improved algorithm for the widest empty 1-corner corridor
Information Processing Letters
Locating an Obnoxious Line among Planar Objects
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
| Hi-index | 0.89 |