\(r\)-regular shape reconstruction from unorganized points

DOI10.1016/S0925-7721(98)00013-3zbMath0904.68172MaRDI QIDQ1265284

Dominique Attali

Publication date: 28 September 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

shape reconstructionDelaunay graphnormalized mesh

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS ⋮ Optimal reconstruction might be hard ⋮ Defective point data reconstruction based on improved process of morphological operations ⋮ Efficient generation of simple polygons for characterizing the shape of a set of points in the plane ⋮ Smoothness of boundaries of regular sets ⋮ Reconstructing curves with sharp corners ⋮ Regular and non-regular point sets: Properties and reconstruction ⋮ The power crust, unions of balls, and the medial axis transform ⋮ Natural neighbor coordinates of points on a surface ⋮ Surface reconstruction using umbrella filters ⋮ \(r\)-regularity ⋮ Intelligent Solutions for Curve Reconstruction Problem ⋮ Strong thinning and polyhedric approximation of the surface of a voxel object ⋮ Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited ⋮ Smooth surface reconstruction via natural neighbour interpolation of distance functions

Cites Work

• Unnamed Item
• Minimal roughness property of the Delaunay triangulation
• On the shape of a set of points in the plane
• Connect-the-dots: A new heuristic
• Three-dimensional alpha shapes

This page was built for publication: \(r\)-regular shape reconstruction from unorganized points