The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.Query problem Let G C S and B C B. Store G and B in a datastructure such that for any object s 6 S we can efficiently ... In the dynamic case we can distinguish between three different cases: dynamic with respect to G, dynamic with ... So if we take S and G the set of objects, C the collection of all points, and B empty, we have formulated the intersection problem as a connectability ... For each combination of classes we get different problems that might need different solution methods.

Title | : | SWAT '88 |

Author | : | Rolf Karlsson, Andrzej Lingas |

Publisher | : | Springer Science & Business Media - 1988-06-22 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.