Sciweavers

4761 search results - page 124 / 953
» Generalizing Boundary Points
Sort
View
COMPGEOM
2007
ACM
14 years 6 days ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly
CCCG
2010
13 years 9 months ago
Blocking delaunay triangulations
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl,...
BIOCOMP
2006
13 years 9 months ago
Performance of Sequence Alignment Bioinformatics Applications on General Purpose Processors: A Case Study
- Aligning specific sequences against other known sequences in a database is a central aspect of bioinformatics. New experimental data being added continuously to these databases n...
Pradeep Nair, Eugene John
ATAL
2010
Springer
13 years 9 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
TCS
2008
13 years 8 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger