Detecting and decomposing self-overlapping curves
Computational Geometry: Theory and Applications
Geometric Separator Theorems and Applications
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Edges and switches, tunnels and bridges
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Immersion and embedding of self-crossing loops
Proceedings of the Eighth Eurographics Symposium on Sketch-Based Interfaces and Modeling
Counting hexagonal patches and independent sets in circle graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Sitting closer to friends than enemies, revisited
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Direct rendering of Boolean combinations of self-trimmed surfaces
Computer-Aided Design
Technical note: Self-overlapping curves: Analysis and applications
Computer-Aided Design
| Hi-index | 0.00 |
Let S be a surface embedded in space in such a way that each point has a neighborhood within which the surface is a terrain. Then S projects to an immersed surface in the plane, the boundary of which is a (possibly self-intersecting) curve. Under what circumstances can we reverse these mappings algorithmically? Shor and van Wyk considered one such problem, determining whether a curve is the boundary of an immersed disk; they showed that the self-overlapping curves defined in this way can be recognized in polynomial time. We show that several related problems are more difficult: it is NP-complete to determine whether an immersed disk is the projection of a disk embedded in space, or whether a curve is the boundary of an immersed surface in the plane that is not constrained to be a disk. However, when a casing is supplied with a self-intersecting curve, describing which component of the curve lies above and which below at each crossing, we may determine in time linear in the number of crossings whether the cased curve forms the projected boundary of a surface in space. As a related result, we show that an immersed surface with a single boundary curve that crosses itself n times has at most 2n/2 combinatorially distinct spatial embeddings, and we discuss the existence of fixed-parameter tractable algorithms for related problems.