Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43925824" target="_blank" >RIV/49777513:23520/15:43925824 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-21963-9_24" target="_blank" >http://dx.doi.org/10.1007/978-3-319-21963-9_24</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-21963-9_24" target="_blank" >10.1007/978-3-319-21963-9_24</a>
Alternative languages
Result language
angličtina
Original language name
Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
Original language description
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum distance of two points in E2. This algorithm is based on a polar subdivision followed by division of remaining points into uniform grid. The main idea of the algorithm is to eliminate as many input points as possible before finding the maximum distance. The proposed algorithm gives the significant speed up compared to the standard algorithm.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LH12181" target="_blank" >LH12181: Development of Algorithms for Computer Graphics and CAD/CAM systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
8th International Conference, ICIG 2015, Tianjin, China, August 13-16, 2015, Proceedings, Part II
ISBN
978-3-319-21962-2
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
261-274
Publisher name
Springer
Place of publication
Cham
Event location
Tianjin
Event date
Aug 13, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—