24 search results - page 2 / 5 » Rational approximation of vertical segments |
JUCS
2007
13 years 5 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
ICRA
1995
IEEE
13 years 9 months ago
1995
IEEE
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
ICIP
2000
IEEE
14 years 7 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
TIP
2010
13 years 2 days ago
2010
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...