Sciweavers

    SIAMCOMP
    1998
    141views more  SIAMCOMP 1998»
    Randomized Data Structures for the Dynamic Closest-Pair Problem
    15 years 2 months ago
    Randomized Data Structures for the Dynamic Closest-Pair Problem
    Download  repository.ust.hk
    We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
    Mordecai J. Golin, Rajeev Raman, Christian Schwarz...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.