Sciweavers

557 search results - page 16 / 112
» On the set multi-cover problem in geometric settings
Sort
View
JMIV
2006
58views more  JMIV 2006»
13 years 7 months ago
On the Probability of the Number of Solutions for the P4P Problem
This paper studies the multi-solution phenomenon for the perspective four point (P4P) problem from geometric and algebraic aspects. We give a pure geometric proof that the P4P pro...
Xiao-Shan Gao, Jianliang Tang
ENDM
2008
142views more  ENDM 2008»
13 years 7 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
FOCS
2007
IEEE
14 years 2 months ago
On the Optimality of Planar and Geometric Approximation Schemes
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
Dániel Marx
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 9 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
COMPGEOM
2009
ACM
14 years 2 months ago
Integral estimation from point cloud in d-dimensional space: a geometric view
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
Chuanjiang Luo, Jian Sun, Yusu Wang