1879 search results - page 102 / 376 » Computational geometry algorithms library |
140
click to vote
PARA
2000
Springer
15 years 8 months ago
2000
Springer
Proliferation of digital libraries plus availability of electronic documents from the Internet have created new challenges for computer science researchers and professionals. Docum...
130
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
145
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation for uncalibrated cameras with radial distortion has recently been formulated as a minimal problem and successfully solved in...
136
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
135
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...