Computing a Minimum-Width Square Annulus in Arbitrary Orientation

DOI10.1007/978-3-319-30139-6_11MaRDI QIDQ2803818zbMATH OpenOpenAlexFDO

Authors Sang Won Bae

Publication date 3 May 2016

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30139-6_11

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Computing a minimum-width square annulus in arbitrary orientation
• Computing a Minimum-Width Square or Rectangular Annulus with Outliers
• Computing constrained minimum-width annuli of point sets
• On the minimum-area rectangular and square annulus problem
• Approximation algorithms for minimum-width annuli and shells
• Computing a minimum-width square or rectangular annulus with outliers
• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Minimum-width square annulus intersecting polygons
• Minimum-width annulus with outliers: circular, square, and rectangular cases

Cites work

• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 6472585 (Why is no real title available?)
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Approximating extent measures of points.
• Efficient randomized algorithms for some geometric optimization problems
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Finding the upper envelope of n line segments in O(n log n) time
• Interference-free NC machining using spatial planning and Minkowski operations.
• Minimum-width rectangular annulus
• Offset polygon and annulus placement problems
• Offset-polygon annulus placement problems

Cited in

(12)

• Empty squares in arbitrary orientation among points
• Computing a minimum-width square or rectangular annulus with outliers
• Computing a minimum-width square annulus in arbitrary orientation
• On the minimum-area rectangular and square annulus problem
• Finding the maximum empty axis-parallel rectangular annulus
• Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
• Minimum width color spanning annulus
• Empty squares in arbitrary orientation among points
• Computing a Minimum-Width Square or Rectangular Annulus with Outliers
• scientific article; zbMATH DE number 3938779 (Why is no real title available?)
• Minimum-width annulus with outliers: circular, square, and rectangular cases
• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width

This page was built for publication: Computing a Minimum-Width Square Annulus in Arbitrary Orientation

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