Sciweavers

713 search results - page 8 / 143
» Laplacian mesh optimization
Sort
View
GRAPHICSINTERFACE
2007
13 years 9 months ago
Spectral graph-theoretic approach to 3D mesh watermarking
We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) t...
Emad E. Abdallah, A. Ben Hamza, Prabir Bhattachary...
ASPDAC
2008
ACM
95views Hardware» more  ASPDAC 2008»
13 years 9 months ago
MeshWorks: An efficient framework for planning, synthesis and optimization of clock mesh networks
A leaf-level clock mesh is known to be very tolerant to variations [1]. However, its use is limited to a few high-end designs because of the high power/resource requirements and la...
Anand Rajaram, David Z. Pan
CVPR
2005
IEEE
14 years 9 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
SMA
2008
ACM
131views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Streaming tetrahedral mesh optimization
Improving the quality of tetrahedral meshes is an important operation in many scientific computing applications. Meshes with badly shaped elements impact both the accuracy and con...
Tian Xia, Eric Shaffer