Related papers: Flip procedure in geometric approximation of multi…
In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…
Sweeping is a powerful and versatile method of designing objects. Boundary of volumes (henceforth envelope) obtained by sweeping solids have been extensively investigated in the past, though, obtaining an accurate parametrization of the…
Herein, we study an inverse problem for detecting unknown obstacles by the enclosure method using the Dirichlet--to--Neumann map for measurements. We justify the method for an penetrable obstacle case involving a biharmonic equation. We use…
Simulations of many rigid bodies colliding with each other sometimes yield particularly interesting results if the colliding objects differ significantly in size and are non-spherical. The most expensive part within such a simulation code…
In this work, we develop a framework for shape analysis using inconsistent surface mapping. Traditional landmark-based geometric morphometrics methods suffer from the limited degrees of freedom, while most of the more advanced non-rigid…
Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when…
A topology optimization approach for designing large deformation contact-aided shape morphing compliant mechanisms is presented. Such mechanisms can be used in varying operating conditions. Design domains are described by regular hexagonal…
Design patterns being applied more and more to solve the software engineering difficulties in the object oriented software design procedures. So, the design pattern detection is widely used by software industries. Currently, many solutions…
Lane detection is typically tackled with a two-step pipeline in which a segmentation mask of the lane markings is predicted first, and a lane line model (like a parabola or spline) is fitted to the post-processed mask next. The problem with…
We introduce an image based algorithmic tool for analyzing multi-component shapes here. Due to the generic concept of multi-component shapes, our method can be applied to the analysis of a wide spectrum of applications where real objects…
A comprehensive framework for detection and characterization of overlapping intrinsic symmetry over 3D shapes is proposed. To identify prominent symmetric regions which overlap in space and vary in form, the proposed framework is decoupled…
We present first a brief review of the existing literature on shape optimization, stressing the recent use of Hamiltonian systems in topology optimization. In the second section, we collect some preliminaries on the implicit parametrization…
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…
A fundamental problem in computer vision is boundary estimation, where the goal is to delineate the boundary of objects in an image. In this paper, we propose a method which jointly incorporates geometric and topological information within…
This work investigates an elliptic optimal control problem defined on uncertain domains and discretized by a fictitious domain finite element method and cut elements. Key ingredients of the study are to manage cases considering the usually…
A wide variety of real random composites can be studied by means of prototypes of multiphase microstructures with a controllable spatial inhomogeneity. To create them, we propose a versatile model of randomly overlapping super-spheres of a…
Probabilistic collision detection (PCD) is essential in motion planning for robots operating in unstructured environments, where considering sensing uncertainty helps prevent damage. Existing PCD methods mainly used simplified geometric…
We present a new algorithm for multi-region segmentation of 2D images with objects that may partially occlude each other. Our algorithm is based on the observation hat human performance on this task is based both on prior knowledge about…
Approximate convex decomposition aims to decompose a 3D shape into a set of almost convex components, whose convex hulls can then be used to represent the input shape. It thus enables efficient geometry processing algorithms specifically…
Traditional shape descriptors have been gradually replaced by convolutional neural networks due to their superior performance in feature extraction and classification. The state-of-the-art methods recognize object shapes via image…