Generatrissa: the problems of Maxwell and Voronoi (Q1385974): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
(2 intermediate revisions by one other user not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Maria do Rosário Pinto / rank | |||
Property / reviewed by | |||
Property / reviewed by: Maria do Rosário Pinto / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 03:09, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generatrissa: the problems of Maxwell and Voronoi |
scientific article |
Statements
Generatrissa: the problems of Maxwell and Voronoi (English)
0 references
2 June 1998
0 references
The authors state several results concerning the existence of a generatrissa of a partition of Euclidean \(n\)-dimensional space, sketching the idea of its construction. A generatrissa of an \(n\)-dimensional closed strongly connected subcomplex \(U\) of a partition \(T\) is a continuous, locally convex function \(f\) defined on \(U\) such that for each polyhedron \(P\) in \(U\) there exists a linear function that represents \(f\) on \(P\). Some of these results establish relations between the existence of a generatrissa for \(T\) and the existence of a dual graph of the partition \(T\), that is, a graph such that there exists a one-to-one correspondence between its vertices and the polyhedra of \(T\), inducing a one-to-one correspondence between the graph's edges and the \((n-1)\)-dimensional faces in \(T\), such that each \((n-2)\)-dimensional face in \(T\) is associated with a cycle in the graph that is the boundary of a convex polygon. This paper generalizes work by J. C. Maxwell and G. F. Voronoi, respectively in dimension 2 and 3. The authors point out the relation of the work in this paper with the complexity of convex hull algorithms.
0 references
generatrissa
0 references
\(i\)-cup
0 references
dual graph
0 references
problems of Maxwell and Voronoi
0 references
partition of Euclidean \(n\)-dimensional space
0 references
polyhedra
0 references
convex polygon
0 references