150 search results - page 11 / 30 » Flipping Edges in Triangulations |
COMBINATORICS
2007
13 years 7 months ago
2007
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial iden...
ENDM
2008
13 years 7 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
CVIU
1999
13 years 7 months ago
1999
We show that we can effectively fit arbitrarily complex animation models to noisy data extracted from ordinary face images Our approach is based on least-squares adjustment, using...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
WADS
2001
Springer
14 years 19 hour ago
2001
Springer
In this paper we discuss the kinetic maintenance of the Euclidean Voronoi diagram and its dual, the Delaunay triangulation, for a set of moving disks. The most important aspect in ...