Computing constrained minimum-width annuli of point sets

DOI10.1007/3-540-63307-3_77zbMath1497.68523OpenAlexW1546433237MaRDI QIDQ5096955

Gordon Wilfong, Suneeta Ramaswami, David Bremner, Prosenjit Bose, Mark T. 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 diagramVoronoi edgeminimum widthVoronoi regionouter circle

Mathematics Subject Classification ID

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

Related Items (1)

Optimal consensus set for digital flake hyperspheres in \(n\)D

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing convolutions by reciprocal search
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Intersections with random geometric objects
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Improved algorithms for discs and balls using power diagrams
• Optimal Search in Planar Subdivisions
• Applications of Parametric Searching in Geometric Optimization
• Computing Envelopes in Four Dimensions with Applications
• Approximation by circles

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