Hong Duc Bui

collaborators

3 papers

cs.CG2025

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O (n^{1.032})$ Area

Hong Duc Bui

We resolve a conjecture posed by Covella, Frati and Patrignani by proving the straight-line orthogonal drawing of the complete ternary tree with $n$ nodes satisfying the subtree se…

cs.CG2025

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials

Hong Duc Bui

We describe a framework that unifies the two types of polynomials introduced respectively by Bacher and Mouton and by Rutschmann and Wettstein to analyze the number of triangulatio…

cs.CG2025

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares

Hong Duc Bui

We consider the problem of packing a large square with nonoverlapping unit squares. Let $W (x)$ be the minimum wasted area when a large square of side length $x$ is packed with unit…

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires O(n1.032) Area

Counting Number of Triangulations of Point Sets: Reinterpreting and Generalizing the Triangulation Polynomials

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares

Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O (n^{1.032})$ Area