Abstract
Invertible Euclidean reconstruction methods without patches for 2D and 3D discrete curves are proposed. From a discrete 4-connected curve in 2D, or 6-connected curve in 3D, the proposed algorithms compute a polygonal line which digitization with the standard model is equal to all the pixels or voxels of the curve. The framework of this method is the discrete analytical geometry and parameter spaces are used in order to simplify the algorithms. Moreover, the reconstructed polyline is more compact than classical methods such as the Marching Cubes.
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.
