450 search results - page 16 / 90 » Quadrangulations of Planar Sets |
CVPR
2000
IEEE
14 years 11 months ago
2000
IEEE
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
COMGEO
2006
ACM
13 years 9 months ago
2006
ACM
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
MFCS
1998
Springer
14 years 1 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
CIAC
2006
Springer
14 years 24 days ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...