115 search results - page 18 / 23 » Numerical decomposition of geometric constraints |
SIAMNUM
2010
14 years 4 months ago
2010
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
121
click to vote
COMGEO
1999
ACM
14 years 9 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
102
click to vote
SIGGRAPH
1992
ACM
15 years 1 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...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
— We propose a joint power- and rate-control scheme to broadcast a multiplicity of video sequences over a broadcast channel. The formulation is intended to be general in scope, w...
CAD
2000
Springer
14 years 9 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...