We propose a new method for computing the 2-d Minkowski sum of non-convex polygons.
Our method is convolution based. The main idea is to use the reduced convolution and filter …

Challenges of cloth simulation have attracted researchers to improve issues related to
computational cost in resolving collision. Proximity detection is performed by applying collision …

This paper focuses on the N P -hard problem of reducing the complexity of piecewise polyhedral
systems (eg polyhedral piecewise affine (PWA) systems). The results are fourfold. Firstly…

Model transformation is to construct a computable automaton to over-approximate the
original automaton. In this paper, the linear phase-portrait approximation is extended to the …

… From the zonotope construction to the Minkowski addition of convex polytopes. Journal of
Symbolic Computation, 38(4), 1261–1272. Fukuda, K. …

We completely describe a new domain for abstract interpretation of numerical programs.
Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the …

Mating a pair of electric connectors is one of the most important steps in a robotic wiring
harness assembly system, which can be modeled by static piecewise affine (PWA) systems. To …

Les travaux présentés dans ce mémoire contribuent à la définition de méthodes pour la
détection et le diagnostic de défauts affectant les systèmes aéronautiques. Un système …

We consider that two orientations of a regular matroid are equivalent if one can be obtained
from the other by successive reorientations of positive circuits and/or positive cocircuits. We …

Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its
fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3…