相关论文: Smoothing a Rock by Chipping

We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every…

We construct a method by which we can calculate the precision with which an algorithm identifies the shape of a cluster. We present our results for several well known clustering algorithms and suggest ways to improve performance for newer…

Spectral clustering is one of the most prominent clustering approaches. The distance-based similarity is the most widely used method for spectral clustering. However, people have already noticed that this is not suitable for multi-scale…

In many applications of tomography, the acquired projections are either limited in number or contain a significant amount of noise. In these cases, standard reconstruction methods tend to produce artifacts that can make further analysis…

Spherical particles confined to a sphere surface cannot pack densely into a hexagonal lattice without defects. In this study, we use hard particle Monte Carlo simulations to determine the effects of continuously deformable shape anisotropy…

Automatic estimation of skinning transformations is a popular way to deform a single reference shape into a new pose by providing a small number of control parameters. We generalize this approach by efficiently enabling the use of multiple…

We present a novel approach to background subtraction that is based on the local shape of small image regions. In our approach, an image region centered on a pixel is mod-eled using the local self-similarity descriptor. We aim at obtaining…

Contacts between particles in dense, sheared suspensions are believed to underpin much of their rheology. Roughness and adhesion are known to constrain the relative motion of particles, and thus globally affect the shear response, but an…

This paper reviews the current state-of-the-art in the simulation of the mechanical behavior of polycrystalline materials by means of computational homogenization. The key ingredients of this modelling strategy are presented in detail…

Colloidal and other granular media experience a transition to rigidity known as jamming if the fill fraction is increased beyond a critical value. The resulting jammed structures are locally disordered, bear applied loads inhomogenously,…

The shapelets method for image analysis is based upon the decomposition of localised objects into a series of orthogonal components with convenient mathematical properties. We extend the "Cartesian shapelet" formalism from earlier work, and…

A tiling is a decomposition of a polygon into finitely many non-overlapping triangles. We prove that if a regular n-gon, $n \geq 5$, $n \neq 28$, can be tiled with similar right triangles, then one of the angles of these triangles is in…

A method is given for evaluating electromagnetic scattering by an irregular surface with spatially-varying impedance. This uses an operator expansion with respect to impedance variation and allows examination of its effects and the…

We are interested in geometric approximation by parameterization of two-dimensional multiple-component shapes, in particular when the number of components is a priori unknown. Starting a standard method based on successive shape…

Harmonic decomposition of surfaces, such as spherical and spheroidal harmonics, is used to analyze morphology, reconstruct, and generate surface inclusions of particulate microstructures. However, obtaining high-quality meshes of…

The shape of semiflexible polymer rings is studied over their whole range of flexibility. Investigating the joint distribution of asphericity and nature of asphericity as well as their respective averages we find two distinct shape regimes…

Diamond particles have many interesting properties and possible applications. However, producing diamond particles with well-defined shapes at scale is challenging because diamonds are chemically inert and extremely hard. Here, we show air…

Two methods to decompose block matrices analogous to Singular Matrix Decomposition are proposed, one yielding the so called economy decomposition, and other yielding the full decomposition. This method is devised to avoid handling matrices…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

The minimum feature size of a crossing-free straight line drawing is the minimum distance between a vertex and a non-incident edge. This quantity measures the resolution needed to display a figure or the tool size needed to mill the figure.…