450 search results - page 52 / 90 » Quadrangulations of Planar Sets |
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
This paper proposes two indicators for predicting the quality of camera model parameters from a set of input images. The first indicator is based on the acutance. It can quickly i...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
FAW
2008
Springer
13 years 11 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...