19 search results - page 4 / 4 » I O-efficient algorithms for computing planar geometric span... |
CIVR
2007
Springer
13 years 11 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
CAE
2010
13 years 16 days ago
2010
Renaissance artists discovered methods for imaging realistic depth on a two dimensional surface by re-inventing linear perspective. In solving the problem of depth depiction, they...
SIGGRAPH
1999
ACM
13 years 9 months ago
1999
ACM
This paper presents a novel 3D plenoptic function, which we call concentric mosaics. We constrain camera motion to planar concentric circles, and create concentric mosaics using a...
CGF
2007
13 years 5 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...