𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the full visibility graph of a set of line segments

✍ Scribed by S.K. Wismath

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
419 KB
Volume
42
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reconstructing sets of orthogonal line s
Reconstructing sets of orthogonal line segments in the plane
✍ Franz Rendl; Gerhard Woeginger πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 550 KB

Rend], F. and G. Woeginger, Reconstructing sets of orthogonal line segments in the plane, Discrete Mathematics 119 (1993) 1677174. We show that reconstructing a set of n orthogonal line segments in the plane from the set of their vertices can be done in O(n log n) time, if the segments are allowed

A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.

Complexity of Computing the Local Dimens
Complexity of Computing the Local Dimension of a Semialgebraic Set
✍ Nicolai Vorobjov πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 521 KB

The paper describes several algorithms related to a problem of computing the local dimension of a semialgebraic set. Let a semialgebraic set V be defined by a system of k inequalities of the form f β‰₯ 0 with f ∈ R[X 1 , . . . , Xn], deg(f ) < d, and x ∈ V . An algorithm is constructed for computing t

Computing equivalence classes among the
Computing equivalence classes among the edges of a graph with applications
✍ Franz Aurenhammer; Johann Hagauer πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 896 KB

classes among the edges of a graph For two edges e = (x, y) and e ' = (x', y') of a connected graph G = (V, E) let e Oe' iff d(x. x') + ;(y, y') # d(x, y') + d(x', y). Here d(x, y) denotes the length of a shortest path in G joining vertices x and y. An algorithm is presented that computes the equiva