3005 search results - page 213 / 601 » Computational geometry for sculpture |
145
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
154
click to vote
EJC
2010
15 years 6 months ago
2010
Most of these problems were presented at the conference on Combinatorics, Geometry and Computer Science, held at CIRM, Luminy, 2-4 May 2007. I have added one problem on a similar ...
173
Voted
CAGD
2010
15 years 4 months ago
2010
In this paper we introduce a new framework for geometric modeling that combines implicit and parametric surface representations with volumetric warpings. The framework is based on...
193
click to vote
SIGGRAPH
1992
ACM
15 years 10 months ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
186
click to vote
EUROCRYPT
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...