COMPUTING
2007
13 years 11 months ago
2007
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
IJCV
2006
13 years 11 months ago
2006
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
BMVC
1998
14 years 8 days ago
1998
In this paper, we discuss a method for representing and matching planar curves. The technique is based on using calculations from concentric circles to represent each curve by two...
KES
2000
Springer
14 years 2 months ago
2000
Springer
Cross-sectional pmfiles of medieval mouldings are often considered to be a vital form of data to Art Historians. Mouldings were often used to highlight salient areas of buildings,...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
ECCV
2006
Springer
15 years 24 days ago
2006
Springer
Generalized cylinder (GC) has played an important role in computer vision since it was introduced in the 1970s. While studying GC models in human visual perception of shapes from c...
CVPR
2007
IEEE
15 years 28 days ago
2007
IEEE
We revisit the problem of recovering 3D shape from the projection of planar curves on a surface. This problem is strongly motivated by perception studies. Applications include sin...