Effective construction of convex hull algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00321155" target="_blank" >RIV/68407700:21240/17:00321155 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/SYNASC.2017.00028" target="_blank" >http://dx.doi.org/10.1109/SYNASC.2017.00028</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/SYNASC.2017.00028" target="_blank" >10.1109/SYNASC.2017.00028</a>
Alternative languages
Result language
angličtina
Original language name
Effective construction of convex hull algorithms
Original language description
Finding the convex hull of a set of points in a plane is one of the most common problems in computational geometry. We survey known algorithms for solving this problem and look into methods of their effective and parallel implementation. A simple generator of random input datasets is created, with an option to control the number of points on resulting hull. We implement all surveyed algorithms along with their optimizations and compare them using our generator. Our measurements show, that Quickhull algorithm using optimizations proposed by Hoang and Linh [1] performs best among the implemented methods and is faster than the current state of the art libraries.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
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
Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017
ISBN
978-1-5386-2626-9
ISSN
2470-8801
e-ISSN
—
Number of pages
8
Pages from-to
105-112
Publisher name
Conference publishing Services
Place of publication
Los Alamitos
Event location
Timisoara
Event date
Sep 21, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000517584500020