Grid peeling and the affine curve-shortening flow
DOI10.1137/1.9781611975055.10zbMath1430.68368arXiv1710.03960OpenAlexW4246176752WikidataQ129764362 ScholiaQ129764362MaRDI QIDQ5232728
Gabriel Nivasch, David Eppstein, Sariel Har-Peled
Publication date: 12 September 2019
Published in: Experimental Mathematics, 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.03960
integer gridcurve-shortening flowaffine curve-shortening flowconvex-layer decompositiononion decomposition
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattice points in specified regions (11P21) Convex sets in (2) dimensions (including convex curves) (52A10) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Geometric evolution equations (53E99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of compact convex ancient solutions of the planar affine normal flow
- A linear time algorithm for the Hausdorff distance between convex polygons
- Output-sensitive peeling of convex and maximal layers
- The power of geometric duality
- Another efficient algorithm for convex hulls in two dimensions
- Axioms and fundamental equations of image processing
- Geometric curve evolution and image processing
- Classifying convex compact ancient solutions to the affine curve shortening flow
- Peeling the Grid
- On the convex layers of a planar set
- On the affine heat equation for non-convex curves
- Counting the onion
- Affine plane curve evolution: a fully consistent scheme
- On approximations of the curve shortening flow and of the mean curvature flow based on the DeTurck trick
This page was built for publication: Grid peeling and the affine curve-shortening flow
