Sciweavers

7006 search results - page 1039 / 1402
» Approximation Algorithms
Sort
View
SIGGRAPH
2010
ACM
15 years 11 months ago
Interactive hair rendering under environment lighting
We present an algorithm for interactive hair rendering with both single and multiple scattering effects under complex environment lighting. The outgoing radiance due to single sca...
Zhong Ren, Kun Zhou, Tengfei Li, Wei Hua, Baining ...
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
15 years 11 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 11 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
SIGGRAPH
1997
ACM
15 years 10 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
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 8 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
« Prev « First page 1039 / 1402 Last » Next »