Cycle bases of graphs and sampled manifolds

DOI10.1016/J.CAGD.2006.07.001zbMATH Open1171.65334OpenAlexW2059602875MaRDI QIDQ733440FDOQ733440

Kanela Kaligosi, K. Mehlhorn, Dimitrios Michail, Evangelia Pyrga, Craig Gotsman

Publication date: 16 October 2009

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.9661

Recommendations

• Graph Drawing
• Approximating cycles in a shortest basis of the first homology group from point data
• Minimum cycle and homology bases of surface-embedded graphs
• Minimum cycle and homology bases of surface-embedded graphs
• Minimum Cycle Bases in Graphs Algorithms and Applications

zbMATH Keywords

manifoldcycle basishomology basisnearest neighbor graphnon-trivial and trivial loopssample points

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computer-aided design (modeling of curves and surfaces) (65D17)

Cites Work

• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matrix multiplication via arithmetic progressions
• Parametrization and smooth approximation of surface triangulations
• Computing conformal structures of surfaces
• Improved bounds for planar \(k\)-sets and related problems
• Delaunay graphs are almost as good as complete graphs
• How to Draw a Graph
• Automata, Languages and Programming
• Surface reconstruction by Voronoi filtering
• Title not available (Why is that?)
• Implementing minimum cycle basis algorithms
• Title not available (Why is that?)
• Greedy optimal homotopy and homology generators
• A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
• The power crust, unions of balls, and the medial axis transform
• Discrete one-forms on meshes and applications to 3D mesh parameterization
• New Approximation Algorithms for Minimum Cycle Bases of Graphs
• Meshless parameterization and surface reconstruction
• Computing Betti numbers via combinatorial Laplacians
• Smooth surface reconstruction via natural neighbour interpolation of distance functions
• Title not available (Why is that?)
• Computing homology groups of simplicial complexes in R ³
• Shape dimension and intrinsic metric from samples of manifolds with high co-dimension

Cited In (1)

• Length bounds for cycle bases of graphs

Uses Software

• Powercrust
• SegMatch

This page was built for publication: Cycle bases of graphs and sampled manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733440)