Sciweavers

42 search results - page 8 / 9
» Random triangulations of planar point sets
Sort
View
ICRA
2008
IEEE
126views Robotics» more  ICRA 2008»
14 years 2 months ago
Towards detection of orthogonal planes in monocular images of indoor environments
— In this paper, we describe the components of a novel algorithm for the extraction of dominant orthogonal planar structures from monocular images taken in indoor environments. T...
Branislav Micusík, Horst Wildenauer, Markus...
IVC
2008
138views more  IVC 2008»
13 years 7 months ago
Reconstructing relief surfaces
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...
George Vogiatzis, Philip H. S. Torr, Steven M. Sei...
SMI
2003
IEEE
131views Image Analysis» more  SMI 2003»
14 years 26 days ago
Watermarking 2D Vector Maps in the Mesh-Spectral Domain
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
Ryutarou Ohbuchi, Hiroo Ueda, Shuh Endoh
COMPGEOM
1994
ACM
13 years 11 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
ICALP
2001
Springer
14 years 2 days ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan