1985 | OriginalPaper | Buchkapitel
Geometric Searching
verfasst von : Franco P. Preparata, Michael Ian Shamos
Erschienen in: Computational Geometry
Verlag: Springer New York
Enthalten in: Professional Book Archive
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
To describe searching in its simplest abstract setting, suppose we have some accumulated data (called the “file”) and some new data item (called the “sample”). Searching consists of relating the sample to the file. Accessory operations—conceptually not a part of searching—may involve absorbing the sample into the file, deleting the sample from the file if already present, and so on. As Knuth (1973) points out, searching means to locate the appropriate record (or records) in a given collection of records.