You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete
|
---|---|
Chapter number | 110 |
Book title |
Foundations of Computation Theory
|
Published by |
Springer, Berlin, Heidelberg, August 1983
|
DOI | 10.1007/3-540-12689-9_110 |
Book ISBNs |
978-3-54-012689-8, 978-3-54-038682-7
|
Authors |
Andrzej Lingas, Lingas, Andrzej |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 6 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 33% |
Professor | 1 | 17% |
Student > Ph. D. Student | 1 | 17% |
Other | 1 | 17% |
Unknown | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 50% |
Mathematics | 1 | 17% |
Physics and Astronomy | 1 | 17% |
Unknown | 1 | 17% |