Regular and non-regular point sets: Properties and reconstruction

DOI10.1016/S0925-7721(01)00016-5zbMath0990.65024OpenAlexW1990934335WikidataQ126803487 ScholiaQ126803487MaRDI QIDQ5946436

Sylvain Petitjean, Edmond Boyer

Publication date: 14 October 2001

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00016-5

zbMATH Keywords

complexityadvancing-front techniquescurve and surface reconstructionregular interpolantsampling conditionsubdivision algorithmstest examples

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Complexity and performance of numerical algorithms (65Y20) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (4)

Discrete curvatures for planar curves based on Archimedes' duality principle ⋮ Quasi-isometric mesh movement and deformation with geometrically adaptive metric ⋮ Anisotropic adaptation of moving unstructured mesh to bodies of complex shapes described by an interpolation octree ⋮ Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(r\)-regular shape reconstruction from unorganized points
• Surface reconstruction by Voronoi filtering
• Multidimensional binary search trees used for associative searching
• Three-dimensional alpha shapes
• Implicit and Nonparametric Shape Reconstruction from Unorganized Data Using a Variational Level Set Method
• Boundaries through Scattered Points of Unknown Density
• Accurate and efficient unions of balls
• A simple algorithm for homeomorphic surface reconstruction
• Smooth surface reconstruction via natural neighbour interpolation of distance functions

This page was built for publication: Regular and non-regular point sets: Properties and reconstruction