Presentation
Space-efficient geometric divide-and-conquer algorithms
Author/s | Bose, Prosenjit
Maheshwari, Anil Morin, Patrick Morrison, Jason Smid, Michiel Vahrenhold, Jan |
Publication Date | 2004 |
Deposit Date | 2017-03-02 |
Published in |
|
Abstract | We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving space-efficient algorithms for the closest-pair, bichromatic closest-pair, all-nearest-neighbors, and ... We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving space-efficient algorithms for the closest-pair, bichromatic closest-pair, all-nearest-neighbors, and orthogonal line segment intersection problems. |
Project ID. | D/0104616 |
Citation | Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M. y Vahrenhold, J. (2004). Space-efficient geometric divide-and-conquer algorithms. En 20th European Workshop on Computational Geometry, Sevilla. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Space-efficient geometric ... | 97.46Kb | [PDF] | View/ | |