876 search results - page 116 / 176 » Complexity in geometric SINR |
153
click to vote
ISSAC
2007
Springer
16 years 9 days ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
160
click to vote
COMPGEOM
2006
ACM
16 years 3 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
150
click to vote
VISUALIZATION
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
147
click to vote
SIGGRAPH
1998
ACM
15 years 10 months ago
1998
ACM
Modeling and rendering of natural scenes with thousands of plants poses a number of problems. The terrain must be modeled and plants must be distributed throughout it in a realist...
187
click to vote
SIGGRAPH
1997
ACM
15 years 9 months ago
1997
ACM
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...