9659 search results - page 128 / 1932 » Points on Computable Curves |
154
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
177
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
174
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
167
click to vote
ISTCS
1995
Springer
15 years 10 months ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
161
click to vote
APCHI
1998
IEEE
15 years 10 months ago
1998
IEEE
The limitations of palmtop computers are their display size and pointing mechanisms. This makes it difficult to use them for direct manipulation of very large objects, such as Wor...