Fetching the paper…
Reading the bibliography…
The efficiency of extracting topological information from point data depends largely on the complex that is built on top of the data points.
James R. Munkres. Elements of Algebraic Topology. Addison–Wesley Publishing Company, Menlo Park, 1984
1984
Earlier work this paper cites.
T. Gonzalez. Clustering to minimize the maximum inter-cluster distance. Theoretical Computer Science, 38
1985
Earlier work this paper cites.
J.-C. Hausmann. On the Vietoris-Rips complexes and a cohomology theory for metric spaces. Prospects in topology: Proc. Conf
1994
Earlier work this paper cites.
N. Amenta, S. Choi, T. K. Dey and N. Leekha. A simple algorithm for homeomorphic surface reconstruction. Int. J. Comput. Geom. Appl
2002
Earlier work this paper cites.
G. Carlsson and V. de Silva. Topological approximation by small simplicial complexes, 2003. preprint
2003
Earlier work this paper cites.
2004
Earlier work this paper cites.
F. Chazal and A. Lieutier. The λ \lambda -medial axis. Graph. Models
2005
Earlier work this paper cites.
S.-W. Cheng, T. K. Dey, and E. A. Ramos. Manifold reconstruction from point samples. Proc. 16th Sympos. Discrete Algorithms
2005
Earlier work this paper cites.
Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang. GLIDER: gradient landmark-based distributed routing for sensor networks. Proc. INFOCOM 2005
2005
Cited alongside, same era.
D. Cohen-Steiner, H. Edelsbrunner, and J. L. Harer. Stability of persistence diagrams. Discrete Comput. Geom
2007
Cited alongside, same era.
T. K. Dey. Curve and Surface Reconstruction : Algorithms with Mathematical Analysis. Cambridge University Press, New York, 2007
2007
Cited alongside, same era.
F. Chazal and S. Oudot. Towards persistence-based reconstruction in Euclidean spaces. Proc. 24th Ann. Sympos. Comput. Geom
2008
Cited alongside, same era.
R. Ghrist. Barcodes: The persistent topology of data. Bull. Amer. Math. Soc
2008
Cited alongside, same era.
J. Gao, L. Guibas, S. Oudot, and Y. Wang. Geodesic Delaunay Triangulation and Witness Complex in the Plane. Trans. Algorithms (TALG)
2010
Later among the works it cites.
D. Attali, A. Lieutier, and D. Salinas. Vietoris-Rips complexes also provide topologically correct reconstruction of sampled shapes. Proc. 27th Annu. Sympos. Comput. Geom
2011
Later among the works it cites.
F. Chazal, L. J. Guibas, S. Y. Oudot, P. Skraba. Analysis of scalar fields over point cloud data. Discrete Comput. Geom
2011
Later among the works it cites.
T. K. Dey and Y. Wang. Reeb graphs: approximation and persistence. Proc. 27th Annu. Sympos. Comput. Geom
2011
Later among the works it cites.
J.-D. Boissonnat and C. Maria. The simplex tree : An efficient data structure for general simplicial complexes. Proc. ESA, Lecture Notes in Computer Science
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Adams and G. Carlsson. On the nonlinear statistics of range image patches. SIAM J. Img. Sci
2009
Cited alongside, same era.
J.-D. Boissonnat, L. J. Guibas, and S. Y. Oudot. Manifold reconstruction in arbitrary dimensions using witness complexes. Discrete Comput. Geom
2009
Cited alongside, same era.
H. Edelsbrunner and J. Harer. Computational Topology. American Mathematical Society, 2009
2009
Cited alongside, same era.
D. Sheehy. Linear-Size Approximations to the Vietoris-Rips Filtration. Proc. 28th. Annu. Sympos. Comput. Geom
2012
Later among the works it cites.