# The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.

Discrete & computational geometry (1990)

- Volume: 5, Issue: 1, page 35-42
- ISSN: 0179-5376; 1432-0444/e

## Access Full Article

top## How to cite

topEdelsbrunner, H., and Sharir, M.. "The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.." Discrete & computational geometry 5.1 (1990): 35-42. <http://eudml.org/doc/131105>.

@article{Edelsbrunner1990,

author = {Edelsbrunner, H., Sharir, M.},

journal = {Discrete & computational geometry},

keywords = {transversal; geometric permutation; maximum number},

number = {1},

pages = {35-42},

title = {The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.},

url = {http://eudml.org/doc/131105},

volume = {5},

year = {1990},

}

TY - JOUR

AU - Edelsbrunner, H.

AU - Sharir, M.

TI - The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.

JO - Discrete & computational geometry

PY - 1990

VL - 5

IS - 1

SP - 35

EP - 42

KW - transversal; geometric permutation; maximum number

UR - http://eudml.org/doc/131105

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.