Computing the Smallest T-Shaped Polygon Containing k Points

DOI10.1080/00207160211923MaRDI QIDQ4780527zbMATH OpenOpenAlexFDO

Authors Vanam Srilakshmi, Michiel Smid

Publication date 20 November 2002

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160211923

zbMATH Keywords

clusteringalgorithmcomputational geometryminimum-size polygonT-polygon

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Minimum-perimeter enclosures
• Finding minimum area \(k\)-gons
• Computing the smallest \(k\)-enclosing circle and related problems
• Enclosing k points in the smallest axis parallel rectangle
• Minimum area polygons with two reflex angles enclosingkPoints

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Computing the smallest \(k\)-enclosing circle and related problems
• Finding k points with minimum diameter and related problems
• Iterated nearest neighbors and finding minimal polytopes
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On enclosing k points by a circle
• On geometric optimization with few violated constraints
• Static and Dynamic Algorithms for k-Point Clustering Problems

Cited in

(2)

• Using symbolic calculations to determine largest small polygons
• Finding the smallest triangles containing a given convex polygon

This page was built for publication: Computing the Smallest T-Shaped Polygon Containing k Points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780527)