Detecting and decomposing self-overlapping curves
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3481526 (Why is no real title available?)
- scientific article; zbMATH DE number 3228674 (Why is no real title available?)
- scientific article; zbMATH DE number 3354296 (Why is no real title available?)
- Detecting and decomposing self-overlapping curves
- Differentiable approximations to light interior transformations
- Extensions of Normal Immersions of S 1 into R 2
- Generalized Delaunay triangulation for planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- The Folded Ribbon Theorem. A Contribution to the Study of Immersed Circles
- The combinatorial topology of analytic functions on the boundary of a disk
Cited in
(10)- Detecting regions with undesirable curvature
- From curves to words and back again: geometric computation of minimum-area homotopy
- Self-overlapping curves revisited
- A general method for decomposing self-intersecting polygon to normal based on self-intersection points
- Cusps of Characteristic Curves and Intersection-Aware Visualization of Path and Streak Lines
- An isoperimetric inequality in the universal cover of the punctured plane
- Detecting and decomposing self-overlapping curves
- Counting hexagonal patches and independent sets in circle graphs
- Selfintersection of composite curves and surfaces
- Combinatorial properties of self-overlapping curves and interior boundaries
This page was built for publication: Detecting and decomposing self-overlapping curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200911)