22 search results - page 1 / 5 » Approximations by Smooth Transitions in Binary Space Partiti... |
SIBGRAPI
2008
IEEE
13 years 10 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
FSTTCS
2004
Springer
13 years 9 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
GIS
2004
ACM
14 years 5 months ago
2004
ACM
This paper presents a fast algorithm for smooth digital elevation model interpolation and approximation from scattered elevation data. The global surface is reconstructed by subdi...
ADCM
2011
12 years 11 months ago
2011
In this paper, we have obtained an approximation result in the Generalized Finite Element Method (GFEM) that reflects the global approximation property of the Partition of Unity ...