947 search results - page 102 / 190 » Discrete Geometry |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
COMPGEOM
1997
ACM
15 years 2 months ago
1997
ACM
Many algorithms developed in computational geometry are needlessly complicated and slow because they have to be prepared for very complicated, hypothetical inputs. To avoid this, ...
COMPGEOM
1996
ACM
15 years 2 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...