𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Point placement algorithms for Delaunay triangulation of polygonal domains

✍ Scribed by L. R. Nackman; V. Srinivasan


Publisher
Springer
Year
1994
Tongue
English
Weight
904 KB
Volume
12
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A bijection for triangulations of a poly
✍ Dominique Poulalhon; Gilles Schaeffer πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 368 KB

Loopless triangulations of a polygon with k vertices in k + 2n triangles (with interior points and possibly multiple edges) were enumerated by Mullin in 1965, using generating functions and calculations with the quadratic method. In this article we propose a simple bijective interpretation of Mulli