logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Computing constrained minimum-width annuli of point sets

delete1998-04-01
delete12
delete
OA
AI
M
Mark de Berg *
P
Prosenjit Bose
B
Bremner, D
G
Gordon Wilfong
DOI：10.1016/S0010-4485(97)00073-0delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We study the problem of determining whether a manufactured disk 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(nlogn) time. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.
Keywords:
ALGORITHM
SEARCH
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computer-Aided Design
IF:
3.1
Papers:
3.1K
Citations:
6.4K

Organization

No organization information available