1604 search results - page 135 / 321 » Regularization on Discrete Spaces |
COMPUTING
1998
15 years 3 months ago
1998
We give some estimates related to nite element multilevel splittings and Sobolev norms of negative order. Basically, results for the positive order case are carried over by dualit...
137
Voted
SIGGRAPH
2000
ACM
15 years 8 months ago
2000
ACM
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...
133
click to vote
SIAMREV
2010
14 years 10 months ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
119
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
132
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...