✦ LIBER ✦

On the exhaustivity of simplicial partitioning

✍ Scribed by Peter J. C. Dickinson

Book ID: 120703922
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 359 KB
Volume: 58
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-013-0040-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattices on simplicial partitions

✍ Gašper Jaklič; Jernej Kozak; Marjeta Krajnc; Vito Vitrih; Emil Žagar 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 880 KB

In this paper, (d + 1)-pencil lattices on simplicial partitions in R d are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is

On simplicial partitions of polytopes

✍ A. A. Glazyrin 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 481 KB

Gradient superconvergence on uniform sim

Gradient superconvergence on uniform simplicial partitions of polytopes

✍ Brandts, J. 📂 Article 📅 2003 🏛 Oxford University Press 🌐 English ⚖ 141 KB

On the exhaustive generation of plane pa

On the exhaustive generation of plane partitions

✍ Mantaci, R.; Massazza, P. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Isosurfaces Over Simplicial Partitions o

Isosurfaces Over Simplicial Partitions of Multiresolution Grids

✍ Josiah Manson; Scott Schaefer 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB

Lattices on simplicial partitions which

Lattices on simplicial partitions which are not simply connected

✍ Vito Vitrih 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 439 KB

In this paper, (d + 1)-pencil lattices on simplicial partitions in R d , which are not simply connected, are studied. It is shown, how the fact that a partition is not simply connected can be used to increase the flexibility of a lattice. A local modification algorithm is developed also to deal with