Sciweavers

25 search results - page 5 / 5
» Geometric interpolation by planar cubic polynomial curves
Sort
View
ICA3PP
2010
Springer
14 years 10 days ago
Modular Resultant Algorithm for Graphics Processors
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Pavel Emeliyanenko
CAD
2007
Springer
13 years 7 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao
ECCV
2006
Springer
14 years 9 months ago
Cyclostationary Processes on Shape Spaces for Gait-Based Recognition
Abstract. We present a geometric and statistical approach to gaitbased human recognition. The novelty here is to consider observations of gait, considered as planar silhouettes, to...
David Kaziska, Anuj Srivastava
CAGD
2008
112views more  CAGD 2008»
13 years 7 months ago
On the approximation order of tangent estimators
A classic problem in geometric modelling is curve interpolation to data points. Some of the existing interpolation schemes only require point data, whereas others, require higher ...
G. Albrecht, J.-P. Bécar, Gerald E. Farin, ...
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 1 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen