The field of geometric graph drawing is moving towards a more combinatorial and algorithmic approach, with a focus on efficient recognition and characterization of specific graph properties. Recent developments have led to the discovery of new relationships between graph structures and their geometric representations, enabling the development of faster and more efficient algorithms for graph drawing and polyhedral enclosure. Notably, researchers are exploring the use of symbolic constraints and discrete incidence variables to predict and analyze the properties of polyhedral surfaces and their decompositions into tetrahedra. Furthermore, the study of tangling and untangling trees on point-sets has led to the development of new algorithms for computing drawings with bounded curve complexity and prescribed numbers of crossings. Overall, the field is advancing towards a deeper understanding of the interplay between graph theory, geometry, and algorithms. Noteworthy papers include: Characterizing and Recognizing Twistedness, which develops a purely combinatorial view on generalized twisted drawings and leads to efficient recognition algorithms. Exploratory Notes on Symbolic Constraints in Polyhedral Enclosure and Tetrahedral Decomposition in Genus-0 Polyhedra, which presents a symbolic framework for deciding whether a given set of polygonal faces can form a closed genus-zero polyhedral surface. Tangling and Untangling Trees on Point-sets, which computes a drawing of a tree with a prescribed number of crossings on a given set of points while ensuring bounded curve complexity.