Computing a Minimum-Width Square Annulus in Arbitrary Orientation
DOI10.1007/978-3-319-30139-6_11zbMATH Open1475.68402OpenAlexW2557810211MaRDI QIDQ2803818FDOQ2803818
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
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
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Approximating extent measures of points.
- Finding the upper envelope of n line segments in O(n log n) time
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Offset-polygon annulus placement problems
- Efficient randomized algorithms for some geometric optimization problems
- Minimum-width rectangular annulus
- Title not available (Why is that?)
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Offset polygon and annulus placement problems
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Interference-free NC machining using spatial planning and Minkowski operations.
Cited In (12)
- 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
- On the minimum-area rectangular and square annulus problem
- Computing a minimum-width square or rectangular annulus with outliers
- Minimum width color spanning annulus
- Empty squares in arbitrary orientation among points
- Title not available (Why is that?)
- Finding the maximum empty axis-parallel rectangular annulus
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- Empty squares in arbitrary orientation among points
- Computing a minimum-width square annulus in arbitrary orientation
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)
