We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...