13 search results - page 2 / 3 » Radial Perfect Partitions of Convex Sets in the Plane |
COCOON
2009
Springer
14 years 6 days ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
FSTTCS
2004
Springer
13 years 11 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, ...
GIS
2004
ACM
14 years 6 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...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
In this paper, we first propose a new family of geometrical image transforms that decompose images both radially and angularly. Our construction comprises two stages of filter ban...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...