Sciweavers

46 search results - page 4 / 10
» Exploring Simple Grid Polygons
Sort
View
ICNP
2005
IEEE
14 years 2 months ago
Simple Robotic Routing in Ad Hoc Networks
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
Daejoong Kim, Nicholas F. Maxemchuk
IVC
2007
102views more  IVC 2007»
13 years 8 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Isosurfaces Over Simplicial Partitions of Multiresolution Grids
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
Josiah Manson and Scott Schaefer
DGCI
2006
Springer
14 years 7 days ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
NECO
2008
114views more  NECO 2008»
13 years 8 months ago
A Sparse Generative Model of V1 Simple Cells with Intrinsic Plasticity
Current models for the learning of feature detectors work on two time scales: on a fast time scale the internal neurons' activations adapt to the current stimulus; on a slow ...
Cornelius Weber, Jochen Triesch