𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of polyhedron monotonicity

✍ Scribed by J.S. Ha; K.H. Yoo; J.K. Hahn

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
164 KB
Volume
38
Category
Article
ISSN
0010-4485

No coin nor oath required. For personal study only.

✦ Synopsis

The notion of polygon monotonicity has been well researched to be used as an important property for various geometric problems. This notion can be more extended for categorizing the boundary shapes of polyhedrons, but it has not been explored enough yet. This paper characterizes three types of polyhedron monotonicity: strong-, weak-, and directional-monotonicity: (Toussaint, 1985). We reexamine the three types of polyhedron monotonicity by relating them with 3D manufacturing problems, and present their formulation with geometric problems on the sphere.

πŸ“œ SIMILAR VOLUMES

Characterizations of adjacency on the br
Characterizations of adjacency on the branching polyhedron
✍ Rick Giles; Dirk Hausmann πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 805 KB

Given two distinct branchings of a directed graph G, we present several conditions which are equivalent to the corresporiding incidence vectors of the branchings being adjacent on the branching polyhedron of 6. The proof of these equivalences uses a "shrinking algorithm'\* whi\_h will determine in O