150 search results - page 6 / 30 » Flipping Edges in Triangulations |
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
VIS
2004
IEEE
14 years 8 months ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
TCS
2008
13 years 7 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
CCCG
2006
13 years 9 months ago
2006
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
DICTA
2003
13 years 9 months ago
2003
Abstract. This paper introduces a two-level approach for image segmentation based on region and edge integration. Edges are first detected in the original image using a combinatio...