Detecting and decomposing self-overlapping curves

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Paint one side of a rubber disk black and the other side white: stretch the disk any way you wish in three-dimensional space, subject to the condition that from any point in space, if you look down you see either the white side of the disk or nothing at all. Now make the stretched disk transparent but color its boundary black project its boundary into a plane that lies below the disk. The resulting curve is self-overlapping. We show how to test whether a given curve is self-overlapping, and how to count how many essentially different stretchings of the disk could give rise to the same curve.

Cite

CITATION STYLE

APA

Shor, P. W., & Van Wyk, C. J. (1989). Detecting and decomposing self-overlapping curves. In Proceedings of the Annual Symposium on Computational Geometry (Vol. Part F130124, pp. 44–50). Association for Computing Machinery. https://doi.org/10.1145/73833.73838

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free