On constructing the relative neigborhood graphs in euclidean K-dimensional Spaces.
Algoritmus na konštrukcii grafu relatívnej blízkosti množiny n bodov v k-rozmernom priestore, kde k je väčšie alebo rovné trom. Zlepšenie času v najhoršom prípade oproti doteraz známym algoritmom za predpokladu, že žiadne tri body netvoria rovnostranný trojuholník.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Buchkapitel |
| Sprache: | Englisch |
| Schlagworte: | |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|
Ähnliche Einträge: On constructing the relative neigborhood graphs in euclidean K-dimensional Spaces.
- Abductive reasoning by constructing prohabilistic deduction graphs for solving the diagnosis problem.
- <The> construction of cubature formulae by continuation.
- Numerov-type methods with minimal phase-lag for the numerical integration of the one-dimensional Schrödinger equation.
- <An> evolutionary algorithm for graph augmentation
- On the Degrees of a Strongly Vertex-magic Graph
- Characterizing Edge Betweenness-uniform Graphs