Related papers: Numerically robust computation of circular visibil…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
Road boundaries, or curbs, provide autonomous vehicles with essential information when interpreting road scenes and generating behaviour plans. Although curbs convey important information, they are difficult to detect in complex urban…
This paper focuses on computing the directional extremal boundary of a union of equal-radius circles. We introduce an efficient algorithm that accurately determines this boundary by analyzing the intersections and dominant relationships…
Motivated by the controllability/reachability problems for switched linear control systems and some classes of nonlinear (mechanical) control systems we address a related problem of existence of a cyclic vector for an associative (matrix)…
This paper presents a state-of-the-art approach in object detection for being applied in future SLAM problems. Although, many SLAM methods are proposed to create suitable autonomy for mobile robots namely ground vehicles, they still face…
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph $G$ has a unique Eulerian circuit can be done in polynomial time via the BEST theorem by de Bruijn, van Aardenne-Ehrenfest,…
A weak form of the Circle Criterion for Lur'e systems is stated. The result allows prove global boundedness of all system solutions. Moreover such a result can be employed to enlarge the set of nonlinearities for which the standard Circle…
Domain discretization is an essential part of the solution procedure in numerical simulations. Meshless methods simplify the domain discretization to positioning of nodes in the interior and on the boundary of the domain. However, generally…
In the present work, a simple algorithm for stabilizing an unknown linear time-invariant system is proposed, assuming only that this system is stabilizable. The suggested algorithm is based on first performing a partial identification of…
Apparent horizons are structures of spacelike hypersurfaces that can be determined locally in time. Closed surfaces of constant expansion (CE surfaces) are a generalisation of apparent horizons. I present an efficient method for locating CE…
The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
With the present and soon-to-be breakthrough of optical interferometry, countless objects shall be within reach of interferometers; yet, most of them are expected to remain only marginally resolved with hectometric baselines. In this paper,…
This paper concerns the number of lattice points in the plane which are visible along certain curves to all elements in some set S of lattice points simultaneously. By proposing the concept of level of visibility, we are able to analyze…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the…
We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider a triangulated terrain with $m>1$ viewpoints (or guards) located on the terrain surface. A point on the terrain is considered…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…