Extracting feature lines from 3D unstructured grids
VIS '97 Proceedings of the 8th conference on Visualization '97
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Landmark-based registration using features identified through differential geometry
Handbook of medical imaging
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Pointshop 3D: an interactive system for point-based surface editing
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Computing and Rendering Point Set Surfaces
IEEE Transactions on Visualization and Computer Graphics
Ridges and Ravines on Implicit Surfaces
CGI '98 Proceedings of the Computer Graphics International 1998
A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions
SMI '03 Proceedings of the Shape Modeling International 2003
Ridge-valley lines on meshes via implicit surface fitting
ACM SIGGRAPH 2004 Papers
Highlight lines for conveying shape
Proceedings of the 5th international symposium on Non-photorealistic animation and rendering
Apparent ridges for line drawing
ACM SIGGRAPH 2007 papers
Invariant Crease Lines for Topological and Structural Analysis of Tensor Fields
IEEE Transactions on Visualization and Computer Graphics
Laplacian lines for real-time shape illustration
Proceedings of the 2009 symposium on Interactive 3D graphics and games
3D model feature line stylization using mesh sharpening
Proceedings of the 9th ACM SIGGRAPH Conference on Virtual-Reality Continuum and its Applications in Industry
Feature line extraction from unorganized noisy point clouds using truncated Fourier series
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |
Given an unstructured point set, we use an MLS (moving least-squares) approximation to estimate the local curvatures and their derivatives at a point by means of an approximating surface. Then, we compute neighbor information using a Delaunay tessellation. Ridge and valley points can then be detected as zero-crossings, and connected using curvature directions. We demonstrate our method on several large point-sampled models, rendered by point-splatting, on which the ridge and valley lines are rendered with line width determined from curvatures.