Sciweavers

150 search results - page 29 / 30
» Flipping Edges in Triangulations
Sort
View
NETWORK
2007
167views more  NETWORK 2007»
13 years 7 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
PODC
2009
ACM
14 years 8 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
3DGIS
2006
Springer
14 years 1 months ago
Reconstruction of Complex Buildings using LIDAR and 2D Maps
The extraction of the building models from remote-sensed data is an important work in the geographic information systems. This investigation describes an approach to integrate LIDA...
Tee-Ann Teo, Jiann-Yeou Rau, Liang-Chien Chen, Jin...
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy
SCALESPACE
2005
Springer
14 years 1 months ago
Discrete Representation of Top Points via Scale Space Tessellation
In previous work, singular points (or top points) in the scale space representation of generic images have proven valuable for image matching. In this paper, we propose a construct...
Bram Platel, M. Fatih Demirci, Ali Shokoufandeh, L...