Highlight-line algorithm for realtime surface-quality assessment

DOI10.1016/0010-4485(94)90073-6MaRDI QIDQ1323665zbMATH OpenOpenAlexFDO

Authors Klaus-Peter Beier, Yifan Chen

Publication date 1 June 1994

Published in CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/31671

zbMATH Keywords

highlight-line algorithminteractive surface modelingsurfacevisualization

Mathematics Subject Classification ID

Descriptive geometry (51N05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

Visualization of the three-dimensional features of a surface represented on a two-dimensional screen can be a problem. To assist the viewer in a stereographic understanding, the authors propose to highlight on the curve the points at which light from a fixed source arrives on the normal to the curve, i.e., at which the distance to the lightsource is a local minimum. The formulation of the condition leads to an expression rational in the data of the surface. For quick computation, they propose to use only the numerator of this expression. The resulting algorithm is fast enough on a personal work station to allow about 5 updates per second in interactive surface modeling for a surface given by \(10^ 5\) points.

Recommendations

• A novel approach to surface defect detection
• scientific article; zbMATH DE number 696768
• scientific article; zbMATH DE number 2221434

Cited in

(19)

• Surface drawing made simple - but not too simple
• Direct highlight line modification on NURBS surfaces
• Computing parallel curves on parametric surfaces
• Fair free-form surfaces that are almost everywhere parametrically \(C^2\)
• Refinement of surfaces of industrial objects
• Low degree splines for locally quad-dominant meshes
• Localized G-splines for quad \& T-gon meshes
• Multi-sided completion of \(C^2\) bi-3 and \(C^1\) bi-2 splines: a unifying approach
• Subdivision and G-spline hybrid constructions for high-quality geometric and analysis-suitable surfaces
• Splines for meshes with irregularities
• Removing local irregularities of triangular meshes with highlight line models
• Isogeometric analysis using G-spline surfaces with arbitrary unstructured quadrilateral layout
• Finding lighted surface parts of polygonal surface in parallel light flux
• Real-time interactive visibility computation for quadratic surfaces
• Algorithm 834
• Constructing \(C^{1}\) triangular patch of degree six by the Boolean sum of an approximation operator and an interpolation operator
• Algorithm 1032: bi-cubic splines for polyhedral control nets
• Localized `2-4-3' conversion of bi-2 C^1 splines to bi-3 C^2 splines
• Solving elliptic partial differential equations on free-form spline surfaces with a polyhedral control net

This page was built for publication: Highlight-line algorithm for realtime surface-quality assessment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323665)