Related papers: Selecting the Best Quadrilateral Mesh for Given Pl…
Stiffener layout optimization of complex surfaces is fulfilled within the framework of topology optimization. A combined parameterization method is developed in two aspects. One is to parameterize the material distribution of the stiffener…
We study the problem of optimal subset selection from a set of correlated random variables. In particular, we consider the associated combinatorial optimization problem of maximizing the determinant of a symmetric positive definite matrix…
In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel…
In the context of isogeometric analysis, globally $C^1$ isogeometric spaces over unstructured quadrilateral meshes allow the direct solution of fourth order partial differential equations on complex geometries via their Galerkin…
This paper tackles the challenging problem of constrained hexahedral meshing. An algorithm is introduced to build combinatorial hexahedral meshes whose boundary facets exactly match a given quadrangulation of the topological sphere. This…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
Shape matching has been a long-studied problem for the computer graphics and vision community. The objective is to predict a dense correspondence between meshes that have a certain degree of deformation. Existing methods either consider the…
In CAGD the design of a surface that interpolates an arbitrary quadrilateral mesh is definitely a challenging task. The basic requirement is to satisfy both criteria concerning the regularity of the surface and aesthetic concepts. With…
We study the relationship between the areas of the consecutive quadrilaterals cut from a convex quadrilateral in the plane by means of a finite or infinite number of straight lines intersecting two of its opposite sides. Moreover, we obtain…
Image stitching for two images without a global transformation between them is notoriously difficult. In this paper, noticing the importance of planar structure under perspective geometry, we propose a new image stitching method which…
Polyhedral meshes (PM) - meshes having planar faces - have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate.…
Matching datasets of multiple modalities has become an important task in data analysis. Existing methods often rely on the embedding and transformation of each single modality without utilizing any correspondence information, which often…
We propose MeshOn, a method that finds physically and semantically realistic compositions of two input meshes. Given an accessory, a base mesh with a user-defined target region, and optional text strings for both meshes, MeshOn uses a…
Fractional polynomial models are potentially useful for response surfaces investigations. With the availability of routines for fitting nonlinear models in statistical packages they are increasingly being used. However, as in all…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
We study analogs of planar-quadrilateral meshes in Laguerre sphere geometry and the approximation of smooth surfaces by them. These new Laguerre meshes can be viewed as watertight surfaces formed by planar quadrilaterals (corresponding to…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…
We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For…
This paper presents a new method to generate tool paths for machining freeform surfaces represented either as parametric surfaces or as triangular meshes. This method allows for the optimal tradeoff between the preferred feed direction…