Sciweavers

876 search results - page 78 / 176
» Complexity in geometric SINR
Sort
View
FOCS
2002
IEEE
14 years 3 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir
WAE
1998
118views Algorithms» more  WAE 1998»
13 years 11 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
CVPR
2000
IEEE
15 years 2 days ago
3-D Model Construction Using Range and Image Data
This paper deals with the automated creation of geometric and photometric correct 3-D models of the world. Those models can be used for virtual reality, tele? presence, digital ci...
Ioannis Stamos, Peter K. Allen
CVPR
2008
IEEE
15 years 2 days ago
Efficient object shape recovery via slicing planes
Recovering the three-dimensional (3D) object shape lies as an unresolved and active research topic on the crosssection of computer vision, photogrammetry and bioinformatics. Altho...
Po-Lun Lai, Alper Yilmaz
ICIP
2005
IEEE
14 years 11 months ago
Approximation power of directionlets
In spite of the success of the standard wavelet transform (WT) in image processing, the efficiency of its representation is limited by the spatial isotropy of its basis functions ...
Vladan Velisavljevic, Baltasar Beferull-Lozano, Ma...