3D Straightness and Planarity
This chapter discusses digital straightness in 3D space, thereby generalizing the DSS- and MLP-based concepts, models, and algorithms that were studied in Chapters 9 and 10 It also discusses digital planarity in the 3D grid adjacency and incidence models, including relationships with other disciplines. Algorithms for recognizing digital planar segments are briefly reviewed, and one algorithm for partitioning a digital surface into such segments is discussed in detail.
11.1 3D Straightness
A digital straight line (DSL) in Z3 can be defined by 3D grid-plane intersection digitization, arithmetic geometry, or outer 3D Jordan digitization of a straight line γ ⊂ R3. It can be treated in 3D grid adjacency models ...
Get Digital Geometry now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
