Computing optimal homotopies over a spiked plane with polygonal boundary
From MaRDI portal
Publication:5111709
DOI10.4230/LIPICS.ESA.2017.23zbMATH Open1442.68250OpenAlexW2759041652MaRDI QIDQ5111709FDOQ5111709
Bettina Speckmann, Wouter Meulemans, Benjamin A. Burton, Tim Ophelders, Marc Van Kreveld, Erin W. Chambers
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/lipics.esa.2017.23
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Optimal homologous cycles, total unimodularity, and linear programming
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Morphing Planar Graph Drawings Optimally
- Morphing Planar Graph Drawings Efficiently
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Title not available (Why is that?)
- Converting homotopies to isotopies and dividing homotopies in half in an effective way
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Constructing monotone homotopies and sweepouts
- Submodular Percolation
- Monotone homotopies and contracting discs on Riemannian surfaces
- Measuring similarity between curves on 2-manifolds via homotopy area
Cited In (1)
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)
