Sciweavers

450 search results - page 61 / 90
» Quadrangulations of Planar Sets
Sort
View
DCOSS
2006
Springer
14 years 26 days ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
SIGGRAPH
1987
ACM
14 years 20 days ago
Direct least-squares fitting of algebraic surfaces
In the course of developing a system for fitting smooth curves to camera input we have developed several direct (i.e. noniterative) methods for fitting a shape (line, circle, conic...
Vaughan R. Pratt
ICDCS
2002
IEEE
14 years 2 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li
COMPGEOM
1995
ACM
14 years 23 days ago
Triangulations Intersect Nicely
Abstract. We show that there is a matching between the edges of any two triangulations of a planar point set such that an edge of one triangulation is matched either to the identic...
Oswin Aichholzer, Franz Aurenhammer, Michael Tasch...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
13 years 11 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn