Name
Abstract | ||
|---|---|---|
The Urquhart graph of a set of points in the plane is obtainedby removing the longest edge from each trianglein the Delaunay triangulation. We show experimentalevidence that the Urquhart graph is a good approximationfor the relative neighbourhood graph in the sensethat it contains few additional edges. For random samples,the Urquhart graph is typically only about 2%larger than the relative neighbourhood graph, and thusmay serve equally well for computational morphologytasks.1 |
Year | Venue | Keywords |
|---|---|---|
2001 | CCCG | delaunay triangulation,random sampling |
Field | DocType | Citations |
Discrete mathematics,Combinatorics,Minimum-weight triangulation,Beta skeleton,Bowyer–Watson algorithm,Computer science,Neighbourhood (mathematics),Constrained Delaunay triangulation,Point set triangulation,Delaunay triangulation,Pitteway triangulation | Conference | 4 |
PageRank | References | Authors |
0.64 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diogo Vieira Andrade | 1 | 4 | 0.64 |
| Luiz Henrique de Figueiredo | 2 | 629 | 62.99 |