
doi: 10.1007/pl00009434
This paper introduces a general notion of stress on cell-complexes and presents results connecting stress and liftings of \(d\)-dimensional cell complexes. New sufficient conditions for the existence of a sharp lifting for a flat piecewise linear realization of a manifold are given. The author presents two algorithms that determine whether a piecewise linear realization of a d-manifold in \(R^d\) admits a lifting to \(R^{d+1}\) which satisfies given constraints.
polyhedral complexes, stress, Computer graphics; computational geometry (digital and algorithmic aspects), lifting, Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
polyhedral complexes, stress, Computer graphics; computational geometry (digital and algorithmic aspects), lifting, Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 13 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
