Sciweavers

401 search results - page 22 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
83
Voted
COMPGEOM
2010
ACM
15 years 2 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
DSN
2006
IEEE
15 years 3 months ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz
92
Voted
WSC
2000
14 years 11 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen
115
Voted
ISMM
2011
Springer
14 years 13 days ago
Surface Reconstruction Using Power Watershed
Abstract. Surface reconstruction from a set of noisy point measurements has been a well studied problem for several decades. Recently, variational and discrete optimization approac...
Camille Couprie, Xavier Bresson, Laurent Najman, H...
CCCG
2006
14 years 11 months ago
An Optimal Solution to Room Search Problem
A room is a simple polygon with a prespecified point, called the door, on its boundary. A search starts at the door and must detect any intruder that may be in the room, while maki...
Binay K. Bhattacharya, John Z. Zhang, Qiaosheng Sh...