Holes and dependences in an ordered complex

DOI10.1016/J.CAGD.2019.06.003zbMATH Open1505.65054OpenAlexW2951711467WikidataQ127654299 ScholiaQ127654299MaRDI QIDQ2010322FDOQ2010322

Authors: Katharina Ölsböck, Herbert Edelsbrunner 

Publication date: 27 November 2019

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

Full work available at URL: https://doi.org/10.1016/j.cagd.2019.06.003

Recommendations

• Opening holes in discrete objects with digital homotopy
• A three-dimensional holes closing algorithm
• Towards minimal barcodes
• Tri-partitions and bases of an ordered complex
• Topological persistence and simplification

zbMATH Keywords

computational topologycomputational experimentsshape reconstructionalpha shapespersistence diagramsbases in homology and cohomology

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17) Applications of general topology to computer science (e.g., digital topology, image processing) (54H30)

Cites Work

• Computational topology. An introduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
• Three-dimensional alpha shapes
• On the Principal Edge Tripartition of a Graph
• Title not available (Why is that?)
• Computing linking numbers of a filtration

Cited In (1)

• Tri-partitions and bases of an ordered complex

Uses Software

• CGAL

This page was built for publication: Holes and dependences in an ordered complex

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