Morphing simple polygons
From MaRDI portal
Publication:1577545
DOI10.1007/S004540010017zbMATH Open0968.68161OpenAlexW1999074738MaRDI QIDQ1577545FDOQ1577545
Authors: Leonidas Guibas, John Hershberger, Subhash Suri 
Publication date: 10 September 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010017
Recommendations
Cited In (22)
- How to morph planar graph drawings
- Title not available (Why is that?)
- Towards compatible triangulations.
- Polygons with prescribed angles in 2D and 3D
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- On the mating between a polygonal curve and a convex polygon
- Polygons with Prescribed Angles in 2D and 3D
- Shadow metamorphosis
- Computing signed permutations of polygons
- The smallest convex \(k\)-gon containing \(n\) congruent disks
- Morphing polyhedra with parallel faces: Counterexamples
- Relative convex hulls in semi-dynamic arrangements
- Transitions between 4-intersection values of planar regions
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- Delaunay-Based Polygon Morphing Across a Change in Topology
- Refolding planar polygons
- Polygon morphing and its application in orebody modeling
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- New similarity measures between polylines with applications to morphing and polygon sweeping
- Morphing between polylines
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Mathematical Foundations of Computer Science 2004
This page was built for publication: Morphing simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577545)
