Correction to ` Osculation Vertices in Arrangements of Curves ' , by Paul
نویسنده
چکیده
We regret that Remarks (3), (4), (5), and (6) appeared out of context on pp. 328 and 329. They should have been placed between Remarks (2) and (7) on p. 331 .
منابع مشابه
Osculation Vertices in Arrangements of Curves
In 1897 de Rocquigny [18] raised the problem of determining the maximal number of points of tangency possible in a system of n mutually non-crossing circles in the plane. The problem seems to have been forgotten until an analogous question concerning 'Apollonian arrangements' of curves was raised and the solution indicated in [11]. The aim of the present note is to indicate the easy solutions t...
متن کاملUPPER BOUNDS ON THE NUMBER OF VERTICES OF WEIGHT ≤ k IN PARTICULAR ARRANGEMENTS OF PSEUDOCIRCLES
In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight ≤ k in certain arrangements of pseudocircles in the plane. In particular, forbidding certain subarrangements we improve the known bound of 6n − 12 (cf. [2]) for verti...
متن کاملImproved Upper Bounds on the Number of Vertices of Weight ≤ k in Particular Arrangements of Pseudocircles
In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight ≤ k in certain arrangements of pseudocircles in the plane.
متن کاملForcing subarrangements in complete arrangements of pseudocircles
In arrangements of pseudocircles (i.e., Jordan curves) the weight of a vertex (i.e., an intersection point) is the number of pseudocircles that contain the vertex in its interior. We show that in complete arrangements (in which each two pseudocircles intersect) 2n−1 vertices of weight 0 force an α-subarrangement, a certain arrangement of three pseudocircles. Similarly, 4n−5 vertices of weight 0...
متن کاملTwo-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Given a collection C of curves in the plane the arrangement of C is the subdivision of the plane into vertices edges and faces in duced by the curves in C Constructing arrangements of curves in the plane is a basic problem in computational geometry Applications rely ing on arrangements arise in elds such as robotics computer vision and computer graphics Many algorithms for constructing and main...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1973