Sciweavers

2183 search results - page 19 / 437
» Multi-pass geometric algorithms
Sort
View
ALGOSENSORS
2007
Springer
14 years 4 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
COCOON
2006
Springer
14 years 1 months ago
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
Marc Benkert, Joachim Gudmundsson, Christian Knaue...
ICIP
2002
IEEE
14 years 11 months ago
Generic attribute deviation metric for assessing mesh simplification algorithm quality
This paper describes an efficient method to compare two triangular meshes. Meshes considered here contain geometric features as well as other surface attributes such as material c...
Frédéric Truchetet, Michaël Roy...
ICFEM
2005
Springer
14 years 3 months ago
Using Three-Valued Logic to Specify and Verify Algorithms of Computational Geometry
Many safety-critical systems deal with geometric objects. Reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for th...
Jens Brandt, Klaus Schneider
FOCS
1994
IEEE
14 years 1 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid