Offsetting operations in solid modelling
Computer Aided Geometric Design
Deformable curve and surface finite-elements for free-form shape design
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Functional optimization for fair surface design
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
r-regular shape reconstruction from unorganized points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
GAPS: general and automatic polygonal simplification
I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Implicit fairing of irregular meshes using diffusion and curvature flow
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Construction of fair surfaces over irregular meshes
Proceedings of the sixth ACM symposium on Solid modeling and applications
Anisotropic diffusion of surfaces and functions on surfaces
ACM Transactions on Graphics (TOG)
Controlled Topology Simplification
IEEE Transactions on Visualization and Computer Graphics
Topology Simplification for Polygonal Virtual Environments
IEEE Transactions on Visualization and Computer Graphics
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
Curve and surface smoothing without shrinkage
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Non-iterative, feature-preserving mesh smoothing
ACM SIGGRAPH 2003 Papers
ACM SIGGRAPH 2003 Papers
Blending and offsetting solid models (cad/cam, computational geometry, representations, curves, surfaces, approximation)
Butterworth Filtering and Implicit Fairing of Irregular Meshes
PG '03 Proceedings of the 11th Pacific Conference on Computer Graphics and Applications
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Extraction of Topologically Simple Isosurfaces from Volume Datasets
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Shape Simplification Based on the Medial Axis Transform
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Mason: morphological simplification
Graphical Models
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Semi-automatic stencil creation through error minimization
NPAR '08 Proceedings of the 6th international symposium on Non-photorealistic animation and rendering
Particle-Based Shape Analysis of Multi-object Complexes
MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
b-morphs between b-compatible curves in the plane
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Particle Based Shape Regression of Open Surfaces with Applications to Developmental Neuroimaging
MICCAI '09 Proceedings of the 12th International Conference on Medical Image Computing and Computer-Assisted Intervention: Part II
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greater than or equal to r and which only differs from S in a morphologically-defined tolerance zone we call the mortar. The mortar consists of the thin or highly curved parts of S, such as corners, gaps, and small connected components, while the boundary of a tightening consists of minimum-length loops through the mortar. Tightenings are defined independently of shape representation, and it may be possible to find them using a variety of algorithms. We describe how to approximately compute tightenings for sets represented as binary images using constrained, level-set curvature flow.