Related papers: Set-oriented numerical computation of rotation set…
The paper deals with the numerical approximation of the Hilbert transform on the unit circle using Szeg\"o and anti-Szeg\"o quadrature formulas. These schemes exhibit maximum precision with oppositely signed errors and allow for improved…
We present a real-time-capable set-based framework for closed-loop predictive control of autonomous systems using tools from computational geometry, dynamic programming, and convex optimization. The control architecture relies on the…
We present an algorithm for creating contiguous cartograms using meshes. We use numerical optimization to minimize cartographic error and distortion by transforming the mesh vertices. The vertices can either be optimized in the plane or…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
This article deals with directional rotational deviations for non-wandering periodic point free homeomorphisms of the 2-torus which are homotopic to the identity. We prove that under mild assumptions, such a homeomorphism exhibits uniformly…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
We study bounded remainder sets with respect to an irrational rotation of the $d$-dimensional torus. The subject goes back to Hecke, Ostrowski and Kesten who characterized the intervals with bounded remainder in dimension one. First we…
We prove the existence of an open and dense set D\subset? Homeo0(T2) (set of toral homeomorphisms homotopic to the identity) such that the rotation set of any element in D is a rational polygon. We also extend this result to the set of…
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is…
Robotic assembly tasks require object-pose estimation, particularly for tasks that avoid costly mechanical constraints. Object symmetry complicates the direct mapping of sensory input to object rotation, as the rotation becomes ambiguous…
We propose to compute approximations to general invariant sets in dynamical systems by minimizing the distance between an appropriately selected finite set of points and its image under the dynamics. We demonstrate, through computational…
This work introduces the nested-set Hessian approximation, a second-order approximation method that can be used in any derivative-free optimization routine that requires such information. It is built on the foundation of the generalized…
Orientation estimation is a fundamental task in 3D shape analysis which consists of estimating a shape's orientation axes: its side-, up-, and front-axes. Using this data, one can rotate a shape into canonical orientation, where its…
We provide a classification of minimal sets of homeomorphisms of the two-torus, in terms of the structure of their complement. We show that this structure is exactly one of the following types: (1) a disjoint union of topological disks, or…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
We provide an algorithm for computing the centered Hausdorff measure of self-similar sets satisfying the strong separation condition. We prove the convergence of the algorithm and test its utility on some examples.
Finite time coherent sets [8] have recently been defined by a measure based objective function describing the degree that sets hold together, along with a Frobenius-Perron transfer operator method to produce optimally coherent sets. Here we…
We present the results of a novel type of numerical simulation that realizes a rotating Universe with a shear-free, rigid body rotation inspired by a G\"{o}del-like metric. We run cosmological simulations of unperturbed glasses with various…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…
We prove an abstract result establishing that one can obtain the convergence of Rare Events Point Processes counting the number of orbital visits to a sequence of shrinking target sets from the convergence of corresponding point processes…