4212 search results - page 235 / 843 » On Compressible Pairings and Their Computation |
150
click to vote
GMP
2000
IEEE
15 years 11 months ago
2000
IEEE
An algorithm for calculating the minimum distance between non-convex polyhedra is described. A polyhedron is represented by a set of triangles. In calculating the distance between...
166
click to vote
HYBRID
1999
Springer
15 years 11 months ago
1999
Springer
We discuss a procedure for synthesizing controllers for safety specifications for hybrid systems. The procedure depends on the construction of the set of states of a continuous dy...
179
click to vote
CCCG
2008
15 years 8 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
168
click to vote
MEDINFO
2007
15 years 8 months ago
2007
The accurate quantification of disease patterns in medical images allows radiologists to track the progress of a disease. Various computer vision techniques are able to automatica...
143
click to vote
VMV
2008
15 years 8 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...