Sciweavers

11 search results - page 1 / 3
» Efficient generation of simple polygons for characterizing t...
Sort
View
IJCGA
2010
91views more  IJCGA 2010»
13 years 2 months ago
Pareto Envelopes in Simple Polygons
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann ...
COMPGEOM
2007
ACM
13 years 8 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
CVPR
2008
IEEE
14 years 6 months ago
Efficient object shape recovery via slicing planes
Recovering the three-dimensional (3D) object shape lies as an unresolved and active research topic on the crosssection of computer vision, photogrammetry and bioinformatics. Altho...
Po-Lun Lai, Alper Yilmaz
CVPR
2001
IEEE
14 years 6 months ago
Light Field Rendering for Large-Scale Scenes
In this paper, we present an efficient method to synthesize large-scale scenes, such as broad city landscapes. To date, model based approaches have mainly been adopted for this pu...
Hiroshi Kawasaki, Katsushi Ikeuchi, Masao Sakauchi