Parallel algorithms for approximation of distance maps on parametric surfaces
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We present an efficient O( n ) numerical algorithm for first-order approximation of geodesic distances on geometry images, where n is the number of points on the surface. The structure of our algorithm allows efficient implementation on parallel architectures. Two implementations on a SIMD processor and on a GPU are discussed. Numerical results demonstrate up to four orders of magnitude improvement in execution time compared to the state-of-the-art algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H. (1987) · SIAM Journal on Computing · doi:10.1137/0216045 · Cited by 720
Cited by
EpicFlow: Edge-preserving interpolation of correspondences for optical flow
Revaud, J., Weinzaepfel, P., Harchaoui, Z., & Schmid, C. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298720 · Cited by 697
Geodesics in heat: A new approach to computing distance based on heat flow
Crane, K., Weischedel, C., & Wardetzky, M. (2013) · ACM Transactions on Graphics · doi:10.1145/2516971.2516977 · Cited by 297
Bronstein, A. M., Bronstein, M. M., Kimmel, R., Mahmoudi, M., & Sapiro, G. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0301-6 · Cited by 267
Self-citationParallel Multi-Dimensional LSTM, With Application to Fast Biomedical Volumetric Image Segmentation
Stollenga, M. F., Byeon, W., Liwicki, M., & Schmidhuber, J. (2015) · arXiv · doi:10.48550/arxiv.1506.07452 · Cited by 244
“A similar connection strategy has been previously used to speed up non-Euclidian distance computations on surfaces [14].”
MethodMinimum-Distortion Isometric Shape Correspondence Using EM Algorithm
Sahillioglu, Y., & Yemez, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.26 · Cited by 53
“This suggests that our shape correspondence method can be made even more efficient by using faster geodesics computation algorithms such as the one in [43].”
Method
Metadata
- Authors
- Weber, O., Devir, Y. S., Bronstein, A. M., Bronstein, M. M., & Kimmel, R.
- Venue
- ACM Transactions on Graphics
- Published
- 2008-10
- Volume
- 27
- Issue
- 4
- Pages
- 1-16
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2141409037
- Cited by
- 147
- References
- 1
- FWCI
- 40.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Parallel algorithms for approximation of distance maps on parametric surfaces. https://app.cochat.ai/papers/10.1145/1409625.1409626
- The paper
- Weber, O., Devir, Y. S., Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2008). Parallel algorithms for approximation of distance maps on parametric surfaces. ACM Transactions on Graphics. https://doi.org/10.1145/1409625.1409626
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.