Sciweavers

1604 search results - page 106 / 321
» Approximation algorithms for developable surfaces
Sort
View
109
Voted
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 5 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
CRV
2006
IEEE
176views Robotics» more  CRV 2006»
15 years 3 months ago
Stereo Retinex
The retinex algorithm for lightness and color constancy is extended to include 3-dimensional spatial information reconstructed from a stereo image. A key aspect of traditional ret...
Weihua Xiong, Brian V. Funt
CVIU
2011
14 years 8 months ago
Sampled medial loci for 3D shape representation
The medial axis transform is valuable for shape representation as it is complete and captures part structure. However, its exact computation for arbitrary 3D models is not feasibl...
Svetlana Stolpner, Sue Whitesides, Kaleem Siddiqi
SIGGRAPH
1990
ACM
15 years 5 months ago
Comprehensible rendering of 3-D shapes
We propose a new rendering technique that produces 3-D images with enhanced visual comprehensibility. Shape features can be readily understood if certain geometric properties are ...
Takafumi Saito, Tokiichiro Takahashi
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
15 years 7 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim