3824 search results - page 35 / 765 » Geometry Constructions Language |
71
Voted
DM
2008
14 years 9 months ago
2008
We present new constructions for (n, w, ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q - 1)-arcs contain...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
COMPGEOM
1998
ACM
15 years 1 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
182
Voted
FIMH
2011
Springer
14 years 1 months ago
2011
Springer
In this paper, we present an effective algorithm to construct a 3D shape atlas for the left ventricle of heart from cardiac Magnetic Resonance Image data. We derive a framework tha...
COMPGEOM
1994
ACM
15 years 1 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...