Multi-region Delaunay complex segmentation
From MaRDI portal
Publication:2443059
DOI10.1016/j.cagd.2012.03.016zbMath1285.68203OpenAlexW2131156021MaRDI QIDQ2443059
Publication date: 4 April 2014
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2012.03.016
Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computer-aided design (modeling of curves and surfaces) (65D17)
Uses Software
Cites Work
- Unnamed Item
- On the definition and the construction of pockets in macromolecules
- Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty
- Surface reconstruction by Voronoi filtering
- A simple algorithm for homeomorphic surface reconstruction
- Complexity of the delaunay triangulation of points on surfaces the smooth case
- Provable surface reconstruction from noisy samples
This page was built for publication: Multi-region Delaunay complex segmentation