𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The intersection searching problem for c-oriented polygons

✍ Scribed by Xue-Hou Tan; Tomio Hirata; Yasuyoshi Inagaki

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
615 KB
Volume
37
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The intersection problem for m-cycle sys
The intersection problem for m-cycle systems
✍ Elizabeth J. Billington πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 794 KB

Let Z,(v) denote the set of integers k for which a pair of m-cycle systems of K , exist, on the same vertex set, having k common cycles. Let J,(v) = { 0,1,2, . . . ,t, -2, t,} where t , = v(vl ) / 2 m . In this article, if 2mn + x is an admissible order of an m-cycle system, we investigate when Zm(2

Polygonal interface problems for the bih
Polygonal interface problems for the biharmonic operator
✍ Serge Nicaise πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 971 KB

## Abstract We study some boundary value problems on two‐dimensional polygonal topological networks, where on each face, the considered operator is the biharmonic operator. The transmission conditions we impose along the edges are inspired by the models introduced by H. Le Dret [13] and Destuynder

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

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; MaurΓ­cio C. De Souza πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o