Computational Geometry

Ketan Mulmuley

Editura: Prentice Hall
For beginning graduate-level courses in computational geometry.This up-to-date and concise introduction to computational geometry - with emphasis on simple randomized methods - is designed for quick, easy access to beginners.
  • Limba : Engleza
  • Cuprins :

    I. BASICS.

    1. Quick-sort and Search.

    Quick-sort. Another view of quick-sort. Randomized binary trees. Skip lists.

    2. What Is Computational Geometry?

    Range queries. Arrangements. Trapezoidal decompositions. Convex polytopes. Voronoi diagrams. Hidden surface removal. Numerical precision and degeneracies. Early deterministic algorithms. Deterministic vs. randomized algorithms. The model of randomness.

    3. Incremental Algorithms.

    Trapezoidal decompositions. Convex polytopes. Voronoi diagrams. Configuration spaces. Tail estimates.

    4. Dynamic Algorithms.

    trapezoidal decompositions. Voronoi diagrams. History and configuration spaces. Rebuilding history. Deletions in history. Dynamic shuffling.

    5. Random Sampling.

    Configuration spaces with bounded valence. Top-down sampling. Bottom-up sampling. Dynamic sampling. Average conflict size. More dynamic algorithms. Range spaces and E-nets. Comparisons.


    6. Arr
  • Data Publicarii : 1993
  • Editie : 1
  • Format : Paperback
  • Numar pagini : 447
  • ISBN : 9780133363630
379.99 Lei
Livrare in 3-5 saptamani

Acest titlu se tipareste la comanda si poate fi livrat in 3-5 saptamani.