Genç, Burkay

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7554
Name Variants
Genc, B.
Genc, Burkay
Job Title
Email Address
Main Affiliation
05.05. Computer Engineering
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

6

Articles

4

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

21

Scopus Citation Count

29

WoS h-index

3

Scopus h-index

3

Patents

0

Projects

0

WoS Citations per Publication

3.50

Scopus Citations per Publication

4.83

Open Access Source

3

Supervised Theses

0

JournalCount
Computatıonal Geometry-Theory And Applıcatıons3
Dıscrete Applıed Mathematıcs1
Internatıonal Journal of Computatıonal Geometry & Applıcatıons1
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2009 - 200912010 - 20165
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 6 of 6
  • Thumbnail Image
    Conference Object
    Citation - WoS: 1
    Citation - Scopus: 1
    Covering Points With Orthogonal Polygons
    (Elsevier, 2014) Evrendilek, Cem; Genc, Burkay; Hnich, Brahim
    We address the problem of covering points with orthogonal polygons. Specifically, given a set of n points in the plane, we investigate the existence of an orthogonal polygon such that there is a one-to-one correspondence between the points and the edges of the polygon. In an earlier paper, we have shown that constructing such a covering with an orthogonally convex polygon, if any, can be done in O(n log n) time. In case an orthogonally convex polygon cannot cover the point set, we show in this paper that the problem of deciding whether such a point set can be covered with any orthogonal polygon is NP-complete. The problem remains NP-complete even if the orientations of the edges covering each point are specified in advance as part of the input. (C) 2012 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - Scopus: 1
    STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA
    (World Scientific Publ Co Pte Ltd, 2011) Biedl, Therese; Genç, Burkay
    Stoker's theorem states that in a convex polyhedron, the dihedral angles and edge lengths determine the facial angles if the graph is fixed. In this paper, we study under what conditions Stoker's theorem holds for orthogonal polyhedra, obtaining uniqueness and a linear-time algorithm in some cases, and NP-hardness in others.
  • Thumbnail Image
    Article
    Citation - WoS: 13
    Citation - Scopus: 15
    Reconstructing Orthogonal Polyhedra From Putative Vertex Sets
    (Elsevier, 2011) Biedl, Therese; Genç, Burkay
    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. This is well-studied in 2D; we mostly focus on 3D, and on the case where the given set of points may be rotated beforehand. We obtain fast algorithms for reconstruction in the case where the answer must be orthogonally convex. (C) 2011 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 4
    Citation - Scopus: 5
    Covering Points With Orthogonally Convex Polygons
    (Elsevier, 2011) Genç, Burkay; Evrendilek, Cem; Hnich, Brahim
    In this paper, we address the problem of covering points with orthogonally convex polygons. In particular, given a point set of size n on the plane, we aim at finding if there exists an orthogonally convex polygon such that each edge of the polygon covers exactly one point and each point is covered by exactly one edge. We show that if such a polygon exists, it may not be unique. We propose an O(n log n) algorithm to construct such a polygon if it exists, or else report the non-existence in the same time bound. We also extend our algorithm to count all such polygons without hindering the overall time complexity. Finally, we show how to construct all k such polygons in O(n log n + kn) time. All the proposed algorithms are fast and practical. (C) 2010 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Article
    Citation - Scopus: 2
    Covering Points With Minimum/Maximum Area Orthogonally Convex Polygons
    (Elsevier Science Bv, 2016) Evrendilek, Cem; Genc, Burkay; Hnich, Brahim
    In this paper, we address the problem of covering a given set of points on the plane with minimum and/or maximum area orthogonally convex polygons. It is known that the number of possible orthogonally convex polygon covers can be exponential in the number of input points. We propose, for the first time, an O(n(2)) algorithm to construct either the maximum or the minimum area orthogonally convex polygon if it exists, else report the non-existence in O (n log n). (C) 2016 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 3
    Citation - Scopus: 5
    Cauchy's Theorem for Orthogonal Polyhedra of Genus 0
    (2009) Biedl T.; Genç, Burkay
    A famous theorem by Cauchy states that the dihedral angles of a convex polyhedron are determined by the 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. © 2009 Springer Berlin Heidelberg.