Computing Minimum Area Homologies
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2014/11/17
-
Journal
-
Indian UGC (journal)
-
Refrences38
-
Citations4
-
Erin Wolf Chambers Department of Math and Computer Science Saint Louis University Saint Louis MO USA
-
Mikael Vejdemo‐Johansson Institute for Mathematics and its Applications University of Minnesota Minneapolis MN USAComputer Vision and Active Perception Laboratory KTH Royal Institute of Technology Stockholm SwedenAI Laboratory Jozef Stefan Institute Ljubljana Slovenia
Abstract
Cite
Chambers, Erin Wolf, and Mikael Vejdemo‐Johansson. “Computing Minimum Area Homologies”. Computer Graphics Forum, vol. 34, no. 6, 2014, pp. 13-21, https://doi.org/10.1111/cgf.12514.
Chambers, E. W., & Vejdemo‐Johansson, M. (2014). Computing Minimum Area Homologies. Computer Graphics Forum, 34(6), 13-21. https://doi.org/10.1111/cgf.12514
Chambers, Erin Wolf, and Mikael Vejdemo‐Johansson. “Computing Minimum Area Homologies”. Computer Graphics Forum 34, no. 6 (2014): 13-21. https://doi.org/10.1111/cgf.12514.
Chambers EW, Vejdemo‐Johansson M. Computing Minimum Area Homologies. Computer Graphics Forum. 2014;34(6):13-21.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
You May Also Like
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Mappings that minimize area in their homotopy classes | Journal of Differential Geometry |
| 11 | 1984 |
| Efficient implementation of the K‐SVD algorithm using batch orthogonal matching pursuit | 2008 | |||
| Scikit‐learn: Machine learning in Python | Journal of Machine Learning Research |
| 2011 | |
| A survey of cobordism theory | 2007 | |||
| The index of elliptic operators on compact | 1971 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| The parameterized complexity of finding minimum bounded chains | Computational Geometry |
| 2024 | |
| Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations | Discrete & Computational Geometry |
| 2022 | |
Surface Map Homology Inference | Computer Graphics Forum |
| 3 | 2021 |
An algorithm for calculating top-dimensional bounding chains | PeerJ Computer Science |
| 2 | 2018 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 3
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled An algorithm for calculating top-dimensional bounding chains and was published in 2018. The most recent citation comes from a 2024 study titled The parameterized complexity of finding minimum bounded chains. This article reached its peak citation in 2024, with 1 citations. It has been cited in 4 different journals, 25% of which are open access. Among related journals, the Computational Geometry cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.