120 search results - page 9 / 24 » On locally Delaunay geometric graphs |
112
click to vote
DICTA
2003
15 years 1 months ago
2003
Abstract. This paper introduces a two-level approach for image segmentation based on region and edge integration. Edges are first detected in the original image using a combinatio...
112
click to vote
SIROCCO
2007
15 years 1 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
106
click to vote
CCCG
2010
15 years 1 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
ECEASST
2008
14 years 11 months ago
2008
Abstract: A triangulated network of mobile units is modelled by means of a graph transformation system in which graph nodes are labelled with geometric coordinates and edges are la...
116
click to vote
WADS
1993
Springer
15 years 3 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...