Fetching the paper…
Reading the bibliography…
Many computational algorithms applied to geometry operate on discrete representations of shape.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava. 2011 · 1926
Earlier work this paper cites.
Harmonische funktionen und randwertaufgaben in einem komplex
Beno Eckmann. 1944 · 1944
Earlier work this paper cites.
Full-range approximation of triangulated polyhedra.. In Computer Graphics Forum , Vol. 15. Wiley Online Library, 67–76
Rémi Ronfard and Jarek Rossignac. 1996 · 1996
Earlier work this paper cites.
Surface simplification using quadric error metrics. In Proceedings of the 24th annual conference on Computer graphics and interactive techniques . 209–216
Michael Garland and Paul S Heckbert. 1997 · 1997
Earlier work this paper cites.
The Laplacian on a Riemannian manifold: an introduction to analysis on manifolds
Steven Rosenberg and Rosenberg Steven. 1997 · 1997
Earlier work this paper cites.
Topology preserving edge contraction. In Publ. Inst. Math.(Beograd)(NS . Citeseer
Tamal K Dey, Herbert Edelsbrunner, Sumanta Guha, and Dmitry V Nekhayev. 1998 · 1998
Earlier work this paper cites.
Spectral Graph Theory
F R K Chung. 1999 · 1999
Earlier work this paper cites.
Tetfusion: an algorithm for rapid tetrahedral mesh simplification. In IEEE Visualization, 2002. VIS 2002. IEEE, 133–140
Prashant Chopra and Joerg Meyer. 2002 · 2002
Earlier work this paper cites.
Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies
Yi-Jen Chiang and Xiang Lu. 2003 · 2003
Earlier work this paper cites.
Laplacian surface editing. In Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing . 175–184
Olga Sorkine, Daniel Cohen-Or, Yaron Lipman, Marc Alexa, Christian Rössl, and H-P Seidel. 2004 · 2004
Earlier work this paper cites.
Discrete exterior calculus
Mathieu Desbrun, Anil N Hirani, Melvin Leok, and Jerrold E Marsden. 2005 · 2005
Earlier work this paper cites.
Streaming Simplification of Tetrahedral Meshes
Huy T. Vo, Steven P. Callahan, Peter Lindstrom, Valerio Pascucci, and Claudio T. Silva. 2007 · 2007
Earlier work this paper cites.
Fast mesh segmentation using random walks. In Proceedings of the 2008 ACM symposium on Solid and physical modeling . 183–191
Yu-Kun Lai, Shi-Min Hu, Ralph R Martin, and Paul L Rosin. 2008 · 2008
Earlier work this paper cites.
Spectral methods for graph clustering–a survey
Maria CV Nascimento and Andre CPLF De Carvalho. 2011 · 2011
Earlier work this paper cites.
Fluid Simulation Using Laplacian Eigenfunctions
Tyler De Witt, Christian Lessig, and Eugene Fiume. 2012 · 2012
Earlier work this paper cites.
Digital geometry processing with discrete exterior calculus
Keenan Crane, Fernando De Goes, Mathieu Desbrun, and Peter Schröder. 2013 · 2013
Earlier work this paper cites.
Spectra of combinatorial Laplace operators on simplicial complexes
Danijela Horak and Jürgen Jost. 2013 · 2013
Earlier work this paper cites.
Consistent volumetric discretizations inside self-intersecting surfaces. In Computer Graphics Forum , Vol. 32. Wiley Online Library, 147–156
Leonardo Sacht, Alec Jacobson, Daniele Panozzo, Christian Schüller, and Olga Sorkine-Hornung. 2013 · 2013
Earlier work this paper cites.
Simplifying the homology of networks via strong collapses. In 2013 IEEE International Conference on Acoustics, Speech and Signal Processing . IEEE, 5258–5262
Adam C Wilkerson, Terrence J Moore, Ananthram Swami, and Hamid Krim. 2013 · 2013
Earlier work this paper cites.
Model-reduced variational fluid simulation
Beibei Liu, Gemma Mason, Julian Hodgson, Yiying Tong, and Mathieu Desbrun. 2015 · 2015
Cited alongside, same era.
GUDHI User and Reference Manual
The GUDHI Project. 2015 · 2015
Cited alongside, same era.
Vector Field Processing on Triangle Meshes. In ACM SIGGRAPH 2016 Courses (Anaheim, California) (SIGGRAPH ’16) . Association for Computing Machinery, New York, NY, USA, Article 27, 49 pages
Fernando de Goes, Mathieu Desbrun, and Yiying Tong. 2016 · 2016
Cited alongside, same era.
The Hodge-Laplacian: Boundary Value Problems on Riemannian Manifolds
Dorina Mitrea. 2016 · 2016
Cited alongside, same era.
Boundary-aware Hodge decompositions for piecewise constant vector fields
Konstantin Poelke and Konrad Polthier. 2016 · 2016
Cited alongside, same era.
Directional Field Synthesis, Design, and Processing
Chordal Decomposition for Spectral Coarsening
Honglin Chen, Hsueh-TI Derek Liu, Alec Jacobson, and David I. W. Levin. 2020 · 2020
Later among the works it cites.
Stefania Ebli, Michaël Defferrard, and Gard Spreemann. 2020 · 2020
Later among the works it cites.
Surface remeshing: A systematic literature review of methods and research directions
Dawar Khan, Alexander Plopski, Yuichiro Fujimoto, Masayuki Kanbara, Gul Jabeen, Yongjie Jessica Zhang, Xiaopeng Zhang, and Hirokazu Kato. 2020 · 2020
Later among the works it cites.
Meshwalker: Deep mesh understanding by random walks
Alon Lahav and Ayellet Tal. 2020 · 2020
Later among the works it cites.
Spectral mesh simplification. In Computer Graphics Forum , Vol. 39. Wiley Online Library, 315–324
Thibault Lescoat, Hsueh-Ti Derek Liu, Jean-Marc Thiery, Alec Jacobson, Tamy Boubekeur, and Maks Ovsjanikov. 2020 · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Amir Vaxman, Marcel Campen, Olga Diamanti, Daniele Panozzo, David Bommes, Klaus Hildebrandt, and Mirela Ben-Chen. 2016 · 2016
Cited alongside, same era.
Towards spectral sparsification of simplicial complexes based on generalized effective resistance
Braxton Osting, Sourabh Palande, and Bei Wang. 2017 · 2017
Cited alongside, same era.
Partial functional correspondence. In Computer graphics forum , Vol. 36. Wiley Online Library, 222–236
Emanuele Rodolà, Luca Cosmo, Michael M Bronstein, Andrea Torsello, and Daniel Cremers. 2017 · 2017
Cited alongside, same era.
Computing Persistent Homology of Flag Complexes via Strong Collapses. In SoCG 2019-International Symposium on Computational geometry
Jean-Daniel Boissonnat and Siddharth Pritam. 2019 · 2019
Cited alongside, same era.
Laplace–beltrami operator on digital surfaces
Thomas Caissard, David Coeurjolly, Jacques-Olivier Lachaud, and Tristan Roussillon. 2019 · 2019
Cited alongside, same era.
A notion of harmonic clustering in simplicial complexes. In 2019 18th IEEE International Conference On Machine Learning And Applications (ICMLA) . IEEE, 1083–1090
Stefania Ebli and Gard Spreemann. 2019 · 2019
Cited alongside, same era.
Toward a spectral theory of cellular sheaves
Jakob Hansen and Robert Ghrist. 2019 · 2019
Cited alongside, same era.
Hodge Laplacians on graphs
Lek-Heng Lim. 2020 · 2020
Later among the works it cites.
Random walks on simplicial complexes and the normalized hodge 1-laplacian
Michael T Schaub, Austin R Benson, Paul Horn, Gabor Lippner, and Ali Jadbabaie. 2020 · 2020
Later among the works it cites.
A laplacian for nonmanifold triangle meshes. In Computer Graphics Forum , Vol. 39. Wiley Online Library, 69–80
Nicholas Sharp and Keenan Crane. 2020 · 2020
Later among the works it cites.
Simplicial complexes: higher-order spectral dimension and dynamics
Joaquín J Torres and Ginestra Bianconi. 2020 · 2020
Later among the works it cites.
Discrete Laplace operators
Max Wardetzky. 2020 · 2020
Later among the works it cites.
Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 212) , Hee-Kap Ahn and Kunihiko Sadakane (Eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 31:1–31:27
Mitchell Black and William Maxwell. 2021 · 2021
Later among the works it cites.
The Diamond Laplace for Polygonal and Polyhedral Meshes
A. Bunge, M. Botsch, and M. Alexa. 2021 · 2021
Later among the works it cites.
Helmholtzian Eigenmap: Topological feature discovery & edge flow learning from point cloud data
Yu-Chia Chen, Marina Meilă, and Ioannis G Kevrekidis. 2021 · 2021
Later among the works it cites.
HodgeNet: learning spectral geometry on triangle meshes
Dmitriy Smirnov and Justin Solomon. 2021 · 2021
Later among the works it cites.
A Comprehensive Survey on Community Detection With Deep Learning
Xing Su, Shan Xue, Fanzhen Liu, Jia Wu, Jian Yang, Chuan Zhou, Wenbin Hu, Cecile Paris, Surya Nepal, Di Jin, Quan Z. Sheng, and Philip S. Yu. 2022 · 2021
Later among the works it cites.
Graph coarsening: from scientific computing to machine learning
Jie Chen, Yousef Saad, and Zechen Zhang. 2022 · 2022
Closest in time.
Swap, Shift and Trim to Edge Collapse a Filtration
Marc Glisse and Siddharth Pritam. 2022 · 2022
Closest in time.
Dist2Cycle: A Simplicial Neural Network for Homology Localization. In 36th AAAI Conference on Artificial Intelligence
Alexandros Keros, Vidit Nanda, and Kartic Subr. 2022 · 2022
Closest in time.
Balanced Hodge Laplacians optimize consensus dynamics over simplicial complexes
Cameron Ziegler, Per Sebastian Skardal, Haimonti Dutta, and Dane Taylor. 2022 · 2022
Closest in time.