Sciweavers

396 search results - page 13 / 80
» Odd Crossing Number Is Not Crossing Number
Sort
View
GD
2009
Springer
15 years 27 days ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
SIAMNUM
2010
134views more  SIAMNUM 2010»
14 years 4 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
14 years 9 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter
CAGD
2008
143views more  CAGD 2008»
14 years 9 months ago
A genus oblivious approach to cross parameterization
In this paper we present a robust approach to construct a map between two triangulated meshes, M and M' of arbitrary and possibly unequal genus. We introduce a novel initial ...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy
67
Voted
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
15 years 3 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim