5210 search results - page 109 / 1042 » Exact geometric computation |
WEA
2009
Springer
15 years 4 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
IH
2005
Springer
15 years 3 months ago
2005
Springer
We examine the problem of watermarking schemes robust against geometric distortions from a complexity theoretic point of view. The main results presented are polynomial time reduct...
SIGGRAPH
1990
ACM
15 years 2 months ago
1990
ACM
We propose a new rendering technique that produces 3-D images with enhanced visual comprehensibility. Shape features can be readily understood if certain geometric properties are ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith
GD
2009
Springer
15 years 1 months ago
2009
Springer
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...