2583 search results - page 6 / 517 » On the Representation of Timed Polyhedra |
SMA
2003
ACM
14 years 29 days ago
2003
ACM
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
VMV
2001
13 years 9 months ago
2001
This paper presents a new approach to achieve elementary neighborhood operations on both 2D and 3D binary images by using the Extreme Vertices Model (EVM), a recent orthogonal pol...
COMPGEOM
1991
ACM
13 years 11 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to re...
SMA
2005
ACM
14 years 1 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...