Computing area filling contours for surfaces defined by piecewise polynomials
type: Item
instance of: scholarly article
title: Computing area filling contours for surfaces defined by piecewise polynomials
zbMATH Open document ID: 0631.65146
DOI: 10.1016/0167-8396(86)90003-8
author: Albrecht Preusser
published in: Computer Aided Geometric Design
publication date: 1986-01-01T00:00:00Z
review text: Noting that the graphical kernel system allows one to color the interior of a polygon with one command, the author presents a method of polygonal approximation of contour lines (or indeed any curve given by its elevation over the xy plane) with an automatic stepsize control depending on the curvature of the line. The curvature being unavailable in most cases, the author takes a step along the tangent and then along the normal until he reaches the curves by one-dimensional search. The ratio of the two lengths measures the curvature and controls the stepsize.
Mathematics Subject Classification ID: 65S05
Mathematics Subject Classification ID: 65D15
Mathematics Subject Classification ID: 53A05
zbMATH DE Number: 4026782
zbMATH Keywords: computer graphics
zbMATH Keywords: curve and surface representation
zbMATH Keywords: nonlinear methods
zbMATH Keywords: coropleth maps
zbMATH Keywords: fill area command
zbMATH Keywords: contour plotting for finite elements
zbMATH Keywords: graphical kernel system
zbMATH Keywords: contour lines
zbMATH Keywords: automatic stepsize control
zbMATH Keywords: curvature
reviewed by: Heinrich Guggenheimer
describes a project that uses: TRICP
describes a project that uses: Algorithm 624
describes a project that uses: Algorithm 526
describes a project that uses: IMSL Numerical Libraries
MaRDI profile type: Publication
full work available at URL: 0167-8396(86)90003-8
OpenAlex ID: W2044475888
cites work: Q4194442
cites work: Adaptive contouring of three-dimensional surfaces
cites work: A triangle-based \(C^ 1\) interpolation method
description: scientific article; zbMATH DE number 4026782