Computing constrained minimum-width annuli of point sets

DOI10.1007/3-540-63307-3_77MaRDI QIDQ5096955zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, David Bremner, Suneeta Ramaswami, Gordon Wilfong, Mark de Berg

Publication date 19 August 2022

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

Full work available at URL https://dspace.library.uu.nl/handle/1874/2651

zbMATH Keywords

Voronoi diagramminimum widthVoronoi regionVoronoi edgeouter circle

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximation algorithms for minimum-width annuli and shells
• Minimum Width Rectangular Annulus
• Minimum-width rectangular annulus
• Computing a minimum-width square annulus in arbitrary orientation
• Minimum-width annulus with outliers: circular, square, and rectangular cases

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 589497 (Why is no real title available?)
• scientific article; zbMATH DE number 6472585 (Why is no real title available?)
• A sweepline algorithm for Voronoi diagrams
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Applications of Parametric Searching in Geometric Optimization
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Approximation by circles
• Computing Envelopes in Four Dimensions with Applications
• Computing convolutions by reciprocal search
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Improved algorithms for discs and balls using power diagrams
• Intersections with random geometric objects
• Optimal Search in Planar Subdivisions

Cited in

(8)

• Optimizing a constrained convex polygonal annulus
• Optimal consensus set for digital flake hyperspheres in \(n\)D
• Computing a minimum-width square or rectangular annulus with outliers
• COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND
• Computing a Minimum-Width Square Annulus in Arbitrary Orientation
• Computing a Minimum-Width Square or Rectangular Annulus with Outliers
• Testing the quality of manufactured disks and balls
• An optimal algorithm for roundness determination on convex polygons

This page was built for publication: Computing constrained minimum-width annuli of point sets

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