Sciweavers

Share
COMBINATORICA
2011
8 years 6 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
9 years 4 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
COMGEO
2004
ACM
9 years 6 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
COMGEO
2004
ACM
9 years 6 months ago
Ordered theta graphs
Let
Prosenjit Bose, Joachim Gudmundsson, Pat Morin
JGT
2006
101views more  JGT 2006»
9 years 7 months ago
Distinguishing geometric graphs
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
Michael O. Albertson, Debra L. Boutin
COMBINATORICA
2008
88views more  COMBINATORICA 2008»
9 years 7 months ago
Geometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Rom Pinchasi
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
9 years 8 months ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
CCCG
2010
9 years 8 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
GD
2006
Springer
9 years 10 months ago
The Number of Triangulations on Planar Point Sets
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
Emo Welzl
COMPGEOM
2003
ACM
10 years 6 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
books