Computing optimal homotopies over a spiked plane with polygonal boundary
From MaRDI portal
Publication:5111709
Recommendations
Cites work
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Constructing monotone homotopies and sweepouts
- Converting homotopies to isotopies and dividing homotopies in half in an effective way
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Geodesic Fréchet distance inside a simple polygon
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Measuring similarity between curves on 2-manifolds via homotopy area
- Monotone homotopies and contracting discs on Riemannian surfaces
- Morphing Planar Graph Drawings Efficiently
- Morphing Planar Graph Drawings Optimally
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Submodular percolation
This page was built for publication: Computing optimal homotopies over a spiked plane with polygonal boundary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111709)