12 search results - page 3 / 3 » Number of Crossing-Free Geometric Graphs vs. Triangulations |
NETWORK
2007
13 years 4 months ago
2007
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...