Sciweavers

397 search results - page 44 / 80
» Geometrical plenoptic sampling
Sort
View
CVPR
2008
IEEE
15 years 3 months ago
Classification via semi-Riemannian spaces
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptu...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
WSCG
2004
146views more  WSCG 2004»
15 years 3 months ago
Frequency-based Operators for Freeform Feature Shape Reuse
Freeform feature shape reuse is an important issue in industrial design supporting. In this paper, the frequencybased operators for freeform feature shape reuse are discussed. Unl...
Chensheng Wang, Joris S. M. Vergeest, Yu Song
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 3 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
TVCG
2008
103views more  TVCG 2008»
15 years 1 months ago
Perceptually Guided Polygon Reduction
The properties of the human visual system are taken into account, along with the geometric aspects of an object, in a new surface remeshing algorithm and a new mesh simplification ...
Lijun Qu, Gary W. Meyer
134
Voted
CG
1998
Springer
15 years 1 months ago
Smooth transitions in texture-based simplification
We are investigating techniques for providing smooth transitions when simplifying large, static geometric models with texture-based representations (or impostors). Traditionally, ...
Daniel G. Aliaga, Anselmo Lastra