Smoothing polyhedra made easy
- 1 April 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 14 (2) , 162-170
- https://doi.org/10.1145/221659.221670
Abstract
A mesh of points outlining a surface is polyhedral if all cells are either quadrilateralor planar. A mesh is vertex-degree bounded, if at most four cells meet at every vertex.This paper shows that if a mesh has both properties then simple averaging of its pointsyields the Bernstein-B'ezier coefficients of a smooth, at most cubic surface that consistsof twice as many three-sided polynomial pieces as there are interior edges in the mesh.Meshes with checker board structure, i.e. rectilinear...Keywords
This publication has 6 references indexed in Scilit:
- $C^1 $-Surface SplinesSIAM Journal on Numerical Analysis, 1995
- Smooth free-form surfaces over irregular meshes generalizing quadratic splinesComputer Aided Geometric Design, 1993
- Box SplinesPublished by Springer Nature ,1993
- Smooth interpolation of a mesh of curvesConstructive Approximation, 1991
- Closed smooth piecewise bicubic surfacesACM Transactions on Graphics, 1991
- Local surface interpolation with Bézier patches: errata and improvementsComputer Aided Geometric Design, 1991