-
1
-
-
84878187805
-
SVR: Practical engineering of a fast 3D meshing algorithm
-
U. A. Acar, B. Hudson, G. L. Miller, and T. Phillips. SVR: Practical engineering of a fast 3D meshing algorithm. In Proc. 16th International Meshing Roundtable, pages 45-62, 2007.
-
(2007)
Proc. 16th International Meshing Roundtable
, pp. 45-62
-
-
Acar, U.A.1
Hudson, B.2
Miller, G.L.3
Phillips, T.4
-
2
-
-
33144478493
-
Persistence barcodes for shapes
-
G. Carlsson, A. Zomorodian, A. Collins, and L. Guibas. Persistence barcodes for shapes. Internat. Journal of Shape Modeling, 11:149-187, 2005.
-
(2005)
Internat. Journal of Shape Modeling
, vol.11
, pp. 149-187
-
-
Carlsson, G.1
Zomorodian, A.2
Collins, A.3
Guibas, L.4
-
4
-
-
70849097151
-
Proximity of persistence modules and their diagrams
-
F. Chazal, D. Cohen-Steiner, M. Glisse, L. J. Guibas, and S. Y. Oudot. Proximity of persistence modules and their diagrams. In Proceedings of the 25th ACM Symposium on Computational Geometry, 2009.
-
(2009)
Proceedings of the 25th ACM Symposium on Computational Geometry
-
-
Chazal, F.1
Cohen-Steiner, D.2
Glisse, M.3
Guibas, L.J.4
Oudot, S.Y.5
-
10
-
-
45849141951
-
A weak characterisation of the Delaunay triangulation
-
to appear
-
V. de Silva. A weak characterisation of the Delaunay triangulation. Geometriae Dedicata, 2008. to appear.
-
(2008)
Geometriae Dedicata
-
-
De Silva, V.1
-
12
-
-
0027846613
-
The union of balls and its dual shape
-
New York, NY, USA, ACM
-
H. Edelsbrunner. The union of balls and its dual shape. In SCG '93: Proceedings of the ninth annual symposium on Computational geometry, pages 218-231, New York, NY, USA, 1993. ACM.
-
(1993)
SCG '93: Proceedings of the Ninth Annual Symposium on Computational Geometry
, pp. 218-231
-
-
Edelsbrunner, H.1
-
13
-
-
0036883297
-
Topological persistence and simplification
-
DOI 10.1007/s00454-002-2885-2
-
H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. Discrete Compututational Geometry, 28:511-533, 2002. (Pubitemid 36161396)
-
(2002)
Discrete and Computational Geometry
, vol.28
, Issue.4
, pp. 511-533
-
-
Edelsbrunner, H.1
Letscher, D.2
Zomorodian, A.3
-
15
-
-
0034832768
-
Nice point sets can have nasty delaunay triangulations
-
J. Erickson. Nice point sets can have nasty delaunay triangulations. In Symposium on Computational Geometry, pages 96-105, 2001.
-
(2001)
Symposium on Computational Geometry
, pp. 96-105
-
-
Erickson, J.1
-
16
-
-
85180028698
-
Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes
-
A. Bezdek, editor
-
J. Erickson and S. Kim. Arbitrarily large neighborly families of congruent symmetric convex 3-polytopes. Discrete Geometry (A. Bezdek, editor), pages 267-278, 2003.
-
(2003)
Discrete Geometry
, pp. 267-278
-
-
Erickson, J.1
Kim, S.2
-
19
-
-
70349105765
-
Sparse voronoi refinement
-
Birmingham, Alabama, Long version available as Carnegie Mellon University Technical Report CMU-CS-06-132
-
B. Hudson, G. Miller, and T. Phillips. Sparse Voronoi Refinement. In Proceedings of the 15th International Meshing Roundtable, pages 339-356, Birmingham, Alabama, 2006. Long version available as Carnegie Mellon University Technical Report CMU-CS-06-132.
-
(2006)
Proceedings of the 15th International Meshing Roundtable
, pp. 339-356
-
-
Hudson, B.1
Miller, G.2
Phillips, T.3
-
22
-
-
40349102105
-
Finding the homology of submanifolds with high confidence from random samples
-
March
-
P. Niyogi, S. Smale, and S. Weinberger. Finding the homology of submanifolds with high confidence from random samples. Discrete Comput. Geom., 39(1-3):419-441, March 2008.
-
(2008)
Discrete Comput. Geom.
, vol.39
, Issue.1-3
, pp. 419-441
-
-
Niyogi, P.1
Smale, S.2
Weinberger, S.3
-
23
-
-
33750726614
-
A delaunay refinement algorithm for quality 2-dimensional mesh generation
-
Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993)
-
J. Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548-585, 1995. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (Austin, TX, 1993).
-
(1995)
J. Algorithms
, vol.18
, Issue.3
, pp. 548-585
-
-
Ruppert, J.1
-
24
-
-
84867957007
-
Off-centers: A new type of steiner points for computing size-optimal quality-guaranteed delaunay triangulations
-
A. Üngör. Off-centers: A new type of steiner points for computing size-optimal quality-guaranteed delaunay triangulations. Comput. Geom., 42(2):109-118, 2009.
-
(2009)
Comput. Geom.
, vol.42
, Issue.2
, pp. 109-118
-
-
Üngör, A.1
-
25
-
-
0001040183
-
Über den höheren zusammenhang kompakter räume und eine klasse von zusammenhangstreuen abbildungen
-
L. Vietoris. Über den höheren Zusammenhang kompakter Räume und eine Klasse von zusammenhangstreuen Abbildungen. Mathematische Annalen, 97(1):454-472, 1927.
-
(1927)
Mathematische Annalen
, vol.97
, Issue.1
, pp. 454-472
-
-
Vietoris, L.1
-
27
-
-
77954891715
-
-
See
-
Plex 2.5. See http://comptop.stanford.edu/programs/plex.html.
-
Plex 2.5.
-
-
|