Detecting and decomposing self-overlapping curves
From MaRDI portal
Publication:1200911
DOI10.1016/0925-7721(92)90019-OzbMath0760.68086OpenAlexW2208980434MaRDI QIDQ1200911
Christopher J. Van Wyk, Peter W. Shor
Publication date: 16 January 1993
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(92)90019-o
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Differential geometry of immersions (minimal, prescribed curvature, tight, etc.) (53C42)
Related Items (5)
Combinatorial properties of self-overlapping curves and interior boundaries ⋮ From curves to words and back again: geometric computation of minimum-area homotopy ⋮ Counting hexagonal patches and independent sets in circle graphs ⋮ Detecting and decomposing self-overlapping curves ⋮ An isoperimetric inequality in the universal cover of the punctured plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differentiable approximations to light interior transformations
- The combinatorial topology of analytic functions on the boundary of a disk
- Generalized Delaunay triangulation for planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Detecting and decomposing self-overlapping curves
- Extensions of Normal Immersions of S 1 into R 2
- The Folded Ribbon Theorem. A Contribution to the Study of Immersed Circles
This page was built for publication: Detecting and decomposing self-overlapping curves