The DOI matches its Crossref record.
Finding shortest paths on surfaces using level sets propagation
Abstract
We present a new algorithm for determining minimal length paths between two regions on a three dimensional surface. The numerical implementation is based on finding equal geodesic distance contours from a given area. These contours are calculated as zero sets of a bivariate function designed to evolve so as to track the equal distance curves on the given surface. The algorithm produces all paths of minimal length between the source and destination areas on the surface given as height values on a rectangular grid.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Distance Regularized Level Set Evolution and Its Application to Image Segmentation
Li, C., Xu, C., Gui, C., & Fox, M. D. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2069690 · Cited by 2,106
Minimization of Region-Scalable Fitting Energy for Image Segmentation
Li, C., Kao, C.-Y., Gore, J. C., & Ding, Z. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2002304 · Cited by 1,721
Li, C., Huang, R., Ding, Z., Gatenby, J. C., Metaxas, D. N., & Gore, J. C. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2146190 · Cited by 1,285
Caselles, V., Kimmel, R., & Sapiro, G. (2002) · Proceedings of IEEE International Conference on Computer Vision · doi:10.1109/iccv.1995.466871 · Cited by 1,161
Self-citationActive contours driven by local Gaussian distribution fitting energy
Wang, L., He, L., Mishra, A., & Li, C. (2009) · Signal Processing · doi:10.1016/j.sigpro.2009.03.014 · Cited by 466
Metadata
- Authors
- Kimmel, R., Amir, A., & Bruckstein, A. M.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995-06
- Volume
- 17
- Issue
- 6
- Pages
- 635-640
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2148875485
- Cited by
- 231
- References
- 0
- FWCI
- 7.69
- 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: Finding shortest paths on surfaces using level sets propagation. https://app.cochat.ai/papers/10.1109/34.387512
- The paper
- Kimmel, R., Amir, A., & Bruckstein, A. M. (1995). Finding shortest paths on surfaces using level sets propagation. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.387512
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.