Abstract
AbstractThis article proposes a new heuristic (locally determined) algorithm for the triangulation between point sequences representing cross‐sectional contours of a surface. Such point sequence is required to be the set of vertices of a polygon representing a Jordan curve and approximating the contour. The algorithm which is applied directly to the whole point sequence, is very simple since it is based on comparisons between coordinates within a plane. The triangulation algorithm is applied to surface area estimation, where we use the polygonal approximations of cross sectional contours given by the sequences of MLP (minimal length polygon) vertices or of DSS (maximal digital straight segments) vertices. The test surfaces of known area are ellipsoids of revolution and hyperboloids of one sheet. © 2011 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 21, 58–66, 2011.
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 callMore From: International Journal of Imaging Systems and Technology
Disclaimer: 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.
