12 search results - page 3 / 3 » Number of Crossing-Free Geometric Graphs vs. Triangulations |
104
click to vote
NETWORK
2007
14 years 10 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...
119
click to vote
COMGEO
2006
ACM
14 years 11 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...