Sciweavers

396 search results - page 12 / 80
» Crossing Numbers
Sort
View
GD
2009
Springer
13 years 10 months 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
CGF
2006
183views more  CGF 2006»
13 years 7 months ago
Cross Dissolve Without Cross Fade: Preserving Contrast, Color and Salience in Image Compositing
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
Mark Grundland, Rahul Vohra, Gareth P. Williams, N...
JCT
2007
90views more  JCT 2007»
13 years 7 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
HICSS
2009
IEEE
116views Biometrics» more  HICSS 2009»
14 years 2 months ago
Digital Cross-Organizational and Cross-Border Collaboration: A Scientometric Study
Digital cross-organizational and cross-border collaboration are emerging research issues. Significant drivers of this development are collaboration-related information systems. A ...
Maria Madlberger, Narcyz Roztocki
SIAMNUM
2010
134views more  SIAMNUM 2010»
13 years 2 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