Sciweavers

52 search results - page 7 / 11
» Triangulations Intersect Nicely
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 5 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
CVPR
2006
IEEE
14 years 9 months ago
Vertical Parallax from Moving Shadows
This paper presents a method for capturing and computing 3D parallax. 3D parallax, as used here, refers to vertical offset from the ground plane, height. The method is based on an...
Yaron Caspi, Michael Werman
COMPGEOM
2009
ACM
14 years 1 months ago
Parallel geometric algorithms for multi-core computers
Computers with multiple processor cores using shared memory are now ubiquitous. In this paper, we present several parallel geometric algorithms that specifically target this envi...
Vicente H. F. Batista, David L. Millman, Sylvain P...
WACV
2005
IEEE
14 years 19 days ago
Automatic Augmentation and Meshing of Sparse 3D Scene Structure
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
Oli Cooper, Neill W. Campbell, David P. Gibson