Add to ORKGWe study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree, and Minimum perfect matching on geometric graphs induced by bichromatic ( Open image in new window and Open image in new window ) points. These problems have been widely studied for points in the Euclidean plane, and many of them are NP -hard. In this work, we consider these problems in two restricted settings: (i) collinear points and (ii) equidistant points on a circle. We show that almost all of these problems can be solved in linear time in these constrained, yet non-trivial settings
In this thesis we focus on four problems in computational geometry: In the first four chapters we co...
We give an O(|V(G)|)-time algorithm to assign vertical and horizontal segments to the vertices of an...
Given a point set P and a set B of polygonal obstacles in the plane, we consider planar geometric gr...
We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree...
Let R and B be two disjoint sets of points in the plane where the points of R are colored red and th...
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-lin...
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-lin...
AbstractGiven a set S of n red and blue points in the plane, a planar bichromatic minimum spanning t...
International audienceLet S be a finite set of points in the interior of a simple polygon P. A geode...
Let S be a finite set of points in the interior of a simple polygon P. A geodesic graph, GP (S,E), i...
Let S be a finite set of points in the interior of a simple polygon P. A geodesic graph, GP(S,E), is...
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. ...
Consider a set B of blue points and a set R of red points in the plane such that R ∪ B is in general...
Let R and B be two disjoint sets of points in the plane such that |B| ≤ |R|, and no three points of ...
In this thesis we focus on four problems in computational geometry: In the first four chapters we co...
In this thesis we focus on four problems in computational geometry: In the first four chapters we co...
We give an O(|V(G)|)-time algorithm to assign vertical and horizontal segments to the vertices of an...
Given a point set P and a set B of polygonal obstacles in the plane, we consider planar geometric gr...
We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree...
Let R and B be two disjoint sets of points in the plane where the points of R are colored red and th...
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-lin...
A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-lin...
AbstractGiven a set S of n red and blue points in the plane, a planar bichromatic minimum spanning t...
International audienceLet S be a finite set of points in the interior of a simple polygon P. A geode...
Let S be a finite set of points in the interior of a simple polygon P. A geodesic graph, GP (S,E), i...
Let S be a finite set of points in the interior of a simple polygon P. A geodesic graph, GP(S,E), is...
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. ...
Consider a set B of blue points and a set R of red points in the plane such that R ∪ B is in general...
Let R and B be two disjoint sets of points in the plane such that |B| ≤ |R|, and no three points of ...
In this thesis we focus on four problems in computational geometry: In the first four chapters we co...
In this thesis we focus on four problems in computational geometry: In the first four chapters we co...
We give an O(|V(G)|)-time algorithm to assign vertical and horizontal segments to the vertices of an...
Given a point set P and a set B of polygonal obstacles in the plane, we consider planar geometric gr...