✦ LIBER ✦

A counterexample to a dynamic algorithm for convex hulls of line arrangements

✍ Scribed by Binay Bhattacharya; Hazel Everett; Godfried Toussaint

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 154 KB
Volume: 12
Category: Article
ISSN: 0167-8655
DOI: 10.1016/0167-8655(91)90042-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A counterexample to an algorithm for com

A counterexample to an algorithm for computing monotone hulls of simple polygons

✍ Godfried T. Toussaint; Hossam El Gindy 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 241 KB

A counter-example to a convex hull algor

A counter-example to a convex hull algorithm for polygons

✍ Godfried Toussaint 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 161 KB

On a convex hull algorithm for polygons

On a convex hull algorithm for polygons and its application to triangulation problems

✍ Godfried T. Toussaint; David Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 500 KB

An Algorithm for In-Line Generation of a

An Algorithm for In-Line Generation of a Convex Cover

✍ Denis Rutovitz 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 171 KB

An efficient algorithm for finding the m

An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

✍ Naoki Makimoto; Ikuo Nakagawa; Akihisa Tamura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

An adaptive algorithm in time domain for

An adaptive algorithm in time domain for dynamic analysis of a simply supported beam subjected to a moving vehicle

✍ Hating Li; Haitian Yang; Nan Li 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 426 KB

This paper presents an adaptive algorithm in the time domain for the dynamic analysis of a simply supported beam subjected to the moving load and moving vehicle with/without varying surface roughness. By expanding variables at a discretized time interval, a coupled spatial-temporal problem can be co