We study the problem of determining whether a manufactured disc of certain radius r is within tolerance. More precisely, we present algorithms that, given a set of n probe points on the surface of the manufactured object, compute the thinnest annulus whose outer (or inner, or median) radius is r and that contains all the probe points. Our algorithms run in O(n log n) time.
CITATION STYLE
de Berg, M., Bose, P., Bremner, D., Ramaswami, S., & Wilfong, G. (1997). Computing constrained minimum-width annuli of point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1272, pp. 392–401). Springer Verlag. https://doi.org/10.1007/3-540-63307-3_77
Mendeley helps you to discover research relevant for your work.