450 search results - page 10 / 90 » Quadrangulations of Planar Sets |
CVIU
1998
14 years 11 months ago
1998
103
click to vote
COMBINATORICS
2004
14 years 11 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...
101
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
CORR
2011
Springer
14 years 3 months ago
2011
Springer
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...