Abstract
It is shown that Pavlidis's method for decomposing a polygon into (possibly overlapping) convex pieces can be viewed as simplifying a Boolean switching function expressed in disjunctive normal form. This analogy suggests that the search for a minimal polygon decomposition can be organized along the same lines used to find a minimal prime implicant cover for a Boolean expression.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
