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”

Identifying and approximating monotonous segments of algebraic curves using support function representation

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10285488" target="_blank" >RIV/00216208:11320/14:10285488 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.cagd.2014.05.006" target="_blank" >http://dx.doi.org/10.1016/j.cagd.2014.05.006</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cagd.2014.05.006" target="_blank" >10.1016/j.cagd.2014.05.006</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Identifying and approximating monotonous segments of algebraic curves using support function representation

  • Original language description

    Algorithms describing the topology of real algebraic curves search primarily the singular points and they are usually based on algebraic techniques applied directly to the curve equation. We adopt a different approach, which is primarily based on the identification and approximation of smooth monotonous curve segments, which can in certain cases cross the singularities of the curve. We use not only the primary algebraic equation of the planar curve but also (and more importantly) its implicit support function representation. This representation is also used for an approximation of the segments. This way we obtain an approximate graph of the entire curve which has several nice properties. It approximates the curve within a given Hausdorff distance. Theactual error can be measured efficiently and behaves as O(N-3) where N is the number of segments. The approximate graph is rational and has rational offsets. In the simplest case it consists of arc segments which are efficiently represent

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2014

  • 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

  • Name of the periodical

    Computer Aided Geometric Design

  • ISSN

    0167-8396

  • e-ISSN

  • Volume of the periodical

    31

  • Issue of the periodical within the volume

    7-8

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    15

  • Pages from-to

    358-372

  • UT code for WoS article

    000345056400004

  • EID of the result in the Scopus database