Reducing the number of points on the convex hull calculation using the polar space subdivision in E2

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43929445" target="_blank" >RIV/49777513:23520/16:43929445 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/SIBGRAPI.2016.14" target="_blank" >http://dx.doi.org/10.1109/SIBGRAPI.2016.14</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/SIBGRAPI.2016.14" target="_blank" >10.1109/SIBGRAPI.2016.14</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Reducing the number of points on the convex hull calculation using the polar space subdivision in E2

Popis výsledku v původním jazyce

A convex hull of points in E2 is used in many applications. In spite of low computational complexity O(hlogN) it takes considerable time if large data processing is needed. We present a new algorithm to speed up any planar convex hull calculation. It is based on a polar space subdivision and speed up known convex hull algorithms of 3,7 times and more. The algorithm estimates the central point using 10% of the data; this point is taken as the origin for the polar subdivision. The space subdivision enables a fast and very efficient reduction of the given points, which cannot contribute to the final convex hull. The proposed algorithm iteratively approximates the convex hull, leaving only a small number of points for the final processing, which is performed using a "standard" algorithm. Non-eliminated points are then processed by a selected standard convex hull algorithm. The algorithm is simple and easy to implement. Experiments proved numerical robustness as well.

Název v anglickém jazyce

Reducing the number of points on the convex hull calculation using the polar space subdivision in E2

Popis výsledku anglicky

A convex hull of points in E2 is used in many applications. In spite of low computational complexity O(hlogN) it takes considerable time if large data processing is needed. We present a new algorithm to speed up any planar convex hull calculation. It is based on a polar space subdivision and speed up known convex hull algorithms of 3,7 times and more. The algorithm estimates the central point using 10% of the data; this point is taken as the origin for the polar subdivision. The space subdivision enables a fast and very efficient reduction of the given points, which cannot contribute to the final convex hull. The proposed algorithm iteratively approximates the convex hull, leaving only a small number of points for the final processing, which is performed using a "standard" algorithm. Non-eliminated points are then processed by a selected standard convex hull algorithm. The algorithm is simple and easy to implement. Experiments proved numerical robustness as well.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/LH12181" target="_blank" >LH12181: Vývoj algoritmů počítačové grafiky a pro CAD/CAM systémy Development of Algorithms for Computer Graphics and CAD/CAM systems</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2016

Kód důvěrnosti údajů

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

Název statě ve sborníku

Electronic Proceedings of the 29th Conference on Graphics, Patterns and Images (SIBGRAPI'16)

ISBN

978-1-5090-3568-7

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

40-47

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

SaoJosé dos Campos, SP, Brazil

Datum konání akce

4. 10. 2016

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—