Space subdivision to speed-up convex hull construction in E3

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43926857" target="_blank" >RIV/49777513:23520/16:43926857 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.advengsoft.2015.09.002" target="_blank" >http://dx.doi.org/10.1016/j.advengsoft.2015.09.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.advengsoft.2015.09.002" target="_blank" >10.1016/j.advengsoft.2015.09.002</a>

Result language
angličtina
Original language name
Space subdivision to speed-up convex hull construction in E3
Original language description
Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for computing the convex hull of a set of points in E3. This algorithm is based on "spherical" space subdivision. The main idea of the S-CH algorithm is to eliminate as many input points as possible before the convex hull construction. The experimental results show that only a very small number of points are used for the final convex hull calculation. Experiments made also proved that the proposed S-CH algorithm achieves a better time complexity in comparison with other algorithms in E3.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

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

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)