Sciweavers

2093 search results - page 158 / 419
» Statistical Point Geometry
Sort
View
138
Voted
ICCSA
2007
Springer
15 years 10 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
126
Voted
CVPR
2010
IEEE
15 years 9 months ago
3D Curve Sketch: Flexible Curve-Based Stereo Reconstruction and Calibration
Interest point-based multiview 3D reconstruction and calibration methods have been very successful in select applications but are not applicable when an abundance of feature point...
Ricardo Fabbri, Benjamin Kimia
CVPR
2010
IEEE
15 years 8 months ago
Action Classification on Product Manifolds
Videos can be naturally represented as multidimensional arrays known as tensors. However, the geometry of the tensor space is often ignored. In this paper, we argue that the under...
Yui Man Lui, J Ross Beveridge, Michael Kirby
COMPGEOM
1998
ACM
15 years 8 months ago
Viewspace Partitioning of Densely Occluded Scenes
Computing the visibility of out-door scenes is often much harder than of in-door scenes. A typical urban scene, for example, is densely occluded, and it is effective to precompute...
Yiorgos Chrysanthou, Daniel Cohen-Or, Eyal Zadicar...
150
Voted
COMPGEOM
1998
ACM
15 years 8 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled