Sciweavers

1604 search results - page 32 / 321
» Approximation algorithms for developable surfaces
Sort
View
DAC
2006
ACM
14 years 9 months ago
Generation of yield-aware Pareto surfaces for hierarchical circuit design space exploration
Pareto surfaces in the performance space determine the range of feasible performance values for a circuit topology in a given technology. We present a non-dominated sorting based ...
Saurabh K. Tiwary, Pragati K. Tiwary, Rob A. Ruten...
CGI
2006
IEEE
14 years 2 months ago
Near-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces
Abstract. A new adaptive tessellation method for general CatmullClark subdivision surfaces is presented. Development of the new method is based on the observation that optimum adap...
Shuhua Lai, Fuhua (Frank) Cheng
SIGGRAPH
1997
ACM
14 years 11 days 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
CCCG
2007
13 years 10 months ago
Approximations of Geodesic Distances for Incomplete Triangular Manifolds
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef...
COMPGEOM
2008
ACM
13 years 10 months ago
Discrete laplace operator on meshed surfaces
In recent years a considerable amount of work in graphics and geometric optimization used tools based on the Laplace-Beltrami operator on a surface. The applications of the Laplac...
Mikhail Belkin, Jian Sun, Yusu Wang