• 1
...We present a general approach for analyzing structural parameters of a relational event graph within arbitrary query time intervals using colored range query...
• 2
...Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem...

• 3
...We describe an algorithm that builds a plane spanner with a maximum degree of 8 and a spanning ratio of \$\${\approx }4.414\$\$ ≈4.414 with respect to the complete...

• 4
...Let R and B be two disjoint sets of points in the plane such that \$\$|B|\le |R|\$\$ |B|≤|R| , and no three points of \$\$R\cup B\$\$ R∪B are collinear. We show that...

• 5
• 6
...Let R and B be two disjoint sets of points in the plane where the points of R are colored red and the points of B are colored blue, and let \$\$n=|R\cup B|\$\$...

• 7
...A new type of range searching problem, called the partial enclosure range searching problem, is introduced in this paper. Given a set of geometric objects S...
• 8
...A random geometric graph, G ( n , r ) , is formed by choosing n points independently and uniformly at random in a unit square; two points are connected by a...

• 9
...A geometric graph is a graph whose vertices are points in the plane and whose edges are straight-line segments between the points. A plane spanning tree in a...

• 10
...We consider preprocessing a set S of n points in convex position in the plane into a data structure supporting queries of the following form: given a point q...

• 11
...In this paper, we study variants of the classical geometric shortest path problem inside a simple polygon, where we allow a part of the path to go outside the...

• 12
...Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable, and extensively studied...
• 13
...We consider the problem of augmenting an n -vertex graph embedded in a metric space, by inserting one additional edge in order to minimize the diameter of the...
• 14
...In a geometric graph \$\$G\$\$ G , the stretch factor between two vertices \$\$u\$\$ u and \$\$w\$\$ w is the ratio between the Euclidean length of the shortest path from...

• 15
...Let S be a set of n points in a metric space, let R = { R p : p ∈ S } be a set of positive real numbers, and let G R be the undirected graph with vertex set S...
• 16
...Let \$S\$ be a finite set of points in the plane. In this paper we consider the problem of computing plane spanners of degree at most three for \$S\$. • If \$S\$ is...
• 17
...Nous montrons que, dans la métrique L2, le graphe Y4 de Yao est un spanner de coefficient d’étirement 8p2 (29 + 23p2)...
• 18
...Let \$S\$ be a set of \$n\$ points in the plane that is in convex position. For a real number \$t>1\$, we say that a point \$p\$ in \$S\$ is \$t\$-good if for every point...

• 19
...Let D be a set of n pairwise disjoint disks in the plane. Consider the metric space in which the distance between any two disks D and D′ in D is the length of...
• 20
...Let \$P\$ be a convex polyhedron in \$\mathbb{R}^3\$. The skeleton of \$P\$ is the graph whose vertices and edges are the vertices and edges of \$P\$, respectively. We...