150 search results - page 2 / 30 » Flipping Edges in Triangulations |
SIAMDM
2008
13 years 5 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
JCO
2010
13 years 3 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
ICCSA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
CSSE
2008
IEEE
13 years 12 months ago
2008
IEEE
