#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2002

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Burkay Genç, Ugur Dogrusöz
- Graph Drawing
- 2003

- Therese C. Biedl, Burkay Genç
- CCCG
- 2004

Polyhedra are an important basic structure in computational geometry. One of the most beautiful results concerning polyhedra is Cauchy’s theorem, which states that a convex polyhedron is uniquely defined by its graph, edge lengths and facial angles. (See Section 2 for definitions.) The proof of Cauchy’s theorem (see e.g. [2]) unfortunately is… (More)

- Therese C. Biedl, Burkay Genç
- ESA
- 2009

A famous theorem by Cauchy states that a convex polyhedron is determined by its incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhedra of genus 0 as long as no face has a hole. Our proof yields a linear-time algorithm to find the dihedral angles.

- Burkay Genç, Ugur Dogrusöz
- Inf. Sci.
- 2006

Visualization is crucial to the effective analysis of biological pathways. A poorly laid out pathway confuses the user, while a well laid out one improves the user s comprehension of the underlying biological phenomenon. We present a new, elegant algorithm for layout of biological signaling pathways. Our algorithm uses a force-directed layout scheme, taking… (More)

- Therese C. Biedl, Burkay Genç
- CCCG
- 2005

A cartogram is a type of map used to visualize data. In a map regions are displayed in their true shapes and with their exact relations with the adjacent regions. However, such a map can only be used to demonstrate the actual area values of the regions. Sometimes, we need to display other data on a map, such as population, pollution, electoral votes,… (More)

- Therese C. Biedl, Burkay Genç
- Comput. Geom.
- 2011

In this paper we study the problem of reconstructing orthogonal polyhedra from a putative vertex set, i.e., we are given a set of points and want to find an orthogonal polyhedron for which this is the set of vertices. We are especially interested in testing whether such a polyhedron is unique. Since this is not the case in general, we focus on orthogonally… (More)

- Ugur Dogrusöz, Burkay Genç
- Computers & Graphics
- 2006

In this paper we describe a new, multi-graph approach for development of a comprehensive set of complexity management techniques for interactive graph visualization tools. This framework facilitates efficient implementation of management of multiple associated graphs with navigation links and nesting of graphs as well as ghosting, folding and hiding of… (More)

- Burkay Genç
- 2008

- Burkay Genç, Cem Evrendilek, Brahim Hnich
- Comput. Geom.
- 2011

- Therese C. Biedl, Burkay Genç
- Int. J. Comput. Geometry Appl.
- 2011