Sciweavers

2498 search results - page 220 / 500
» Algorithms for the Topological Watershed
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
15 years 11 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
SIGGRAPH
2000
ACM
15 years 11 months ago
Illustrating smooth surfaces
We present a new set of algorithms for line-art rendering of smooth surfaces. We introduce an efficient, deterministic algorithm for finding silhouettes based on geometric duali...
Aaron Hertzmann, Denis Zorin
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
CAL
2002
15 years 6 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally