Cycle bases of graphs and sampled manifolds

DOI10.1016/J.CAGD.2006.07.001MaRDI QIDQ733440zbMATH OpenOpenAlexFDO

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

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

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)

Recommendations

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

Cites work

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

Cited in

(1)

• Length bounds for cycle bases of graphs

Describes a project that uses

Uses Software

• SegMatch
• Powercrust

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)