2583 search results - page 5 / 517 » On the Representation of Timed Polyhedra |
SIAMJO
2010
13 years 6 months ago
2010
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
CCCG
2003
13 years 9 months ago
2003
A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P, is a k...
JCDCG
2000
Springer
13 years 11 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...