Cargando…
A simple approximation algorithm for the diameter of a set of points in an Euclidean plane
Approximation algorithms with linear complexities are required in the treatments of big data, however, present algorithms cannot output the diameter of a set of points with arbitrary accuracy and near-linear complexity. By introducing the partition technique, we introduce a very simple approximation...
Autores principales: | Hong, Jieying, Wang, Zhipeng, Niu, Wei |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6368283/ https://www.ncbi.nlm.nih.gov/pubmed/30735522 http://dx.doi.org/10.1371/journal.pone.0211201 |
Ejemplares similares
-
Euclidean shortest paths: exact or approximate algorithms
por: Li, Fajie, et al.
Publicado: (2014) -
The foundations of geometry and the non-Euclidean plane
por: Martin, George E
Publicado: (1982) -
The non-euclidean, hyperbolic plane: its structure and consistency
por: Kelly, Paul, et al.
Publicado: (1981) -
Euclidean and non-euclidean geometries : development and history
por: Greenberg, Marvin Jay
Publicado: (1994) -
$O(N)$ model in Euclidean de Sitter space: beyond the leading infrared approximation
por: López Nacir, Diana, et al.
Publicado: (2016)