The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
COMPUTATIONAL GEOMETRY COLUMN 35
Abstract
The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Mitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H. (1987) · SIAM Journal on Computing · doi:10.1137/0216045 · Cited by 720
New lower bound techniques for robot motion planning problems
Canny, J., & Reif, J. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.42 · Cited by 538
Shortest paths on a polyhedron
Chen, J., & Han, Y. (1990) · Proceedings of the sixth annual symposium on Computational geometry - SCG '90 · doi:10.1145/98524.98601 · Cited by 301
Efficient computation of geodesic shortest paths
Kapoor, S. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301449 · Cited by 110
Shortest paths on polyhedral surfaces
O’Rourke, J., Suri, S., & Booth, H. (2005) · Springer eBooks · doi:10.1007/bfb0024013 · Cited by 45
Self-citation(2004) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035315-27 · Cited by 20
Cited by
Situating the default-mode network along a principal gradient of macroscale cortical organization
Margulies, D. S., Ghosh, S. S., Goulas, A., Falkiewicz, M., Huntenburg, J. M., Langs, G., Bezgin, G., Eickhoff, S. B., Castellanos, F. X., Petrides, M., et al. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1608282113 · Cited by 2,321
Bi, Q., Huang, N., Zhang, S., Shuai, C., & Wang, Y. (2018) · International Journal of Machine Tools and Manufacture · doi:10.1016/j.ijmachtools.2018.09.001 · Cited by 92
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions
Schreiber, Y., & Sharir, M. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-9031-0 · Cited by 51
Exact Geodesics and Shortest Paths on Polyhedral Surfaces
Balasubramanian, M., Polimeni, J. R., & Schwartz, E. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.213 · Cited by 45
The convex wrapping algorithm: A method for identifying muscle paths using the underlying bone mesh
Desailly, É., Sardain, P., Khouri, N., Yepremian, D., & Lacouture, P. (2010) · Journal of Biomechanics · doi:10.1016/j.jbiomech.2010.05.005 · Cited by 33
Metadata
- Authors
- O'ROURKE, J.
- Affiliations
- Department of Computer Science, Smith College, Northampton, MA 01063, USA
- Venue
- International Journal of Computational Geometry & Applications
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 1999-08
- Volume
- 09
- Issue
- 04n05
- Pages
- 513-515
- ISSN
- 0218-1959 (ISSN-L)
- 1793-6357
- OpenAlex
- W2085958217
- Cited by
- 9
- References
- 6
- Citations by year
- 2018: 1 · 2016: 3
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- International Journal of Computational Geometry & Applications (publishedVersion)
- Smith ScholarWorks (Smith College) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Keywords
- subquadratic algorithms, computational geometry algorithms, polyhedral surfaces
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: COMPUTATIONAL GEOMETRY COLUMN 35. https://app.cochat.ai/papers/10.1142/s0218195999000297
- The paper
- O'ROURKE, J. (1999). COMPUTATIONAL GEOMETRY COLUMN 35. International Journal of Computational Geometry & Applications. https://doi.org/10.1142/s0218195999000297
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.