401 search results - page 54 / 81 » Geometry of Isophote Curves |
COMPGEOM
1994
ACM
14 years 27 days ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
DGCI
2006
Springer
14 years 14 days ago
2006
Springer
Abstract-- In this paper, we introduce a new skeleton pruning method based on contour partitioning. Any contour partition can be used, but the partitions obtained by Discrete Curve...
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
CGF
2010
13 years 9 months ago
2010
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
IJCV
2007
13 years 8 months ago
2007
This article presents a novel method for computing the visual hull of a solid bounded by a smooth surface and observed by a finite set of cameras. The visual hull is the intersect...