The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] parametric representation(2hit)

1-2hit
  • Boundary Based Parametric Polygon Morphing

    Ding-Horng CHEN  Yung-Nien SUN  

     
    PAPER-Computer Graphics

      Vol:
    E84-D No:4
      Page(s):
    511-520

    A simple and an efficient algorithm for polygon morphing is proposed in this paper. We adopt the parametric curve representation based on Fourier parameter estimation to transfer the traditional morphing process in spatial domain to a process in the parametric space instead. The principles are to express the polygon as the union of matching segments that are described by the estimated Fourier parameters. We have also designed a data resampling method that effectively controls the shape morphing according to the corresponding curvature values. Intermediate objects in-between the source and target polygons are then constructed based on the interpolation of Fourier parameters of the two polygons. Fourier parameters of the resampled polygons can be obtained efficiently by using the fast Fourier transform (FFT) algorithm. The experimental results show that the appearances of the morphed objects are superior to the ones obtained by the methods available.

  • Finding All Solutions of Piecewise-Linear Resistive Circuits Containing Neither Voltage nor Current Controlled Resistors

    Kiyotaka YAMAMURA  

     
    LETTER-Nonlinear Circuits and Systems

      Vol:
    E77-A No:3
      Page(s):
    573-576

    Recently, efficient algorithms that exploit the separability of nonlinear mappings have been proposed for finding all solutions of piecewise-linear resistive circuits. In this letter, it is shown that these algorithms can be extended to circuits containing piecewise-linear resistors that are neither voltage nor current controlled. Using the parametric representation for these resistors, the circuits can be described by systems of nonlinear equations with separable mappings. This separability is effectively exploited in finding all solutions. A numerical example is given, and it is demonstrated that all solutions are computed very rapidly by the new algorithm.