Related papers: Qualitative shape representation based on the qual…
The ability to persist in the spacial environment is, not only in the robotic context, an essential feature. Positional knowledge is one of the most important aspects of space and a number of methods to represent these information have been…
We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…
Contours may be viewed as the 2D outline of the image of an object. This type of data arises in medical imaging as well as in computer vision and can be modeled as data on a manifold and can be studied using statistical shape analysis.…
This paper presents a novel method for qualitative mapping of large scale spaces. The proposed framework makes use of a graphical representation of the world in order to build a map consisting of qualitative constraints on the geometric…
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
Simplified representations of macromolecules help in rationalising and understanding the outcome of atomistic simulations, and serve to the construction of effective, coarse-grained models. The number and distribution of coarse-grained…
Past approaches for statistical shape analysis of objects have focused mainly on objects within the same topological classes, e.g., scalar functions, Euclidean curves, or surfaces, etc. For objects that differ in more complex ways, the…
We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…
We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…
In this paper we study an abstract framework for computing shape derivatives of functionals subject to PDE constraints. We revisit the Lagrangian approach using the implicit function theorem in an abstract setting tailored for applications…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higher-dimensional polyhedron has recently received increasing attention. In this paper (written for the…
We provide an elementary derivation of an orthogonal coordinate system for boundary layers around evolving smooth surfaces and curves based on the signed-distance function. We go beyond previous works on the signed-distance function and…
We investigate the problem of estimating the 3D shape of an object defined by a set of 3D landmarks, given their 2D correspondences in a single image. A successful approach to alleviating the reconstruction ambiguity is the 3D deformable…
This article provides a geometric representation for the well-known isomorphism between the special orthogonal group of an isotropic quadratic space of dimension 3 and the group of projective transformations of a projective line. This…
Representing complex shapes with simple primitives in high accuracy is important for a variety of applications in computer graphics and geometry processing. Existing solutions may produce suboptimal samples or are complex to implement. We…
Based on the characterization of the polyconvex envelope of isotropic functions by their signed singular value representations, we propose a simple algorithm for the numerical approximation of the polyconvex envelope. Instead of operating…
We present a novel and effective binary representation for convex shapes. We show the equivalence between the shape convexity and some properties of the associated indicator function. The proposed method has two advantages. Firstly, the…
Contour polygonal approximation is a simplified representation of a contour by line segments, so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal…
Many coupled problems in engineering and science can be described by elliptic partial differential equations on adjacent domains, where the coupling can be considered either as a thin equidimensional overlap between the model domains, or as…