150 search results - page 3 / 30 » Flipping Edges in Triangulations |
JGT
2007
14 years 11 months ago
2007
111
click to vote
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
115
click to vote
CPHYSICS
2004
14 years 11 months ago
2004
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
CCCG
2007
15 years 1 months ago
2007
Given a surface triangulation T of and a subset X of its vertex set V (T), we define a restricted edge contraction as a contraction of an edge connecting X and V (T)−X. Boundar...
83
Voted
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, a new flip-flop called Double-edge triggered Feedback Flip-Flop (DFFF) is proposed. The dynamic power consumption of DFFF is reduced by avoiding unnecessary interna...