✦ LIBER ✦

Minimal roughness property of the Delaunay triangulation

✍ Scribed by Samuel Rippa

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 590 KB
Volume: 7
Category: Article
ISSN: 0167-8396
DOI: 10.1016/0167-8396(90)90011-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The farthest point Delaunay triangulatio

The farthest point Delaunay triangulation minimizes angles

✍ David Eppstein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Minimal triangulation of the 4-cube

✍ Richard W. Cottle 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 447 KB

It is known that the 4-dimensional cube can be triangulated by a set of 16 simplices. This note demonstrates that the 4-dimensional cube cannot be triangulated with fewer than 16 simpiices.

The integrity of geometrical boundaries

The integrity of geometrical boundaries in the two-dimensional delaunay triangulation

✍ Weatherill, N. P. 📂 Article 📅 1990 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 496 KB 👁 1 views

A linear-time construction of the relati

A linear-time construction of the relative neighborhood graph from the Delaunay triangulation

✍ Andrzej Lingas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 649 KB

USING LONGEST-SIDE BISECTION TECHNIQUES

USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS

✍ MARÍA-CECILIA RIVARA; PATRICIO INOSTROZA 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

In this paper we discuss, study and compare two linear algorithms for the triangulation reÿnement problem: the known longest-side (triangle bisection) reÿnement algorithm, as well as a new algorithm that uses longest side bisection techniques for reÿning Delaunay triangulations. We show that the aut

On the uniqueness property of minimal pr

On the uniqueness property of minimal projectors

✍ Robert Schumacher 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 403 KB