| 2 |
|
%% http://bibdesk.sourceforge.net/ |
| 3 |
|
|
| 4 |
|
|
| 5 |
< |
%% Created for Dan Gezelter at 2010-10-21 12:23:58 -0400 |
| 5 |
> |
%% Created for Dan Gezelter at 2010-10-27 12:54:30 -0400 |
| 6 |
|
|
| 7 |
|
|
| 8 |
|
%% Saved with string encoding Unicode (UTF-8) |
| 55 |
|
@string{prl = {Phys. Rev. Lett.}} |
| 56 |
|
|
| 57 |
|
@string{rmp = {Rev. Mod. Phys.}} |
| 58 |
+ |
|
| 59 |
+ |
|
| 60 |
+ |
@article{Barber96, |
| 61 |
+ |
Author = {C.~B. Barber and D.~P. Dobkin and H.~T. Huhdanpaa}, |
| 62 |
+ |
Date-Added = {2010-10-27 12:52:57 -0400}, |
| 63 |
+ |
Date-Modified = {2010-10-27 12:52:57 -0400}, |
| 64 |
+ |
Journal = {ACM Trans. Math. Software}, |
| 65 |
+ |
Pages = {469-483}, |
| 66 |
+ |
Title = {The Quickhull Algorithm for Convex Hulls}, |
| 67 |
+ |
Volume = 22, |
| 68 |
+ |
Year = 1996} |
| 69 |
+ |
|
| 70 |
+ |
@article{delaunay, |
| 71 |
+ |
Author = {B. Delaunay}, |
| 72 |
+ |
Date-Added = {2010-10-27 12:48:48 -0400}, |
| 73 |
+ |
Date-Modified = {2010-10-27 12:49:35 -0400}, |
| 74 |
+ |
Journal = {Bull. Acad. Science USSR VII:Class. Sci. Mat. Nat.}, |
| 75 |
+ |
Pages = {793-800}, |
| 76 |
+ |
Title = {Sur la sph{\`e}re vide}, |
| 77 |
+ |
Year = {1934}} |
| 78 |
+ |
|
| 79 |
+ |
@article{springerlink:10.1007/BF00977785, |
| 80 |
+ |
Author = {Lee, D. T. and Schachter, B. J.}, |
| 81 |
+ |
Date-Added = {2010-10-27 12:44:24 -0400}, |
| 82 |
+ |
Date-Modified = {2010-10-27 12:44:24 -0400}, |
| 83 |
+ |
Issn = {0885-7458}, |
| 84 |
+ |
Issue = {3}, |
| 85 |
+ |
Journal = {International Journal of Parallel Programming}, |
| 86 |
+ |
Keyword = {Computer Science}, |
| 87 |
+ |
Note = {10.1007/BF00977785}, |
| 88 |
+ |
Pages = {219-242}, |
| 89 |
+ |
Publisher = {Springer Netherlands}, |
| 90 |
+ |
Title = {Two algorithms for constructing a Delaunay triangulation}, |
| 91 |
+ |
Url = {http://dx.doi.org/10.1007/BF00977785}, |
| 92 |
+ |
Volume = {9}, |
| 93 |
+ |
Year = {1980}, |
| 94 |
+ |
Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF00977785}} |
| 95 |
|
|
| 96 |
+ |
@article{EDELSBRUNNER:1994oq, |
| 97 |
+ |
Abstract = {Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ''shape'' of the set. For that purpose, this article introduces the formal notion of the family of alpha-shapes of a finite point set in R3. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter alpha is-an-element-of R controlling the desired level of detail. An algorithm is presented that constructs the entire family of shapes for a given set of size n in time O(n2), worst case. A robust implementation of the algorithm is discussed, and several applications in the area of scientific computing are mentioned.}, |
| 98 |
+ |
Address = {1515 BROADWAY, NEW YORK, NY 10036}, |
| 99 |
+ |
Author = {EDELSBRUNNER, H and MUCKE, EP}, |
| 100 |
+ |
Date = {JAN 1994}, |
| 101 |
+ |
Date-Added = {2010-10-27 12:32:43 -0400}, |
| 102 |
+ |
Date-Modified = {2010-10-27 12:32:43 -0400}, |
| 103 |
+ |
Journal = {Acm Transactions On Graphics}, |
| 104 |
+ |
Keywords = {COMPUTATIONAL GRAPHICS; DELAUNAY TRIANGULATIONS; GEOMETRIC ALGORITHMS; POINT SETS; POLYTOPES; ROBUST IMPLEMENTATION; SCIENTIFIC COMPUTING; SCIENTIFIC VISUALIZATION; SIMPLICIAL COMPLEXES; SIMULATED PERTURBATION; 3-DIMENSIONAL SPACE}, |
| 105 |
+ |
Pages = {43-72}, |
| 106 |
+ |
Publisher = {ASSOC COMPUTING MACHINERY}, |
| 107 |
+ |
Timescited = {270}, |
| 108 |
+ |
Title = {3-DIMENSIONAL ALPHA-SHAPES}, |
| 109 |
+ |
Volume = {13}, |
| 110 |
+ |
Year = {1994}} |
| 111 |
|
|
| 112 |
|
@misc{Qhull, |
| 113 |
|
Date-Added = {2010-10-21 12:05:09 -0400}, |
