Related papers: Optimal separator for an ellipse; Application to l…

This paper develops a planner to find an optimal assembly sequence to assemble several objects. The input to the planner is the mesh models of the objects, the relative poses between the objects in the assembly, and the final pose of the…

We address the problem of motion planning for a robotic manipulator with the task to place a grasped object in a cluttered environment. In this task, we need to locate a collision-free pose for the object that a) facilitates the stable…

This paper proposes a hierarchical clustering approach for the segmentation of mobile LiDAR point clouds. We perform the hierarchical clustering on unorganized point clouds based on a proximity matrix. The dissimilarity measure in the…

Colander are location aware entities that collaborate to determine approximate location of mobile or static objects when beacons from an object are received by all colanders that are within its distance $R$. This model, referred to as…

In this paper a local Fourier analysis for multigrid methods on tetrahedral grids is presented. Different smoothers for the discretization of the Laplace operator by linear finite elements on such grids are analyzed. A four-color smoother…

We propose an operator preconditioner for general elliptic pseudodifferential equations in a domain $\Omega$, where $\Omega$ is either in $\mathbb{R}^n$ or in a Riemannian manifold. For linear systems of equations arising from low-order…

We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…

Functional bases, synonymous with separating sets, are usually formulated for an entire vector space, such as the space Ela of elasticity tensors. We propose here to define functional bases limited to symmetry strata, i.e. sets of tensors…

We provide new general methods in the calculus of variations for the anisotropic Plateau problem in arbitrary dimension and codimension. A new direct proof of Almgren's 1968 existence result is presented; namely, we produce from a class of…

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.

We survey the classification of the Riemannian metrics on spheres with respect to which all equators are minimal hypersurfaces, and discuss problems related to these geometries.

We give sufficient conditions for some underdetermined elliptic PDE of any order to construct smooth compactly supported solutions. In particular we show that two smooth elements in the kernel of certain underdetermined linear elliptic…

In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or…

We present new methods for uniformly sampling the solid angle subtended by a disk. To achieve this, we devise two novel area-preserving mappings from the unit square $[0,1]^2$ to a spherical ellipse (i.e. the projection of the disk onto the…

This paper deals with nonsmooth convex optimization problems in Euclidean spaces. We identify special elements of the subdifferential of a convex function, called specular gradients. Based on this observation, we propose three numerical…

The goal of this paper is to find a low-rank approximation for a given tensor. Specifically, we give a computable strategy on calculating the rank of a given tensor, based on approximating the solution to an NP-hard problem. In this paper,…

We developed a specific numerical fitting procedure, based on the least squares method, to calculate the parameters of the polarization ellipse by only using a single polarizer and a detection device for measuring the outgoing intensities.

We discuss applications of minimal surfaces to comparison geometry.

In this paper, we give a new type of a posteriori error estimators suitable for moving finite element methods under anisotropic meshes for general second-order elliptic problems. The computation of estimators is simple once corresponding…

Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…