Skip to main content

6 Result(s)

within Chapter Remove this filter Stephane Durocher Remove this filter Algorithm Analysis and Problem Complexity Remove this filter Artificial Intelligence Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Polygon Simplification by Minimizing Convex Corners

    Let P be a polygon with \(r>0\) reflex vertices and possibly with holes. A subsuming polygon of P is a polygon ...

    Yeganeh Bahoo, Stephane Durocher, J. Mark Keil… in Computing and Combinatorics (2016)

  2. Chapter and Conference Paper

    Drawing Graphs Using Body Gestures

    We introduce a new gesture-based user interface for drawing graphs that recognizes specific body gestures using the Microsoft Kinect sensor. Our preliminary user study demonstrates the potential for using gest...

    Yeganeh Bahoo, Andrea Bunt, Stephane Durocher… in Graph Drawing and Network Visualization (2015)

    Download PDF (223 KB) View Chapter

  3. No Access

    Chapter and Conference Paper

    Local Routing in Convex Subdivisions

    In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local ge...

    Prosenjit Bose, Stephane Durocher… in SOFSEM 2015: Theory and Practice of Comput… (2015)

  4. Chapter and Conference Paper

    Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees

    We wish to decide whether a simply connected flexible polygonal structure can be realized in Euclidean space. Two models are considered: polygonal linkages (body-and-joint framework) and contact graphs of unit...

    Clinton Bowen, Stephane Durocher… in Graph Drawing and Network Visualization (2015)

    Download PDF (445 KB) View Chapter

  5. No Access

    Chapter and Conference Paper

    Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number

    The stabbing number of a partition of a rectilinear polygon P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment contained in P. We consider the problem of finding a rec...

    Stephane Durocher, Saeed Mehrabi in Computing and Combinatorics (2012)

  6. No Access

    Chapter and Conference Paper

    Balancing Traffic Load Using One-Turn Rectilinear Routing

    We consider the problem of load-balanced routing, where a dense network is modelled by a continuous square region and origin and destination nodes correspond to pairs of points in that region. The objective is...

    Stephane Durocher, Evangelos Kranakis… in Theory and Applications of Models of Compu… (2008)