Abstract
A triangular graph is a planar graph in which each face is a 3-cycle, except possibly for the exterior face, and without articulation nodes. The embedding of a triangular graph in the plane is called a triangular mesh. More generally, a triangular graph with multiple contours is a planar graph without articulation nodes in which each face is a 3-cycle, except possibly for a fixed number of them. A contraction along an edge in a graph is the result of identifying the two endpoints of the edge. In this paper a necessary and sufficient condition is shown for which triangularity (possibly with multiple contours) is preserved after contraction. Moreover, when a licit contraction is performed, the question to answer is whether or not it is possible to derive the embedding of the contracted triangular graph from the original triangular mesh by redrawing only around the contraction zone.
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.
