1879 search results - page 169 / 376 » Computational geometry algorithms library |
134
click to vote
ALGORITHMICA
2010
15 years 5 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
137
Voted
CGF
2007
15 years 5 months ago
2007
Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitra...
156
Voted
SIGGRAPH
2010
ACM
15 years 9 months ago
2010
ACM
Geodesic curves in surfaces are not only minimizers of distance, but they are also the curves of zero geodesic (sideways) curvature. It turns out that this property makes patterns...
152
click to vote
SWAT
2000
Springer
15 years 8 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
132
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...