Repositorio de producción científica de la Universidad de Sevilla

Space-efficient geometric divide-and-conquer algorithms

 

Advanced Search
 
Opened Access Space-efficient geometric divide-and-conquer algorithms
Cites
Show item statistics
Icon
Export to
Author: Bose, Prosenjit
Maheshwari, Anil
Morin, Patrick
Morrison, Jason
Smid, Michiel
Vahrenhold, Jan
Date: 2004
Document type: Presentation
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 orthogonal line segment intersection problems.
Size: 97.46Kb
Format: PDF

URI: http://hdl.handle.net/11441/55067

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)