Related papers: Adaptive Surface Meshes from Harmonic Maps
We present a simple yet effective method for skeleton-free motion retargeting. Previous methods transfer motion between high-resolution meshes, failing to preserve the inherent local-part motions in the mesh. Addressing this issue, our…
We propose an adaptive smoothing algorithm based on Nesterov's smoothing technique in \cite{Nesterov2005c} for solving "fully" nonsmooth composite convex optimization problems. Our method combines both Nesterov's accelerated proximal…
Designing a freeform surface to reflect or refract light to achieve a target distribution is a challenging inverse problem. In this paper, we propose an end-to-end optimization strategy for an optical surface mesh. Our formulation leverages…
Feature-preserving mesh denoising has received noticeable attention in visual media, with the aim of recovering high-fidelity, clean mesh shapes from the ones that are contaminated by noise. Existing denoising methods often design smaller…
Anisotropic mesh adaptation with Riemannian metrics has proven effective for generating straight-sided meshes with anisotropy induced by the geometry of interest and/or the resolved physics. Within the continuous mesh framework, anisotropic…
We extend thresholding methods for numerical realization of mean curvature flow on obstacles to the anisotropic setting where interfacial energy depends on the orientation of the interface. This type of schemes treats the interface…
The development of active metasurface systems, such as lasing metasurfaces, requires the optimization of multiple modes at the absorption and lasing wavelength bands, including their quality factor, mode profile and angular dispersion.…
Mesh processing pipelines are mature, but adapting them to newer non-mesh surface representations -- which enable fast rendering with compact file size -- requires costly meshing or transmitting bulky meshes, negating their core benefits…
This paper describes a node relocation algorithm based on nonlinear optimization which delivers excellent results for both unstructured and structured plane triangle meshes over convex as well as non-convex domains with high curvature. The…
We present a new approach to discretizing shape optimization problems that generalizes standard moving mesh methods to higher-order mesh deformations and that is naturally compatible with higher-order finite element discretizations of…
The article presents a new method of linear programming, called the surface movement method. This method constructs an optimal objective path on the surface of the feasible polytope from the initial boundary point to the point at which the…
An important step in shape optimization with partial differential equation constraints is to adapt the geometry during each optimization iteration. Common strategies are to employ mesh-deformation or re-meshing, where one or the other…
We develop a new optimisation technique that combines multiresolution subdivision surfaces for boundary description with immersed finite elements for the discretisation of the primal and adjoint problems of optimisation. Similar to wavelets…
This paper proposes a level set-based method for optimizing shell structures with large design changes in shape and topology. Conventional shell optimization methods, whether parametric or nonparametric, often only allow limited design…
Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…
In this paper, we present a feature-aware SPH method for the concurrent and automated isotropic unstructured mesh generation. Two additional objectives are achieved with the proposed method compared to the original SPH-based mesh generator…
We propose a novel 3D shape correspondence method based on the iterative alignment of so-called smooth shells. Smooth shells define a series of coarse-to-fine shape approximations designed to work well with multiscale algorithms. The main…
The p-norm often used in stress constrained topology optimisation supposedly mimics a delta function and it is thus characterised by a small length scale and ideally one would also prefer to have the solid-void transition occur over a small…
We propose a novel meshless method to compute harmonic maps and conformal maps for surfaces embedded in the Euclidean 3-space, using point cloud data only. Given a surface, or a point cloud approximation, we simply use the standard cubic…
The application of transformation optics to the development of intriguing electromagnetic devices can produce weakly anisotropic or isotropic media with the assistance of quasi-conformal and/or conformal mapping, as opposed to the strongly…