Sciweavers

286 search results - page 34 / 58
» Proximality and Chebyshev sets
Sort
View
SCIA
2009
Springer
146views Image Analysis» more  SCIA 2009»
14 years 4 months ago
Extraction of Windows in Facade Using Kernel on Graph of Contours
In the past few years, street-level geoviewers has become a very popular web-application. In this paper, we focus on a first urban concept which has been identified as useful for...
Jean-Emmanuel Haugeard, Sylvie Philipp-Foliguet, F...
ICPR
2008
IEEE
14 years 4 months ago
Approximation of salient contours in cluttered scenes
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
Rui Huang, Nong Sang, Qiling Tang
SMI
2006
IEEE
186views Image Analysis» more  SMI 2006»
14 years 3 months ago
BSP Shapes
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
Carsten Stoll, Hans-Peter Seidel, Marc Alexa
INFOCOM
2005
IEEE
14 years 3 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...
COMPGEOM
2004
ACM
14 years 3 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen