Filling holes under non-linear constraints

In this paper we handle the problem of filling the hole in the graphic of a surface by means of a patch that joins the original surface with C1-smoothness and fulfills an additional non-linear geometrical constraint regarding its area or its mean curvature at some points. Furthermore, we develop a technique to estimate the optimum area that the filling patch is expected to have that will allow us to determine optimum filling patches by means of a system of linear and quadratic equations. We present several numerical and graphical examples showing the effectiveness of the proposed method.Funding for open access publishing: Universidad de Granada/CBUANational funds through the FCT - Fundação para a Ciência e a TecnologiaProjects UIDB/00297/2020 and UIDP/00297/2020 (Center for Mathematics and Applications

Filling holes under non-linear constraints

Publisher Copyright: © 2023, The Author(s).In this paper we handle the problem of filling the hole in the graphic of a surface by means of a patch that joins the original surface with C1-smoothness and fulfills an additional non-linear geometrical constraint regarding its area or its mean curvature at some points. Furthermore, we develop a technique to estimate the optimum area that the filling patch is expected to have that will allow us to determine optimum filling patches by means of a system of linear and quadratic equations. We present several numerical and graphical examples showing the effectiveness of the proposed method.publishersversionpublishe

Fitting and filling of 3D datasets with volume constraints using radial basis functions under tension

Acknowledgments This work was supported by FEDER/Junta de Andalucía-Consejería de Transformación Económica, Industria, Conocimiento y Universidades (Research Project A-FQM-76-UGR20, University of Granada) and by the Junta de Andalucía (Research Groups FQM-191 and TEP-190). Funding for open access charge: Universidad de Granada / CBUA.Given a dataset of 3D points in which there is a hole, i.e., a region with a lack of information, we develop a method providing a surface that fits the dataset and fills the hole. The filling patch is required to fulfill a prescribed volume condition. The fitting–filling function consists of a radial basis functions that minimizes an energy functional involving both, the fitting of the dataset and the volume constraint of the filling patch, as well as the fairness of the function. We give a convergence result and we present some graphical and numerical examples.FEDER/Junta de Andalucía-Consejería de Transformación Económica, Industria, Conocimiento y Universidades (Research Project A-FQM-76-UGR20, University of Granada)Junta de Andalucía (Research Groups FQM-191 and TEP-190)Funding for open access charge: Universidad de Granada / CBU

Mini-Workshop: Analytical and Numerical Methods in Image and Surface Processing

The workshop successfully brought together researchers from mathematical analysis, numerical mathematics, computer graphics and image processing. The focus was on variational methods in image and surface processing such as active contour models, Mumford-Shah type functionals, image and surface denoising based on geometric evolution problems in image and surface fairing, physical modeling of surfaces, the restoration of images and surfaces using higher order variational formulations

Designing aesthetically pleasing freeform surfaces in a computer environment

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Architecture, February 2001.Includes bibliographical references (p. 151-160).Statement: If computational tools are to be employed in the aesthetic design of freeform surfaces, these tools must better reflect the ways in which creative designers conceive of and develop such shapes. In this thesis, I studied the design of aesthetically constrained freeform surfaces in architecture and industrial design, formulated a requirements list for a computational system that would aid in the creative design of such surfaces, and implemented a subset of the tools that would comprise such a system. This work documents the clay modeling process at BMW AG., Munich. The study of that process has led to a list of tools that would make freeform surface modeling possible in a computer environment. And finally, three tools from this system specification have been developed into a proof-of-concept system. Two of these tools are sweep modification tools and the third allows a user to modify a surface by sketching a shading pattern desired for the surface. The proof-of-concept tools were necessary in order to test the validity of the tools being presented and they have been used to create a number of example objects. The underlying surface representation is a variational expression which is minimized using the finite element method over an irregular triangulated mesh.by Evan P. Smyth.Ph.D

ShapeWright--finite element based free-form shape design

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1990.Includes bibliographical references (p. 179-192).by George Celniker.Ph.D

3D modelling using partial differential equations (PDEs).

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