Sciweavers

2251 search results - page 425 / 451
» Geometric Algorithms on CUDA
Sort
View
SI3D
1999
ACM
13 years 11 months ago
GAPS: general and automatic polygonal simplification
We present a new approach for simplifying polygonal objects. Our method is general in that it works on models that contain both non-manifold geometry and surface attributes. It is...
Carl Erikson, Dinesh Manocha
SIGGRAPH
1999
ACM
13 years 11 months ago
A Perceptually Based Physical Error Metric for Realistic Image Synthesis
We introduce a new concept for accelerating realistic image synthesis algorithms. At the core of this procedure is a novel physical error metric that correctly predicts the percep...
Mahesh Ramasubramanian, Sumanta N. Pattanaik, Dona...
SMA
1999
ACM
100views Solid Modeling» more  SMA 1999»
13 years 11 months ago
Matchmaker: manifold BReps for non-manifold r-sets
Many solid modeling construction techniques produce non-manifold r-sets (solids). With each non-manifold model N we can associate a family of manifold solid models that are infini...
Jarek Rossignac, David E. Cardoze
CGI
1998
IEEE
13 years 11 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 11 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or