150 search results - page 20 / 30 » Flipping Edges in Triangulations |
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which a...
DM
2006
13 years 7 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
WACV
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...