Isbn: 9781334015229 - ray shooting and other applications of spanning trees with low stabbing number (classic reprint) (3 risultati)

Perfeziona la tua ricerca

  • Libri (3)

  • Nuovo (3)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1334015228 / 9781334015229

    • Brossura

    Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 25,11

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Lingua: Inglese

    Editore: Forgotten Books, 2018

    1334015228 / 9781334015229

    • Brossura

    Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 24,57

    EUR 3,84 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 15 disponibili

    PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

  • Altre immagini

    Lingua: Inglese

    Editore: Forgotten Books, 2024

    1334015228 / 9781334015229

    • Brossura
    • Print on Demand

    Da: Forgotten Books, London, Regno UnitoForgotten Books

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 15,77

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. Print on Demand. This book explores the use of spanning trees with low stabbing numbers to solve efficiently a range of geometric problems like the arrangement of line segments in a plane, point location, polygon containment, and hidden surface removal. The book presents both deterministic and randomized algorithms that use roughly linear space (or sometimes quadratic space) and employ deterministic, rather than randomized, preprocessing techniques. The book derives from the work of researchers like Welzl, Edelsbrunner, Guibas, Suri and O'Rourke, and Agarwal and takes place within a broader research area of designing optimal algorithms for geometric problems. The author presents efficient algorithms that provide faster query times while still using roughly linear space, thus showcasing the versatility of spanning trees with low stabbing numbers as a tool that can be applied to obtain efficient algorithms for a large class of problems. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.