12 search results - page 3 / 3 » Number of Crossing-Free Geometric Graphs vs. Triangulations |
120
click to vote
NETWORK
2007
15 years 5 days 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...
141
Voted
COMGEO
2006
ACM
15 years 22 days 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...