2583 search results - page 7 / 517 » On the Representation of Timed Polyhedra |
ESA
2007
Springer
15 years 5 months ago
2007
Springer
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...
96
Voted
SAS
2005
Springer
15 years 4 months ago
2005
Springer
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
SODA
1992
ACM
15 years 7 days ago
1992
ACM
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...
101
click to vote
SMA
2010
ACM
14 years 11 months ago
2010
ACM
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-...
SIAMDM
2008
14 years 11 months ago
2008
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 ...