Data structures and network algorithms
Data structures and network algorithms
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Molecular shape analysis based upon the morse-smale complex and the connolly function
Proceedings of the nineteenth annual symposium on Computational geometry
Morse-smale complexes for piecewise linear 3-manifolds
Proceedings of the nineteenth annual symposium on Computational geometry
Loops in Reeb Graphs of 2-Manifolds
Discrete & Computational Geometry
Local and Global Comparison of Continuous Functions
VIS '04 Proceedings of the conference on Visualization '04
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Vines and vineyards by updating persistence in linear time
Proceedings of the twenty-second annual symposium on Computational geometry
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Automatic extraction of surface structures in digital shape reconstruction
Computer-Aided Design
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Modeling time and topology for animation and visualization with examples on parametric geometry
Theoretical Computer Science
Interaction interfaces in proteins via the Voronoi diagram of atoms
Computer-Aided Design
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Protein-ligand docking based on beta-shape
Transactions on computational science IX
Protein-ligand docking based on beta-shape
Transactions on computational science IX
Segmenting motifs in protein-protein interface surfaces
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Automatic extraction of surface structures in digital shape reconstruction
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Towards unsupervised segmentation of semi-rigid low-resolution molecular surfaces
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
| Hi-index | 0.00 |
Given a smoothly embedded 2-manifold in ℝ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.