ACM Transactions on Graphics (TOG)
Computational geometry for CAD/CAM
Pacific Graphics '94 Proceedings of the second Pacific conference on Fundamentals of computer graphics
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Casting a polyhedron with directional uncertainty
Computational Geometry: Theory and Applications
Approximating centroids for the maximum intersection of spherical polygons
Computer-Aided Design
Covering a simple polygon by monotone directions
Computational Geometry: Theory and Applications
Finding all undercut-free parting directions for extrusions
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Hi-index | 0.00 |
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.