Sciweavers

142 search results - page 14 / 29
» Augmenting the connectivity of geometric graphs
Sort
View
CVGIP
2007
99views more  CVGIP 2007»
13 years 8 months ago
Meshless geometric subdivision
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
Carsten Moenning, Facundo Mémoli, Guillermo...
DCOSS
2005
Springer
14 years 2 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
SIGMETRICS
2006
ACM
14 years 2 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
FOCS
2006
IEEE
14 years 2 months ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner
JGAA
2008
100views more  JGAA 2008»
13 years 8 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow