Sciweavers

989 search results - page 26 / 198
» Approximating the Pareto optimal set using a reduced set of ...
Sort
View
SGP
2007
13 years 10 months ago
Voronoi-based variational reconstruction of unoriented point sets
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...
Pierre Alliez, David Cohen-Steiner, Yiying Tong, M...
ASPLOS
1987
ACM
13 years 11 months ago
The Effect of Instruction Set Complexity on Program Size and Memory Performance
One potentialdisadvantage of a machine with a reduced instruction. set is that object programs may be substantially larger than those for a machine with a richer, more complex ins...
Jack W. Davidson, Richard A. Vaughan
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 2 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
CGF
2005
159views more  CGF 2005»
13 years 7 months ago
Real-Time Shape Editing using Radial Basis Functions
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
Mario Botsch, Leif Kobbelt
COMPUTING
2006
100views more  COMPUTING 2006»
13 years 7 months ago
Interval Arithmetic with Containment Sets
The idea of containment sets (csets) is due to Walster and Hansen, and the theory is mainly due to the first author. Now that floating point computation with infinities is widely a...
John D. Pryce, George F. Corliss