Sciweavers

1387 search results - page 211 / 278
» Convexity in Discrete Space
Sort
View
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 8 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 8 months ago
Solution of moving-boundary problems by the spectral element method
This paper describes a novel numerical model aiming at solving moving-boundary problems such as free-surface flows or fluid– structure interaction. This model uses a moving-gr...
Nicolas Bodard, Roland Bouffanais, Michel O. Devil...
JGTOOLS
2008
53views more  JGTOOLS 2008»
13 years 8 months ago
Query Sphere Indexing for Neighborhood Requests
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
Nicolas Brodu
CSDA
2007
131views more  CSDA 2007»
13 years 8 months ago
Bivariate density estimation using BV regularisation
In this paper we study the problem of bivariate density estimation. The aim is to find a density function with the smallest number of local extreme values which is adequate with ...
Andreas Obereder, Otmar Scherzer, Arne Kovac
JSCIC
2008
62views more  JSCIC 2008»
13 years 8 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou