2183 search results - page 12 / 437 » Multi-pass geometric algorithms |
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
CAD
2007
Springer
13 years 9 months ago
2007
Springer
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
CAD
2006
Springer
13 years 10 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...