A genus oblivious approach to cross parameterization
Computer Aided Geometric Design
Approximating nearest neighbor among triangles in convex position
Information Processing Letters
Computing Elevation Maxima by Searching the Gauss Sphere
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Measuring and computing natural generators for homology groups
Computational Geometry: Theory and Applications
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
International Journal of Computer Vision
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Computing elevation maxima by searching the gauss sphere
Journal of Experimental Algorithmics (JEA)
A point calculus for interlevel set homology
Pattern Recognition Letters
Failure filtrations for fenced sensor networks
International Journal of Robotics Research
Technical Section: Topological saliency
Computers and Graphics
Hi-index | 0.01 |
Given a smoothly embedded 2-manifold in ${\Bbb R}^3,$ we define the elevation of a point as the height difference to a canonically defined second point on the same manifold. Our definition is invariant under rigid motions and can be used to define features such as lines of discontinuous or continuous but non-smooth elevation. We give an algorithm for finding points of locally maximum elevation, which we suggest mark cavities and protrusions and are useful in matching shapes as for example in protein docking.