Sciweavers

22 search results - page 2 / 5
» Computing Triangulations Using Oriented Matroids
Sort
View
IFIP
1998
Springer
13 years 10 months ago
One Sided Error Predicates in Geometric Computing
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicate...
Lutz Kettner, Emo Welzl
ICCV
2007
IEEE
14 years 8 months ago
3-D Reconstruction from Sparse Views using Monocular Vision
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
IPMI
2009
Springer
14 years 7 months ago
Oriented Morphometry of Folds on Surfaces
Abstract. The exterior surface of the brain is characterized by a juxtaposition of crests and troughs that together form a folding pattern. The majority of the deformations that oc...
Maxime Boucher, Alan C. Evans, Kaleem Siddiqi
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
13 years 11 months ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
FOCS
2006
IEEE
14 years 9 days ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans