11381 search results - page 129 / 2277 » Connectivity |
122
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
113
Voted
CVGIP
2004
15 years 3 months ago
2004
Digital geometry is very different from Euclidean geometry in many ways and the intersection of two digital lines or planes is often used to illustrate those differences. Neverthe...
121
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
130
Voted
JC
2000
15 years 3 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
146
Voted
COMBINATORICS
1998
15 years 3 months ago
1998
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...