Title: | Fast Oexpected(N) Algorithm for Finding Exact Maximum Distance in E2 Instead of O(N2) or O(N lgN) |
Authors: | Skala, Václav |
Citation: | AIP Conference Proceedings, p. 2496-2499. |
Issue Date: | 2013 |
Publisher: | AIP Publishing |
Document type: | preprint preprint |
URI: | http://dx.doi.org/10.1063/1.4826047 http://hdl.handle.net/11025/11737 |
ISBN: | 978-0-7354-1184-5 |
ISSN: | 0094-243X |
Keywords: | aplikovaná matematika;numerická analýza;maximální vzdálenost;výpočetní systémy |
Keywords in different language: | applied mathematics;numerical analysis;maximum distance;computing systems |
Abstract: | This paper describes novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run-time needed to find an exact maximum distance of two points in E2. The proposed algorithm has been evaluated experimentally on larger different datasets. The proposed algorithm gives a significant speed-up to applications, when medium and large data sets are processed. It is over 10 000 times faster than the standard algorithm for 106 points randomly distributed points in E2. Experiments proved the advantages of the proposed algorithm over the standard algorithm and convex hull diameters approaches. |
Rights: | Original article was published under © 2013 AIP Publishing LLC |
Appears in Collections: | Preprinty / Preprints (KIV) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2013_ICNAAM-FastOexpected-Max-Distance.pdf | Plný text | 678,39 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11737
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.