Sciweavers

5210 search results - page 662 / 1042
» Exact geometric computation
Sort
View
COMGEO
1999
ACM
15 years 4 months ago
Simplifying spline models
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
M. Gopi, Dinesh Manocha
TOG
2002
162views more  TOG 2002»
15 years 4 months ago
Jigsaw image mosaics
This paper introduces a new kind of mosaic, called Jigsaw Image Mosaic (JIM), where image tiles of arbitrary shape are used to compose the final picture. The generation of a Jigsa...
Junhwan Kim, Fabio Pellacini
CGF
2010
167views more  CGF 2010»
15 years 1 months ago
Chain Shape Matching for Simulating Complex Hairstyles
Animations of hair dynamics greatly enrich the visual attractiveness of human characters. Traditional simulation techniques handle hair as clumps or continuum for efficiency; howe...
Witawat Rungjiratananon, Yoshihiro Kanamori, Tomoy...
CGF
2010
135views more  CGF 2010»
15 years 1 months ago
Interactive Rendering of Non-Constant, Refractive Media Using the Ray Equations of Gradient-Index Optics
Existing algorithms can efficiently render refractive objects of constant refractive index. For a medium with a continuously varying index of refraction, most algorithms use the r...
Chen Cao, Zhong Ren, Baining Guo, Kun Zhou
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 11 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...