36 search results - page 3 / 8 » On the Optimality of Planar and Geometric Approximation Sche... |
MST
2007
13 years 5 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
ICIP
2000
IEEE
14 years 7 months ago
2000
IEEE
This paper presents a technique for lossy compression of dense range images. Two separate compression schemes are applied. The first scheme (geometric compression) reduces redunda...
SIROCCO
2001
13 years 7 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
CAGD
2008
13 years 6 months ago
2008
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 ...