Algorithms and Data Structures: Third Workshop, WADS '93, Montreal, Canada, Augu
122,08 €
Computing the all-pairs longest chains in the plane. - A generalization of binary search. - Connected component and simple polygon intersection searching. - An optimal algorithm for finding the separation of simple polygons.
Jetzt bei Ebay:
