Sciweavers

205 search results - page 26 / 41
» On Deletion in Delaunay Triangulations
Sort
View
COMPGEOM
1993
ACM
13 years 11 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
CCCG
2008
13 years 9 months ago
A Distributed Algorithm for Computing Voronoi Diagram in the Unit Disk Graph Model
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
Yurai Núñez Rodríguez, Henry ...
CCCG
2003
13 years 9 months ago
Estimation of the necessary number of points in Riemannian Voronoi
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
Kensuke Onishi, Jin-ichi Itoh
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 6 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
VISUALIZATION
2005
IEEE
14 years 1 months ago
Quality Mesh Generation for Molecular Skin Surfaces Using Restricted Union of Balls
Quality surface meshes for molecular models are desirable in the studies of protein shapes and functionalities. However, there is still no robust software that is capable to gener...
Ho-Lun Cheng, Xinwei Shi