9659 search results - page 267 / 1932 » Points on Computable Curves |
177
click to vote
GD
2007
Springer
16 years 27 days ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
182
Voted
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
222
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
150
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
292
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Given a single image of an arbitrary road, that may not
be well-paved, or have clearly delineated edges, or some
a priori known color or texture distribution, is it possible
for...