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.
Original language | English (US) |
---|---|
Pages (from-to) | 389-423 |
Number of pages | 35 |
Journal | ACM Transactions on Graphics (TOG) |
Volume | 9 |
Issue number | 4 |
DOIs | |
State | Published - Jan 10 1990 |
All Science Journal Classification (ASJC) codes
- Computer Graphics and Computer-Aided Design