Abstract
This work proposes an $O(n \log n)$ time algorithm to construct a simple isothetic polygon from a given set of n points. To draw a simple isothetic polygon from a given set of points, the point set should satisfy certain criteria. If the point set does not satisfy those criteria, extra points needed to be added for a simple polygon to be drawn. In this work, an algorithm has been proposed to draw a polygon with an addition of at most n extra points with the assumption that no two points in the point set are on the same horizontal or vertical line.
Sign-in/Register to access full text options 
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.
