Detecting and decomposing self-overlapping curves

Authors:
P. W. Shor;C. J. van Wyk
Affiliations:
AT&T Bell Laboratories Murray Hill, New Jersey;AT&T Bell Laboratories Murray Hill, New Jersey
Venue:
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Year:
1989

Citing 1
Cited 1

Small sets supporting fary embeddings of planar graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Consistent volumetric discretizations inside self-intersecting surfaces

SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing

Quantified Score

Hi-index	0.01

Visualization

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.