150 search results - page 12 / 30 » Flipping Edges in Triangulations |
3DPVT
2002
IEEE
14 years 17 days ago
2002
IEEE
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marchi...
APDC
1997
13 years 9 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
WG
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
OA
1989
13 years 11 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
DMTCS
2010
13 years 5 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...