Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
Ravi Krishna Kolluri, Jonathan Richard Shewchuk, J...
The current paper makes two contributions for the graph pattern matching problem of model transformation tools. First, model-sensitive search plan generation is proposed for patte...
We present a novel approach to the problem of hairstyle construction from raw surface data such as the ones obtained from surface scans. Our approach is based on a shape matching ...
Gerrit Sobottka, Michael Kusak, Andreas Weber 0004
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...