A simple linear-time algorithm for computing the ring and MST of unimodal polygons
From MaRDI portal
Publication:1120279
DOI10.1016/0020-0190(89)90081-1zbMath0672.68017OpenAlexW1983897438MaRDI QIDQ1120279
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90081-1
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the unimodality of convex polygons
- The relative neighbourhood graph of a finite planar set
- On the multimodality of distances in convex polygons
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- Complexity, convexity, and unimodality
- Fast computation of the modality of polygons
- A Counterexample to a Diameter Algorithm for Convex Polygons
This page was built for publication: A simple linear-time algorithm for computing the ring and MST of unimodal polygons