2877 search results - page 118 / 576 » The Complexity of Planarity Testing |
123
Voted
GRAPHICSINTERFACE
2003
15 years 5 months ago
2003
Many training, education, and visualization environments would benefit from realistic animated characters. Unfortunately, interfaces for character motion specification are often c...
144
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
160
click to vote
DISOPT
2010
15 years 4 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
121
click to vote
GC
2010
Springer
15 years 2 months ago
2010
Springer
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
131
Voted
JDA
2010
15 years 2 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...