Graphics Reference
In-Depth Information
[65]
H. Edelsbrunner. Modeling with simplicial complexes. In
Proc. 6th Canadian Conf. Com-
put. Geom.
, pages 36-44, 1994.
56
[66]
H. Edelsbrunner and J. Harer. Jacobi sets of multiple Morse functions. In F. Cucker,
R. DeVore, P. Olver, and E. Sueli, editors,
Foundations in Computational Mathematics
,
pages 37-57. Cambridge univ. Press, 2002.
64
[67]
H. Edelsbrunner and J. Harer.
Computational Topology: An Introduction
. Amer. Math.
Soc., 2010.
84
[68]
H. Edelsbrunner, J. Harer, A. Mascarenhas, and V. Pascucci. Time-varying Reeb graphs
for continuous space-time data. In
SCG '04: Proceedings of the
20
th
Annual Symposium on
Computational Geometry
, pages 366-372, New York, NY, USA, 2004. ACM Press.
DOI:
10.1145/997817.997872
.
72
[69]
H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci. Morse-Smale com-
plexes for piecewise linear 3-manifolds. In
SCG '03: Proceedings of the
19
th
An-
nual Symposium on Computational Geometry
, pages 361-370. ACM Press, 2003.
DOI:
10.1145/777792.777846
.
77
[70]
H. Edelsbrunner, J. Harer, and A. Zomorodian. Hierarchical Morse complexes for
piecewise linear 2-manifolds. In
SCG '01: Proceedings of the
17
th
Annual Symposium on
Computational Geometry
, pages 70-79, New York, NY, USA, 2001. ACM Press.
DOI:
10.1145/378583.378626
.
77
,
78
[71]
H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simpli-
fication. In
IEEE Foundations of Computer Science, Proceedings
41
st
Annual Symposium
,
pages 454-463, 2000.
DOI: 10.1007/s00454-002-2885-2
.
81
[72]
H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplifi-
cation.
Discrete Computational Geometry
, 28:511-533, 2002.
DOI: 10.1007/s00454-002-
2885-2
.
81
[73]
H. Edelsbrunner and E. P. Mücke. Simulation of Simplicity: A technique to cope with
degenerate cases in geometric algorithms.
ACM Transactions on Graphics
, 9(1):66-104,
1990.
DOI: 10.1145/77635.77639
.
64
[74]
C. Ehresmann and G. Reeb. Sur les champs d'éléments de contact de dimension p com-
plètement intégrable dans une variété continuèment differentiable
v
n
.
Comptes Rendu Heb-
domadaires des Séances de l'Académie des Sciences
, 218:955-957, 1944.
69
[75]
J. Erickson and S. Har-Peled. Optimally cutting a surface into a disk.
Discrete Computa-
tional Geometry
, 31(1):37-59, 2004.
DOI: 10.1007/s00454-003-2948-z
.
59
Search WWH ::
Custom Search