Sciweavers

2342 search results - page 275 / 469
» Sublinear geometric algorithms
Sort
View
123
Voted
ISVD
2010
IEEE
15 years 1 months ago
Guaranteed Quality Tetrahedral Delaunay Meshing for Medical Images
—In this paper, we present a Delaunay refinement algorithm for meshing 3D medical images. We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less tha...
Panagiotis A. Foteinos, Andrey N. Chernikov, Nikos...
115
Voted
VC
2010
160views more  VC 2010»
15 years 1 months ago
A lightweight approach to repairing digitized polygon meshes
Abstract When designing novel algorithms for geometric processing and analysis, researchers often assume that the input conforms to several requirements. On the other hand, polygon...
Marco Attene
CVPR
2007
IEEE
16 years 5 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
185
Voted
MOBIHOC
2005
ACM
16 years 3 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...