✦ LIBER ✦

The neutral case for the min-max triangulation

✍ Scribed by Dianne Hansford

Book ID: 107919431
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 493 KB
Volume: 7
Category: Article
ISSN: 0167-8396
DOI: 10.1016/0167-8396(90)90006-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The neutral case for the min-max angle c

The neutral case for the min-max angle criterion: a generalized concept

✍ P.L. Powar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 331 KB

One strike against the min-max degree tr

One strike against the min-max degree triangulation problem

✍ Klaus Jansen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 718 KB

Delaunay versus max-min solid angle tria

Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation

✍ Barry Joe 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

A linear time algorithm for max-min leng

A linear time algorithm for max-min length triangulation of a convex polygon

✍ Shiyan Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Complexity of the min–max and min–max re

Complexity of the min–max and min–max regret assignment problems

✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 179 KB

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro

The relaxed min-max heap

✍ Yuzheng Ding; Mark Allen Weiss 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 981 KB