2583 search results - page 11 / 517 » On the Representation of Timed Polyhedra |
162
click to vote
GREC
2003
Springer
15 years 11 months ago
2003
Springer
We aim to reconstruct three-dimensional polyhedral solids from axonometric-like line drawings. A new approach is proposed to make use of planes of mirror symmetry detected in such ...
143
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
146
click to vote
CCCG
1996
15 years 7 months ago
1996
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
136
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
150
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...