Sciweavers

785 search results - page 91 / 157
» Teaching computer graphics constructively
Sort
View
DCC
2007
IEEE
16 years 2 months ago
Lifting of divisible designs
The aim of this paper is to present a construction of t-divisible designs for t > 3, because such divisible designs seem to be missing in the literature. To this end, tools suc...
Andrea Blunck, Hans Havlicek, Corrado Zanella
EUROGRAPHICS
2010
Eurographics
16 years 9 days ago
Sketching Clothoid Splines Using Shortest Paths
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
Ilya Baran, Jaakko Lehtinen, Jovan Popovic
GD
2009
Springer
15 years 1 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
DCC
2007
IEEE
16 years 2 months ago
Multiple-Description Coding by Dithered Delta-Sigma Quantization
We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and ...
Jan Østergaard, Ram Zamir
DCC
2005
IEEE
16 years 2 months ago
A Family of Binary (t, m, s)-Nets of Strength 5
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
Jürgen Bierbrauer, Yves Edel