Cycle bases of graphs and sampled manifolds
From MaRDI portal
Publication:733440
DOI10.1016/j.cagd.2006.07.001zbMath1171.65334OpenAlexW2059602875MaRDI QIDQ733440
Kanela Kaligosi, Kurt 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
Computer science aspects of computer-aided design (68U07) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Delaunay graphs are almost as good as complete graphs
- Matrix multiplication via arithmetic progressions
- Improved bounds for planar \(k\)-sets and related problems
- Parametrization and smooth approximation of surface triangulations
- Computing Betti numbers via combinatorial Laplacians
- Surface reconstruction by Voronoi filtering
- Computing conformal structures of surfaces
- Discrete one-forms on meshes and applications to 3D mesh parameterization
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- Computing homology groups of simplicial complexes in R 3
- A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
- Smooth surface reconstruction via natural neighbour interpolation of distance functions
- Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
- Automata, Languages and Programming
- How to Draw a Graph
- Meshless parameterization and surface reconstruction
- The power crust, unions of balls, and the medial axis transform
This page was built for publication: Cycle bases of graphs and sampled manifolds
