Sciweavers

876 search results - page 116 / 176
» Complexity in geometric SINR
Sort
View
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 4 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
COMPGEOM
2006
ACM
14 years 3 months ago
Algorithms for two-box covering
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...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
VISUALIZATION
1999
IEEE
14 years 2 months ago
Rendering on a Budget: A Framework for Time-Critical Rendering
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...
James T. Klosowski, Cláudio T. Silva
SIGGRAPH
1998
ACM
14 years 2 months ago
Realistic Modeling and Rendering of Plant Ecosystems
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...
Oliver Deussen, Pat Hanrahan, Bernd Lintermann, Ra...
SIGGRAPH
1997
ACM
14 years 1 months ago
View-dependent refinement of progressive meshes
Level-of-detail (LOD) representations are an important tool for realtime rendering of complex geometric environments. The previously introduced progressive mesh representation def...
Hugues Hoppe