21 search results - page 2 / 5 » comgeo 2006 |
COMGEO
2006
ACM
13 years 11 months ago
2006
ACM
COMGEO
2006
ACM
13 years 11 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
COMGEO
2006
ACM
13 years 11 months ago
2006
ACM
: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the ...
COMGEO
2006
ACM
13 years 11 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
COMGEO
2006
ACM
13 years 11 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...