3 research outputs found

    Partial differential equations for function based geometry modelling within visual cyberworlds

    Get PDF
    We propose the use of Partial Differential Equations (PDEs) for shape modelling within visual cyberworlds. PDEs, especially those that are elliptic in nature, enable surface modelling to be defined as boundary-value problems. Here we show how the PDE based on the Biharmonic equation subject to suitable boundary conditions can be used for shape modelling within visual cyberworlds. We discuss an analytic solution formulation for the Biharmonic equation which allows us to define a function based geometry whereby the resulting geometry can be visualised efficiently at arbitrary levels of shape resolutions. In particular, we discuss how function based PDE surfaces can be readily integrated within VRML and X3D environment

    3D modelling using partial differential equations (PDEs).

    Get PDF
    Partial differential equations (PDEs) are used in a wide variety of contexts in computer science ranging from object geometric modelling to simulation of natural phenomena such as solar flares, and generation of realistic dynamic behaviour in virtual environments including variables such as motion, velocity and acceleration. A major challenge that has occupied many players in geometric modelling and computer graphics is the accurate representation of human facial geometry in 3D. The acquisition, representation and reconstruction of such geometries are crucial for an extensive range of uses, such as in 3D face recognition, virtual realism presentations, facial appearance simulations and computer-based plastic surgery applications among others. The principle aim of this thesis should be to tackle methods for the representation and reconstruction of 3D geometry of human faces depending on the use of partial differential equations and to enable the compression of such 3D data for faster transmission over the Internet. The actual suggested techniques are based on sampling surface points at the intersection of horizontal and vertical mesh cutting planes. The set of sampled points contains the explicit structure of the cutting planes with three important consequences: 1) points in the plane can be defined as a one dimensional signal and are thus, subject to a number of compression techniques; 2) any two mesh cutting planes can be used as PDE boundary conditions in a rectangular domain; and 3) no connectivity information needs to be coded as the explicit structure of the vertices in 3D renders surface triangulation a straightforward task. This dissertation proposes and demonstrates novel algorithms for compression and uncompression of 3D meshes using a variety of techniques namely polynomial interpolation, Discrete Cosine Transform, Discrete Fourier Transform, and Discrete Wavelet Transform in connection with partial differential equations. In particular, the effectiveness of the partial differential equations based method for 3D surface reconstruction is shown to reduce the mesh over 98.2% making it an appropriate technique to represent complex geometries for transmission over the network
    corecore