5 search results - page 1 / 1 » On the worst-case complexity of the silhouette of a polytope |
CCCG
2003
13 years 6 months ago
2003
We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.
ESA
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
COMGEO
2007
ACM
13 years 5 months ago
2007
ACM
We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can ...
COMGEO
1998
ACM
13 years 4 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
AOR
2006
13 years 5 months ago
2006
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...