Computing a Minimum-Width Square Annulus in Arbitrary Orientation
From MaRDI portal
Publication:2803818
DOI10.1007/978-3-319-30139-6_11zbMath1475.68402OpenAlexW2557810211MaRDI QIDQ2803818
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
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
Minimum width color spanning annulus ⋮ Computing a Minimum-Width Square or Rectangular Annulus with Outliers
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum-width rectangular annulus
- Offset polygon and annulus placement problems
- Finding the upper envelope of n line segments in O(n log n) time
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- Offset-polygon annulus placement problems
- Interference-free NC machining using spatial planning and Minkowski operations.
- Efficient randomized algorithms for some geometric optimization problems
- Approximating extent measures of points
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
This page was built for publication: Computing a Minimum-Width Square Annulus in Arbitrary Orientation