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”

A New Projective Point in Convex Polygon Test with O(log N) Complexity

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F24%3A43976661" target="_blank" >RIV/49777513:23520/24:43976661 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/10900927" target="_blank" >https://ieeexplore.ieee.org/document/10900927</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    A New Projective Point in Convex Polygon Test with O(log N) Complexity

  • Original language description

    This contribution describes a novel and fully projective algorithm for a point-in-convex polygon test with computational complexity of O(log N) in E2 . The polygon vertices and tested points can be given in projective space, i.e., with the homogeneous coordinate w ̸= 0, without conversion to Euclidean space. It is independent of the polygon orientation. It uses vectorvector operations and is therefore aimed for implementation using SSE or AVX instructions. The algorithm is simple and robust, easy to implement

  • 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

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2024

  • 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

    2024 IEEE 17th International Scientific Conference on Informatics (Informatics)

  • ISBN

    979-8-3503-8768-1

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    349-354

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Poprad

  • Event date

    Nov 13, 2024

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    001483035700059