Contour tracing by piecewise linear approximations
- 1 October 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 9 (4) , 389-423
- https://doi.org/10.1145/88560.88575
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.Keywords
This publication has 13 references indexed in Scilit:
- Quasiperiodic patterns and icosahedral symmetryJournal de Physique, 1986
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined ManifoldSIAM Journal on Numerical Analysis, 1985
- Complex analytic dynamics on the Riemann sphereBulletin of the American Mathematical Society, 1984
- Solid Modeling: Current Status and Research DirectionsIEEE Computer Graphics and Applications, 1983
- Topologically reliable display of algebraic curvesACM SIGGRAPH Computer Graphics, 1983
- Fast quantizing and decoding and algorithms for lattice quantizers and codesIEEE Transactions on Information Theory, 1982
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of EquationsSIAM Review, 1980
- The Approximation of Fixed Points of a Continuous MappingSIAM Journal on Applied Mathematics, 1967
- Discrete Groups Generated by ReflectionsAnnals of Mathematics, 1934
- Neuer beweis für die invarianz der dimensionszahl und des gebietesAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1928