✦ LIBER ✦

Computing the k-relative neighborhood graphs in Euclidean plane

✍ Scribed by Tung-Hsin Su; Ruei-Chuan Chang

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 805 KB
Volume: 24
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(91)90065-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the constrained relative neigh

Computing the constrained relative neighborhood graphs and constrained gabriel graphs in Euclidean plane

✍ Tung-Hsin Su; Ruei-Chuan Chang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 978 KB

Constructing the relative neighborhood g

Constructing the relative neighborhood graph in 3-dimensional Euclidean space

✍ Jerzy W. Jaromczyk; Mirosław Kowaluk 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 675 KB

Computing relative neighbourhood graphs

Computing relative neighbourhood graphs in the plane

✍ Jyrki Katajainen; Olli Nevalainen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 636 KB

Relative neighborhood graphs in three di

Relative neighborhood graphs in three dimensions

✍ Pankaj K. Agarwal; Jiří Matoušek 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Relative neighborhood graphs in the Li-m

Relative neighborhood graphs in the Li-metric

✍ D.T. Lee 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 419 KB

An approximation algorithm for a bottlen

An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

✍ Lusheng Wang; Zimao Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in