5210 search results - page 111 / 1042 » Exact geometric computation |
ACCV
1998
Springer
15 years 2 months ago
1998
Springer
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
SODA
1994
ACM
14 years 11 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
110
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
ICCV
2005
IEEE
15 years 12 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...