Complexity, convexity, and unimodality
From MaRDI portal
Publication:3219150
DOI10.1007/BF00979872zbMath0555.68061OpenAlexW2028985219WikidataQ59541790 ScholiaQ59541790MaRDI QIDQ3219150
Publication date: 1984
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00979872
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (7)
On determining the on-line minimax linear fit to a discrete point set in the plane ⋮ On the unimodality of convex polygons ⋮ A simple linear-time algorithm for computing the ring and MST of unimodal polygons ⋮ Algorithms for optimal area triangulations of a convex polygon ⋮ The morphology of convex polygons ⋮ On the modality of convex polygons ⋮ Finding the minimum vertex distance between two disjoint convex polygons in linear time
Cites Work
- Comments on the all nearest-neighbor problem for convex polygons
- The symmetric all-furthest-neighbor problem
- The relative neighbourhood graph of a finite planar set
- On the multimodality of distances in convex polygons
- The all nearest-neighbor problem for convex polygons
- A note on the all nearest-neighbor problem for convex polygons
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
- Fast computation of the modality of polygons
- A Counterexample to a Diameter Algorithm for Convex Polygons
- Decomposition of Polygons into Convex Sets
- On A Problem of P. Erdos
- On the Different Distances Determined by n Points
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity, convexity, and unimodality