✦ LIBER ✦

On the intersection of a convex disc and a polygon

✍ Scribed by G. Fejes Tóth

Publisher: Akadmiai Kiad
Year: 1977
Tongue: English
Weight: 246 KB
Volume: 29
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01896476

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

On finding the convex hull of a simple p

On finding the convex hull of a simple polygon

✍ D. T. Lee 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 478 KB

The perimeter centroid of a convex polyg

The perimeter centroid of a convex polygon

✍ Mark J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A new O(n·log n) algorithm for computing

A new O(n·log n) algorithm for computing the intersection of convex polygons

✍ Sukhamay Kundu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 441 KB

On the time complexity for circumscribin

On the time complexity for circumscribing a convex polygon

✍ Tony C. Woo; Hyun-Chan Lee 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 120 KB

On the time complexity for circumscribin

On the time complexity for circumscribing a convex polygon

✍ Tony C Wood; Hyun-Chan Lee 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 68 KB

A recent article "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition" by Dori and Ben-Bassat, Comput. Vision Graph. Image Process. 24, 1983, 131-159, raised several interesting questions including the time complexity of their algorithm. In this paper, the time com