Abstract
Given a three-dimensional array containing values of a function of three variables, the algorithm presented here draws an approximation of the surface or surfaces where the function attains a specified value. This is done by contouring two-dimensional subsets of the three-dimensional array and suppressing the invisible parts of the contours. The union of all the contour line parts approximates the desired surface. The suppression of the invisible lines is the most complicated part of the algorithm and is done by forming a silhouette of the processed subset of the array and testing lines against this structure.
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.
