Contour tracing by piecewise linear approximations

  • Authors:
  • David P. Dobkin;Allan R. Wilks;Silvio V. F. Levy;William P. Thurston

  • Affiliations:
  • Princeton Univ., Princeton, NJ;AT&T Bell Labs, Murray Hill, NJ;Princeton Univ., Princeton, NJ;Princeton Univ., Princeton, NJ

  • Venue:
  • ACM Transactions on Graphics (TOG)
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a method for tracing a curve that is represented as the contour of a function in Euclidean space of any dimension. The method proceeds locally by following the intersections of the contour with the facets of a triangulation of space. The algorithm does not fail in the presence of high curvature of the contour; it accumulates essentially no round-off error and has a well-defined integer test for detecting a loop. In developing the algorithm, we explore the nature of a particular class of triangulations of Euclidean space, namely, those generated by reflections.