✦ LIBER ✦

Optimal enclosing regions in planar graphs

✍ Scribed by Daniel Bienstock; Clyde L. Monma

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 942 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Polygonal Representation of Plan

Optimal Polygonal Representation of Planar Graphs

✍ C. A. Duncan; E. R. Gansner; Y. F. Hu; M. Kaufmann; S. G. Kobourov 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 724 KB

An optimal algorithm for finding an encl

An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width

✍ Olga N. Gluchshenko; Horst W. Hamacher; Arie Tamir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem.

Optimal addition of knots to cubature fo

Optimal addition of knots to cubature formulae for planar regions

✍ Ronald Cools; Ann Haegemans 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 214 KB

Subdivisions in Planar Graphs

✍ Xingxing Yu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Given four distinct vertices in a 4-connected planar graph G, we characterize when the graph G contains a K 4 -subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no K 4 -subdivision wi

A systolic algorithm for extracting regi

A systolic algorithm for extracting regions from a planar graph

✍ Zen-Chung Shih; R.C.T. Lee; S.N. Yang 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 866 KB

On paths in planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy.