All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Reducing the number of points on the convex hull calculation using the polar 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%2F16%3A43929445" target="_blank" >RIV/49777513:23520/16:43929445 - isvavai.cz</a>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • 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

    2016

  • 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

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

  • ISBN

    978-1-5090-3568-7

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    40-47

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    SaoJosé dos Campos, SP, Brazil

  • Event date

    Oct 4, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article