2254 search results - page 185 / 451 » Computing the minimal covering set |
178
click to vote
GD
2007
Springer
16 years 24 days ago
2007
Springer
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
163
click to vote
ARITH
2005
IEEE
16 years 8 days ago
2005
IEEE
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
191
click to vote
SOFSEM
2005
Springer
16 years 3 days ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
157
click to vote
SGP
2007
15 years 9 months ago
2007
We propose a constraint-based method for the fairing of surface meshes. The main feature of our approach is that the resulting smoothed surface remains within a prescribed distanc...
161
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper describes an algorithm for the extraction of multiple regions using multiple active contour models (ACMs). The algorithm organizes edge points into strokes and assigns ...