Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
SLO
Login
Search
Browsing
Upload document
Statistics
RUP
FAMNIT - Faculty of Mathematics, Science and Information Technologies
FHŠ - Faculty of Humanities
FM - Faculty of Management
FTŠ Turistica - Turistica – College of Tourism Portorož
FVZ - Faculty of Health Sciences
IAM - Andrej Marušič Institute
PEF - Faculty of Education
UPR - University of Primorska
ZUP - University of Primorska Press
COBISS
University of Primorska, University Library - all departments
First page
/
Show document
Show document
A-
|
A+
|
Print
Title:
Lattices on tetrahedral partitions
Authors:
ID
Vitrih, Vito
(Author)
Files:
http://dx.doi.org/10.1007/s11565-008-0058-9
Language:
English
Work type:
Not categorized
Typology:
1.08 - Published Scientific Conference Contribution
Organization:
IAM - Andrej Marušič Institute
Abstract:
In this paper, four-pencil lattices on tetrahedral partitions are studied. Theexplicit representation of a lattice, based upon barycentric coordinates, enables us to extend the lattice from a single tetrahedron to a tetrahedral partition. It is shown that the number of degrees of freedom is equal to the number of vertices of the tetrahedral partition. The proof is based on a lattice split approach.
Keywords:
mreža
,
tetraeder
,
interpolacija
Year of publishing:
2008
Number of pages:
str. 349-359
Numbering:
Vol. 54, N. 2
PID:
20.500.12556/RUP-3480
ISSN:
0430-3202
UDC:
519.17
COBISS.SI-ID:
1024069972
Publication date in RUP:
15.10.2013
Views:
4228
Downloads:
213
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
VITRIH, Vito, 2008, Lattices on tetrahedral partitions. In : [online]. Published Scientific Conference Contribution. 2008. p. 349–359. [Accessed 5 April 2025]. Retrieved from: http://dx.doi.org/10.1007/s11565-008-0058-9
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Vector connectivity in graphs
On the complexity of the vector connectivity problem
On hereditary efficiently dominatable graphs
Aproksimacijski vidiki vektorske dominacije in vektorske povezanosti v grah
A complexitystudy of distance variants of covering and domination problems in H-free graphs
Similar works from other repositories:
Approximation algorithms for computing the average of distance between points
2048
Sprotni algoritmi za računanje razdelitve grafa na klike
Algoritmi v teoriji grafov
Computing the girth of a planar graph
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
Unknown
Keywords:
lattice
,
tetrahedron
,
interpolation
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back