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 symbolic-numerical approach to approximate parameterizations of space curves using graphs of critical points

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43916221" target="_blank" >RIV/49777513:23520/13:43916221 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    A symbolic-numerical approach to approximate parameterizations of space curves using graphs of critical points

  • Original language description

    A simple algorithm for computing an approximate parameterization of real space algebraic curves using their graphs of critical points is designed and studied in this paper. The first step is determining a suitable space graph which contains all criticalpoints of a real algebraic space curve C implicitly defined as the complete intersection of two surfaces. The construction of this graph is based on one projection of C in a general position onto an xy-plane and on an intentional choice of vertices. Thesecond part of the designed method is a computation of a spline curve which replaces the edges of the constructed graph by segments of a chosen free-form curve. This step is formulated as an optimization problem when the objective function approximates the integral of the squared Euclidean distance of the constructed approximate curve to the intersection curve. The presented method, based on combining symbolic and numerical steps to the approximation problem, provides approximate paramet

  • 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

    <a href="/en/project/ED1.1.00%2F02.0090" target="_blank" >ED1.1.00/02.0090: NTIS - New Technologies for Information Society</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

    2013

  • 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

    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

  • ISSN

    0377-0427

  • e-ISSN

  • Volume of the periodical

    242

  • Issue of the periodical within the volume

    April

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    107-124

  • UT code for WoS article

  • EID of the result in the Scopus database