Computing a Minimum-Width Square or Rectangular Annulus with Outliers

DOI10.1007/978-3-319-42634-1_36zbMath1476.68266OpenAlexW2494407603MaRDI QIDQ2817885

Sang Won Bae

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_36

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Enclosing \(k\) points in the smallest axis parallel rectangle
• Minimum-width rectangular annulus
• Finding the upper envelope of n line segments in O(n log n) time
• Covering points by disjoint boxes with outliers
• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Algorithms for optimal outlier removal
• Improved bounds for planar \(k\)-sets and related problems
• Geometric applications of a randomized optimization technique
• On geometric optimization with few violated constraints
• Computing a Minimum-Width Square Annulus in Arbitrary Orientation
• Finding k points with minimum diameter and related problems
• AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS