2015 | OriginalPaper | Buchkapitel
Randomized Versus Deterministic Point Placement Algorithms: An Experimental Study
verfasst von : Asish Mukhopadhyay, Pijus Kumar Sarker, Kishore Kumar Varadharajan Kannan
Erschienen in: Computational Science and Its Applications -- ICCSA 2015
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The point location problem is to determine the position of
n
distinct points on a line, up to translation and reflection by the fewest possible pairwise (adversarial) distance queries. In this paper we report on an experimental study of a number of deterministic point placement algorithms and an incremental randomized algorithm, with the goal of obtaining a greater insight into the behavior of these algorithms, particularly of the randomized one.