38 search results - page 3 / 8 » Visibility Computations: From Discrete Algorithms to Real Al... |
COMPGEOM
1999
ACM
13 years 12 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...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
ESA
2004
Springer
14 years 28 days ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. The shapes of many natural and man-made objects have curved contours. The images of such contours usually do not have sufficient distinctive features to apply conventiona...
SMI
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...