Browsing Dissertation/Theses - Department of Computer Science and Engineering by Subject "Computer graphics"

Now showing items 1-4 of 4

1-bend orthogonal drawings of triconnected planar 4-graphs

Abu Hasnat Mohammad Asfak Habib (Department of Computer Science and Engineering, BUET, 2007-10)

An orthogonal drawing of a planar graph is a drawing of the graph in which each vertex is mapped to a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edges do not ...
Computing nice projections of 2D and 3D scene

Shahriar Nirjon, S.M. (Department of Computer Science and Engineering, BUET, 2008-07)

Computing nice projections of objects in 2D and 3D is a well studied problem in computational geometry. By nice projections we mean optimal projections having some special geometric property. Aside from theoretical interest, ...
Minimum - layer drawings of trees

Jawaherul Alam, Muhammad (Department of Computer Science and Engineering (CSE), 2010-07)

A layered drawing of a planar graph G is a planar straight-line drawing of G, where the vertices are placed on a set of horizontal lines, called layers. A minimum-layer drawing of G is a layered drawing of G with the ...
On Pairwise Compatibility Graphs

Md. Shamsuzzoha Bayzid (Department of Computer Science and Engineering, 2010-06)

This thesis deals with pairwise compatibility graphs. Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T, and let dmin and dmax be two non-negative real ...

Now showing items 1-4 of 4

Search BUET IR