TL;DR
This paper discusses Kapoor's subquadratic algorithm for computing shortest paths on polyhedra, highlighting its efficiency improvements over previous methods.
Contribution
It presents Kapoor's subquadratic algorithm, offering a more efficient approach to shortest path computation on polyhedral surfaces.
Findings
Algorithm operates in subquadratic time
Improves efficiency over previous algorithms
Applicable to complex polyhedral models
Abstract
The subquadratic algorithm of Kapoor for finding shortest paths on a polyhedron is described.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.